A new branching strategy for time constrained routing problems with application to backhauling
From MaRDI portal
Publication:1908295
DOI10.1007/BF02098283zbMath0839.90029MaRDI QIDQ1908295
Marius M. Solomon, Jacques Desrosiers, Martin Desrochers, Sylvie Gélinas
Publication date: 26 February 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
90C35: Programming involving graphs or networks
90C06: Large-scale problems in mathematical programming
90C10: Integer programming
90B06: Transportation, logistics and supply chain management
90B35: Deterministic scheduling theory in operations research
Related Items
Exact approaches for integrated aircraft fleeting and routing at TunisAir, A unified heuristic for a large class of vehicle routing problems with backhauls, A column generation approach to the heterogeneous fleet vehicle routing problem, Comparing backhauling strategies in vehicle routing using ant colony optimization, The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach, A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands, Fleet assignment and routing with schedule synchronization constraints, The traveling salesman problem with backhauls, Column generation approaches to ship scheduling with flexible cargo sizes, A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands, Vehicle routing problems with simultaneous pick-up and delivery service., Heuristic approaches to vehicle routing with backhauls and time windows, A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The vehicle routing problem with backhauls
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW