A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows

DOI10.1016/j.ejor.2004.07.077zbMath1113.90018MaRDI QIDQ853026

Rodolfo Dondo, Jaime Cerdá

Publication date: 15 November 2006

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

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

zbMATH Keywords

transportation; scheduling; routing; logistics

Mathematics Subject Classification ID

90B06: Transportation, logistics and supply chain management

90B35: Deterministic scheduling theory in operations research

Related Items

A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem, A computer-enabled solution procedure for food wholesalers' distribution decision in cities with a circular transportation infrastructure, A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem, A particle swarm optimization algorithm with path relinking for the location routing problem

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The vehicle routing problem: An overview of exact and approximate algorithms
• The spacefilling curve with optimal partitioning heuristic for the vehicle routing problem
• 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 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