A new intuitional algorithm for solving heterogeneous fixed fleet routing problems: passenger pickup algorithm

DOI10.1016/j.amc.2006.02.043zbMath1102.90313OpenAlexW2127989642MaRDI QIDQ856161

Ịsmail Top, Cevriye Gencer, Emel Kızılkaya Aydoğan

Publication date: 7 December 2006

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.02.043

zbMATH Keywords

algorithmroutingheterogeneous fleet

Mathematics Subject Classification ID

Traffic problems in operations research (90B20)

Related Items

Thirty years of heterogeneous vehicle routing ⋮ Adaptive neighborhood simulated annealing for the heterogeneous fleet vehicle routing problem with multiple cross-docks ⋮ Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem ⋮ Industrial aspects and literature survey: fleet composition and routing

Cites Work

• The fleet size and mix vehicle routing problem
• A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem.
• Incorporating vehicle into the vehicle routing fleet composition problem
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• A heuristic column generation method for the heterogeneous fleet VRP