The savings algorithm for the vehicle routing problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3643061 (Why is no real title available?)
- scientific article; zbMATH DE number 3679550 (Why is no real title available?)
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- A Vehicle Scheduling Procedure Based Upon Savings and a Solution Perturbation Scheme
- An Integer Programming Approach to the Vehicle Scheduling Problem
- Computer Solutions of the Traveling Salesman 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
Cited in
(33)- On the vehicle routing problem
- The school bus routing problem: a review
- The improved saving methods of vehicle routing problems with time window
- An adaptive memory programming method for risk logistics operations
- A review of vehicle routing with simultaneous pickup and delivery
- A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem
- Use of the BATA algorithm and MIS to solve the mail carrier problem
- Sequential search and its application to vehicle-routing problems
- Solving the vehicle routing problem with adaptive memory programming methodology
- Application of Adapt-CMSA to the two-echelon electric vehicle routing problem with simultaneous pickup and deliveries
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- The vehicle routing problem: An overview of exact and approximate algorithms
- Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem
- The ALGACEA‐1 method for the capacitated vehicle routing problem
- The multiple shortest path problem with path deconfliction
- scientific article; zbMATH DE number 2144496 (Why is no real title available?)
- MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem
- A heuristic algorithm for the asymmetric capacitated vehicle routing problem
- Grocery distribution plans in urban networks with street crossing penalties
- A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem
- 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.
- A flexible adaptive memory-based algorithm for real-life transportation operations: two case studies from dairy and construction sector
- An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
- Routing problems: A bibliography
- Combined location-routing problems -- a neural network approach
- scientific article; zbMATH DE number 2079884 (Why is no real title available?)
- A parametric analysis of heuristics for the vehicle routing problem with side-constraints
- Microcomputer-based vehicle routing and scheduling software
- Enhanced savings calculation and its applications for solving capacitated vehicle routing problem
- Integrating purchasing and routing in a propane gas supply chain.
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Implementation techniques for the vehicle routing problem
This page was built for publication: The savings algorithm for the vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1097832)
