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

DOI10.1111/j.1475-3995.2006.00557.xzbMath1145.90344OpenAlexW2068253853MaRDI QIDQ3422371

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

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

Cites Work

• Unnamed Item
• The vehicle routing problem: An overview of exact and approximate algorithms
• Lagrangian duality applied to the vehicle routing problem with time windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Vehicle Routing with Time Windows
• Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• 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