An adaptive memory algorithm for the split delivery vehicle routing problem
From MaRDI portal
Publication:972645
DOI10.1007/s10732-008-9101-3zbMath1187.90036MaRDI QIDQ972645
Raymond R. Hill, Xinhui Zhang, Rafael E. Aleman
Publication date: 21 May 2010
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-008-9101-3
vehicle routing; heuristic; variable neighborhood descent; split delivery; adaptive memory; route angle control
90B06: Transportation, logistics and supply chain management
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- Vehicle routing with split deliveries
- Variable neighborhood search
- Routing helicopters for crew exchanges on off-shore locations
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
- The split delivery vehicle scheduling problem with time windows and grid network distances
- The Truck Dispatching Problem
- A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
- Split delivery routing
- Savings by Split Delivery Routing
- An Integer Programming Approach to the Vehicle Scheduling Problem
- Split-delivery routeing heuristics in livestock feed distribution
- A Lower Bound for the Split Delivery Vehicle Routing Problem
- The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
- A food distribution network problem: a case study
- A column generation approach for the split delivery vehicle routing problem
