Parallel Savings Based Heuristics for the Delivery Problem

DOI10.1287/OPRE.39.3.456MaRDI QIDQ3978843zbMATH OpenOpenAlexFDO

Authors Kemal Altinkemer, Bezalel Gavish

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

zbMATH Keywords

heuristicsvehicle routingdelivery problemfleet of capacitated vehiclesparallel savings algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Transportation, logistics and supply chain management (90B06)

Recommendations

• The savings algorithm for the vehicle routing problem
• A parallel algorithm for the vehicle routing problem
• Saving-based algorithms for vehicle routing problem with simultaneous pickup and delivery
• A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
• A parallel algorithm for the vehicle routing problem with time window constraints

Cited in

(20)

• Topological design of ring networks
• A review of vehicle routing with simultaneous pickup and delivery
• Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem
• A stochastic optimization approach for staff scheduling decisions at inpatient units
• Vehicle routing and appointment scheduling with team assignment for home services
• An exact algorithm for the capacitated facility location problems with single sourcing
• Planning models for freight transportation
• Optimization of multi-feeder (depot) printed circuit board manufacturing with error guarantees.
• \textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care
• Optimization of printed circuit board manufacturing: Integrated modeling and algorithms
• Improvement heuristics for the vehicle routing problem based on simulated annealing
• Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs
• A repeated matching heuristic for the single-source capacitated facility location problem
• The savings algorithm for the vehicle routing problem
• A result on projection for the vehicle routing problem
• DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic
• Routing problems: A bibliography
• Topological design of telecommunication networks --- local access design methods
• A parametric analysis of heuristics for the vehicle routing problem with side-constraints
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem

This page was built for publication: Parallel Savings Based Heuristics for the Delivery Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3978843)