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

DOI10.1007/978-0-387-77778-8_14MaRDI QIDQ3564362zbMATH OpenOpenAlexFDO

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

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 generationextended formulationsbranch-and-boundcutting plane algorithms

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Recommendations

• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Integer Programming and Combinatorial Optimization
• Robust vehicle routing under uncertainty via branch-price-and-cut
• The robust vehicle routing problem with time windows: solution by branch and price and cut
• A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
• A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem
• Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty
• Improved branch-cut-and-price for capacitated vehicle routing
• Improved branch-cut-and-price for capacitated vehicle routing
• A branch-and-cut algorithm for vehicle routing problems

Cites work

• scientific article; zbMATH DE number 1234739 (Why is no real title available?)
• scientific article; zbMATH DE number 1749222 (Why is no real title available?)
• 2-path cuts for the vehicle routing problem with time windows
• A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
• A Polyhedral Intersection Theorem for Capacitated Spanning Trees
• A column generation approach to the heterogeneous fleet vehicle routing problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
• Branch-and-price: Column generation for solving huge integer programs
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Formulations and valid inequalities for the heterogeneous vehicle routing problem
• Integer Programming and Combinatorial Optimization
• Lot-sizing with start-up times
• Multimodal Express Package Delivery: A Service Network Design Application
• Multistars, partial multistars and the capacitated vehicle routing problem
• On a Generalization of the Master Cyclic Group Polyhedron
• Path inequalities for the vehicle routing problem with time windows
• Polyhedral study of the capacitated vehicle routing problem
• Projection results for vehicle routing
• Reachability cuts for the vehicle routing problem with time windows
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
• Stabilized column generation
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• The fleet size and mix vehicle routing problem
• The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem
• The shortest-path problem with resource constraints and k-cycle elimination for k 3
• The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
• Time-Indexed Formulations for Machine Scheduling Problems: Column Generation

Cited in

(34)

• Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty
• Robust vehicle routing under uncertainty via branch-price-and-cut
• A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
• A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem
• A matheuristic for the asymmetric capacitated vehicle routing problem
• The capacitated general windy routing problem with turn penalties
• The demand weighted vehicle routing problem
• A hybrid algorithm for a class of vehicle routing problems
• Improved branch-cut-and-price for capacitated vehicle routing
• A note on branch-and-cut-and-price
• Exact algorithms for routing problems under vehicle capacity constraints
• An ILP improvement procedure for the open vehicle routing problem
• An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
• scientific article; zbMATH DE number 3914108 (Why is no real title available?)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
• Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
• scientific article; zbMATH DE number 6831597 (Why is no real title available?)
• Technical Note—The Complexity of the Pricing Problem of the Set Partitioning Formulation of Vehicle Routing Problems
• Tolerance-based vs. cost-based branching for the asymmetric capacitated vehicle routing problem
• Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams
• The time dependent traveling salesman problem: polyhedra and algorithm
• Addressing orientation symmetry in the time window assignment vehicle routing problem
• Combined maintenance and routing optimization for large-scale sewage cleaning
• Arc flow formulations based on dynamic programming: theoretical foundations and applications
• Resource-robust valid inequalities for vehicle routing and related problems
• Transportation infrastructure maintenance planning: an exact column enumeration approach
• A hybrid algorithm for the heterogeneous fleet vehicle routing problem
• Exact solution of network flow models with strong relaxations
• Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems
• scientific article; zbMATH DE number 7366007 (Why is no real title available?)
• Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
• The Vehicle Routing Problem with Release and Due Dates
• An exact column-generation approach for the lot-type design problem
• Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem

Describes a project that uses

Uses Software

• CVRPSP

This page was built for publication: Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564362)