A tabu search with vocabulary building approach for the vehicle routing problem with Split demands

DOI10.1504/IJMHEUR.2010.033123zbMATH Open1219.90018OpenAlexW2010778845MaRDI QIDQ537992FDOQ537992

Rafael E. Aleman, Raymond R. Hill

Publication date: 23 May 2011

Published in: International Journal of Metaheuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijmheur.2010.033123

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)

Cited In (9)

• New exact solution approaches for the split delivery vehicle routing problem
• Particle Swarm Optimization for Split Delivery Vehicle Routing Problem
• Heuristic solution approaches for the cumulative capacitated vehicle routing problem
• Vehicle routing problems with split deliveries
• Branch-and-cut algorithms for the split delivery vehicle routing problem
• A randomized granular tabu search heuristic for the split delivery vehicle routing problem
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
• An iterated local search heuristic for the split delivery vehicle routing problem
• A novel approach to solve the split delivery vehicle routing problem

Uses Software

• BoneRoute

This page was built for publication: A tabu search with vocabulary building approach for the vehicle routing problem with Split demands

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