Modeling and optimization of vehicle routing and arc routing problems

MaRDI QIDQ5494216zbMATH OpenFDO

Authors Jean-François Cordeau, G. Laporte

Publication date 17 October 2006

zbMATH Keywords

algorithmsarc routing problemsbranch-and-cutmetaheuristicsmodelstabu searchvariable neighbourhood searchvehicle routing problem

Mathematics Subject Classification ID

Traffic problems in operations research (90B20) Search theory (90B40) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• The vehicle routing problem: An overview of exact and approximate algorithms
• scientific article; zbMATH DE number 956786
• A deterministic tabu search algorithm for the capacitated arc routing problem
• The vehicle routing problem
• scientific article; zbMATH DE number 1568943

Cited in

(7)

• The arc-item-load and related formulations for the cumulative vehicle routing problem
• Modeling and solving the capacitated vehicle routing problem on trees
• The Arc Routing and Scheduling Problem with Transshipment
• Joint vehicle assembly‐routing problems: An integrated modeling and optimization approach
• A scheme for determining vehicle routes based on Arc-based service network design
• A model for routing problem in quay management problem
• Combined route capacity and route length models for unit demand vehicle routing problems

Describes a project that uses

Uses Software

• CVRPSP

This page was built for publication: Modeling and optimization of vehicle routing and arc routing problems

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