A reactive MILP approach to the multidepot heterogeneous fleet vehicle routing problem with time windows

DOI10.1111/J.1475-3995.2006.00557.XMaRDI QIDQ3422371zbMATH OpenOpenAlexFDO

Authors Rodolfo Dondo, Jaime Cerdá

Publication date 13 February 2007

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/j.1475-3995.2006.00557.x

zbMATH Keywords

mixed integer linear programming

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20) Mixed integer programming (90C11)

Cites work

• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• scientific article; zbMATH DE number 1128822 (Why is no real title available?)
• Lagrangian duality applied to the vehicle routing problem with time windows
• Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• The vehicle routing problem: An overview of exact and approximate algorithms
• Vehicle Routing with Time Windows
• Vehicle Routing with Time Windows: Two Optimization Algorithms

This page was built for publication: A reactive MILP approach to the multidepot heterogeneous fleet vehicle routing problem with time windows

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