An adaptive memory algorithm for the split delivery vehicle routing problem

DOI10.1007/S10732-008-9101-3MaRDI QIDQ972645zbMATH OpenOpenAlexFDO

Authors Rafael E. Aleman, Xinhui Zhang, Raymond R. Hill

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

heuristicvehicle routingvariable neighborhood descentsplit deliveryadaptive memoryroute angle control

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Recommendations

• A novel approach to solve the split delivery vehicle routing problem
• A SPLIT DELIVERY VEHICLE ROUTING PROBLEM
• The split delivery vehicle routing problem: A survey
• The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
• Vehicle routing problems with split deliveries

Cites work

• scientific article; zbMATH DE number 3643061 (Why is no real title available?)
• scientific article; zbMATH DE number 591242 (Why is no real title available?)
• scientific article; zbMATH DE number 279304 (Why is no real title available?)
• A Lower Bound for the Split Delivery Vehicle Routing Problem
• A column generation approach for the split delivery vehicle routing problem
• A food distribution network problem: a case study
• A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing
• A reactive variable neighborhood search for the vehicle-routing problem with time windows
• A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
• An Integer Programming Approach to the Vehicle Scheduling Problem
• An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
• Routing helicopters for crew exchanges on off-shore locations
• Savings by Split Delivery Routing
• Split delivery routing
• Split-delivery routeing heuristics in livestock feed distribution
• The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
• The split delivery vehicle scheduling problem with time windows and grid network distances
• The truck dispatching problem
• Variable neighborhood search
• Vehicle routing with split deliveries

Cited in

(12)

• New exact solution approaches for the split delivery vehicle routing problem
• Vehicle routing problems with split deliveries
• A branch-and-cut embedded matheuristic for the inventory routing problem
• Branch-and-cut algorithms for the split delivery vehicle routing problem
• A randomized granular tabu search heuristic for the split delivery vehicle routing problem
• The split delivery vehicle routing problem: A survey
• Adaptive memory artificial bee colony algorithm for Green vehicle routing with cross-docking
• 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
• Split delivery routing
• Model and algorithm for split delivery vehicle routing problem with stochastic customers
• A novel approach to solve the split delivery vehicle routing problem

Describes a project that uses

Uses Software

• VRP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972645)