Parallel Savings Based Heuristics for the Delivery Problem
From MaRDI portal
Publication:3978843
DOI10.1287/opre.39.3.456zbMath0744.90026MaRDI QIDQ3978843
Bezalel Gavish, Kemal Altinkemer
Publication date: 25 June 1992
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.39.3.456
heuristics; vehicle routing; delivery problem; fleet of capacitated vehicles; parallel savings algorithms
90C35: Programming involving graphs or networks
90B06: Transportation, logistics and supply chain management
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
\textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care, An exact algorithm for the capacitated facility location problems with single sourcing, A result on projection for the vehicle routing problem, Topological design of telecommunication networks --- local access design methods, Planning models for freight transportation, Topological design of ring networks, Improvement heuristics for the vehicle routing problem based on simulated annealing, Optimization of multi-feeder (depot) printed circuit board manufacturing with error guarantees., Optimization of printed circuit board manufacturing: Integrated modeling and algorithms, A parametric analysis of heuristics for the vehicle routing problem with side-constraints, A repeated matching heuristic for the single-source capacitated facility location problem, Routing problems: A bibliography, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem
