Optimizing single depot heterogeneous fleet vehicle routing problem by improved genetic algorithm

DOI10.1007/978-3-642-14880-4_83MaRDI QIDQ4930985zbMATH OpenOpenAlexFDO

Authors Haixiang Guo, Kejun Zhu, Lan-Lan Li, Juan Yang

Publication date 2 October 2010

Published in Advances in Intelligent and Soft Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14880-4_83

zbMATH Keywords

genetic algorithmheterogeneous fleetsweeping algorithmvehicle routing problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20) Case-oriented studies in operations research (90B90)

Recommendations

• Multi-objective optimisation using genetic algorithm based clustering for multi-depot heterogeneous fleet vehicle routing problem with time windows
• A hybrid algorithm for the heterogeneous fleet vehicle routing problem
• An improved genetic algorithm for vehicle routing problem
• scientific article; zbMATH DE number 2013520
• A simple and effective evolutionary algorithm for the vehicle routing problem

Cited in

(2)

• Multi-objective optimisation using genetic algorithm based clustering for multi-depot heterogeneous fleet vehicle routing problem with time windows
• A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems

This page was built for publication: Optimizing single depot heterogeneous fleet vehicle routing problem by improved genetic algorithm

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