Tabu search algorithm for the discrete split delivery vehicle routing problem

DOI10.11990/JHEU.201801010MaRDI QIDQ5194200zbMATH OpenFDO

Authors Meng Qiu, Zhuo Fu

Publication date 20 September 2019

Full work available at URL https://doi.org/10.11990/JHEU.201801010

zbMATH Keywords

discrete splitlogistics distributionneighborhood operationsplit deliverytabu searchvehicle routing problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
• A randomized granular tabu search heuristic for the split delivery vehicle routing problem
• A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
• The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
• A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars

Cited in

(7)

• A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars
• A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
• A novel discrete differential evolution algorithm for the vehicle routing problem in B2C e-commerce
• A tabu search algorithm for the single vehicle routing allocation problem
• A Tabu Search Approach for Delivering Pet Food and Flour in Switzerland
• A randomized granular tabu search heuristic for the split delivery vehicle routing problem
• A bee colony optimization algorithm for split delivery vehicle routing problem

This page was built for publication: Tabu search algorithm for the discrete split delivery vehicle routing problem

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