Parallel Savings Based Heuristics for the Delivery Problem
The authors regard the problem of finding a set of routes for a fleet of capacitated vehicles to satisfy the cargo requirements of customers. The vehicles are located in a depot, and have to fulfill the delivery requirements in a sequence that minimizes total delivery costs. All vehicles have the same capacity. The authors present parallel savings algorithms for generating feasible solutions to this problem. The new algorithm combines the savings approach with matching based procedures. The authors compare the algorithm computationally with other heuristics.
- 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
- The savings algorithm for the vehicle routing problem
- 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
- Vehicle routing and appointment scheduling with team assignment for home services
- Routing problems: A bibliography
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- A review of vehicle routing with simultaneous pickup and delivery
- Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs
- Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem
- DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic
- A stochastic optimization approach for staff scheduling decisions at inpatient units
- \textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care
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)