The discrete time window assignment vehicle routing problem

DOI10.1016/j.ejor.2015.01.020zbMath1346.90180MaRDI QIDQ319363

Remy Spliet, Guy Desaulniers

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.01.020

zbMATH Keywords

column generation; vehicle routing; uncertain demand; time window assignment

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C15: Stochastic programming

90B06: Transportation, logistics and supply chain management

Uses Software

• CVRPSEP
• CVRPSP

Cites Work

• A branch-price-and-cut algorithm for the workover rig routing problem
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
• A reoptimization algorithm for the shortest path problem with time windows
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• A Suggested Computation for Maximal Multi-Commodity Network Flows
• 2-Path Cuts for the Vehicle Routing Problem with Time Windows
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• Column Generation based Primal Heuristics
• The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
• Decomposition Principle for Linear Programs
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• Introduction to Stochastic Programming
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Vehicle Routing Problem with Time Windows