Arcs-states models for the vehicle routing problem with time windows and related problems

DOI10.1016/J.COR.2005.05.024zbMath1102.90014OpenAlexW1997194016MaRDI QIDQ856684

Edith Naudin, Thierry Mautor

Publication date: 7 December 2006

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.05.024

zbMATH Keywords

branch and bound methodvehicle routing problemscolumn and row generation

Mathematics Subject Classification ID

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

Related Items (1)

Analysis of three mathematical models of the staff rostering problem

Cites Work

• Exact solution of bin-packing problems using column generation and branch-and-bound
• 2-Path Cuts for the Vehicle Routing Problem with Time Windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• A Decomposition-Based Pricing Procedure for Large-Scale Linear Programs: An Application to the Linear Multicommodity Flow Problem
• A Linear Programming Approach to the Cutting-Stock Problem
• Routing with time windows by column generation
• A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
• 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
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

This page was built for publication: Arcs-states models for the vehicle routing problem with time windows and related problems