Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems

DOI10.1007/978-0-387-77778-8_14zbMath1190.90283MaRDI QIDQ3564362

Eduardo Uchoa, Artur Alves Pessoa, Marcus Poggi de Aragão

Publication date: 2 June 2010

Published in: Operations Research/Computer Science Interfaces (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-0-387-77778-8_14

zbMATH Keywords

column generation; branch-and-bound; extended formulations; cutting plane algorithms

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B06: Transportation, logistics and supply chain management

Related Items

Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem, The Vehicle Routing Problem with Release and Due Dates, A hybrid algorithm for a class of vehicle routing problems, The capacitated general windy routing problem with turn penalties, Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems, Exact algorithms for routing problems under vehicle capacity constraints, An ILP improvement procedure for the open vehicle routing problem, A matheuristic for the asymmetric capacitated vehicle routing problem, Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems, Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem, The demand weighted vehicle routing problem, A hybrid algorithm for the heterogeneous fleet vehicle routing problem, The time dependent traveling salesman problem: polyhedra and algorithm, Combined maintenance and routing optimization for large-scale sewage cleaning, An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis, Improved branch-cut-and-price for capacitated vehicle routing, Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams, Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem

Uses Software

• CVRPSP

Cites Work

• Unnamed Item
• Unnamed Item
• Polyhedral study of the capacitated vehicle routing problem
• A column generation approach to the heterogeneous fleet vehicle routing problem
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
• The fleet size and mix vehicle routing problem
• The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
• Stabilized column generation
• Multistars, partial multistars and the capacitated vehicle routing problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Reachability cuts for the vehicle routing problem with time windows
• Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
• The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem
• Formulations and valid inequalities for the heterogeneous vehicle routing problem
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Projection results for vehicle routing
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• 2-Path Cuts for the Vehicle Routing Problem with Time Windows
• Lot-Sizing with Start-Up Times
• The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• A Polyhedral Intersection Theorem for Capacitated Spanning Trees
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
• Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
• Multimodal Express Package Delivery: A Service Network Design Application
• Path inequalities for the vehicle routing problem with time windows
• On a Generalization of the Master Cyclic Group Polyhedron
• Integer Programming and Combinatorial Optimization