An adaptive memory algorithm for the split delivery vehicle routing problem

DOI10.1007/S10732-008-9101-3zbMath1187.90036OpenAlexW2025178129MaRDI 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

zbMATH Keywords

vehicle routingheuristicvariable neighborhood descentsplit deliveryadaptive memoryroute angle control

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items (8)

Branch-and-cut algorithms for the split delivery vehicle routing problem ⋮ An iterated local search heuristic for the split delivery vehicle routing problem ⋮ Testing local search move operators on the vehicle routing problem with split deliveries and time windows ⋮ A branch-and-cut embedded matheuristic for the inventory routing problem ⋮ A novel approach to solve the split delivery vehicle routing problem ⋮ A randomized granular tabu search heuristic for the split delivery vehicle routing problem ⋮ New exact solution approaches for the split delivery vehicle routing problem ⋮ Vehicle routing problems with split deliveries

Uses Software

• VRP

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

This page was built for publication: An adaptive memory algorithm for the split delivery vehicle routing problem