An adaptive memory algorithm for the split delivery vehicle routing problem

DOI10.1007/S10732-008-9101-3zbMATH Open1187.90036OpenAlexW2025178129MaRDI QIDQ972645FDOQ972645

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

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

zbMATH Keywords

heuristicvehicle routingvariable neighborhood descentsplit deliveryadaptive memoryroute angle control

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Cites Work

• 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 efficient variable neighborhood search heuristic for very large scale vehicle routing problems
• Variable neighborhood search
• Title not available (Why is that?)
• A Lower Bound for the Split Delivery Vehicle Routing Problem
• The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
• Vehicle routing with split deliveries
• An Integer Programming Approach to the Vehicle Scheduling Problem
• A column generation approach for the split delivery vehicle routing problem
• A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
• A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing
• Routing helicopters for crew exchanges on off-shore locations
• The split delivery vehicle scheduling problem with time windows and grid network distances
• A food distribution network problem: a case study
• Title not available (Why is that?)
• Split-delivery routeing heuristics in livestock feed distribution
• Title not available (Why is that?)

Cited In (11)

• 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
• A novel approach to solve the split delivery vehicle routing problem

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)