Parallel Savings Based Heuristics for the Delivery Problem
From MaRDI portal
Publication:3978843
DOI10.1287/opre.39.3.456zbMath0744.90026OpenAlexW2115033809MaRDI 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
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
\textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, Routing problems: A bibliography, Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem, A review of vehicle routing with simultaneous pickup and delivery, An exact algorithm for the capacitated facility location problems with single sourcing, DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic, A result on projection for the vehicle routing problem, Improvement heuristics for the vehicle routing problem based on simulated annealing, A stochastic optimization approach for staff scheduling decisions at inpatient units, Optimization of multi-feeder (depot) printed circuit board manufacturing with error guarantees., Topological design of telecommunication networks --- local access design methods, Vehicle routing and appointment scheduling with team assignment for home services, Planning models for freight transportation, Optimization of printed circuit board manufacturing: Integrated modeling and algorithms, A parametric analysis of heuristics for the vehicle routing problem with side-constraints, Topological design of ring networks, A repeated matching heuristic for the single-source capacitated facility location problem
