The savings algorithm for the vehicle routing problem

DOI10.1016/0377-2217(88)90154-3zbMath0635.90047OpenAlexW1986867012MaRDI QIDQ1097832

H. Paessens

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0377-2217(88)90154-3

zbMATH Keywords

vehicle routingsavings method

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items

Use of the BATA algorithm and MIS to solve the mail carrier problem, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem, MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem, Routing problems: A bibliography, A flexible adaptive memory-based algorithm for real-life transportation operations: two case studies from dairy and construction sector, An efficient variable neighborhood search heuristic for very large scale vehicle routing problems, A review of vehicle routing with simultaneous pickup and delivery, Grocery distribution plans in urban networks with street crossing penalties, Application of Adapt-CMSA to the two-echelon electric vehicle routing problem with simultaneous pickup and deliveries, A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem., Combination of geographical information system and efficient routing algorithms for real life distribution operations., Integrating purchasing and routing in a propane gas supply chain., On the vehicle routing problem, The vehicle routing problem: An overview of exact and approximate algorithms, Sequential search and its application to vehicle-routing problems, Solving the vehicle routing problem with adaptive memory programming methodology, An adaptive memory programming method for risk logistics operations, The multiple shortest path problem with path deconfliction, A heuristic algorithm for the asymmetric capacitated vehicle routing problem, The ALGACEA‐1 method for the capacitated vehicle routing problem, Combined location-routing problems -- a neural network approach, The school bus routing problem: a review, An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries, Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem, A parametric analysis of heuristics for the vehicle routing problem with side-constraints

Uses Software

• VRP
• heapsort
• Algorithm 347

Cites Work

• Unnamed Item
• Unnamed Item
• A Vehicle Scheduling Procedure Based Upon Savings and a Solution Perturbation Scheme
• An Integer Programming Approach to the Vehicle Scheduling Problem
• Implementing vehicle routing algorithms
• Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
• The Vehicle Scheduling Problem and Monte Carlo Simulation
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• Computer Solutions of the Traveling Salesman Problem