Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
From MaRDI portal
Publication:4021367
DOI10.1287/ijoc.2.1.64zbMath0752.90018OpenAlexW2034097982MaRDI QIDQ4021367
David Simchi-Levi, Chung-Lun Li
Publication date: 16 January 1993
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2.1.64
Transportation, logistics and supply chain management (90B06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (20)
Bounds for the general capacitated routing problem ⋮ Routing problems: A bibliography ⋮ Improved bounds for vehicle routing solutions ⋮ Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem ⋮ Bifactor approximation for location routing with vehicle and facility capacities ⋮ Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems ⋮ A tabu search heuristic for the multi-depot vehicle routing problem ⋮ Iterated tour partitioning for Euclidean capacitated vehicle routing ⋮ Optimization of multi-feeder (depot) printed circuit board manufacturing with error guarantees. ⋮ Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries ⋮ Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees ⋮ A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing ⋮ Real-Time Optimal Time-Critical Target Assignment for UAVs ⋮ Analysis of heuristics for the design of tree networks ⋮ Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems ⋮ Approximation algorithms for the load-balanced capacitated vehicle routing problem ⋮ Locating Depots for Capacitated Vehicle Routing ⋮ A genetic algorithm for service level based vehicle scheduling ⋮ Probabilistic analysis for a multiple depot vehicle routing problem ⋮ Topological design of ring networks
This page was built for publication: Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
