A new intuitional algorithm for solving heterogeneous fixed fleet routing problems: passenger pickup algorithm
From MaRDI portal
Publication:856161
DOI10.1016/J.AMC.2006.02.043zbMATH Open1102.90313OpenAlexW2127989642MaRDI QIDQ856161FDOQ856161
Ịsmail Top, Emel Kızılkaya Aydoğan, Cevriye Gencer
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
Recommendations
- A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem
- A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem
- A tabu search heuristic for the heterogeneous fleet vehicle routing problem
- A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem.
Cites Work
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem.
- The fleet size and mix vehicle routing problem
- Incorporating vehicle into the vehicle routing fleet composition problem
- A heuristic column generation method for the heterogeneous fleet VRP
Cited In (5)
- Industrial aspects and literature survey: fleet composition and routing
- Thirty years of heterogeneous vehicle routing
- Adaptive neighborhood simulated annealing for the heterogeneous fleet vehicle routing problem with multiple cross-docks
- A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem
- Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem
This page was built for publication: A new intuitional algorithm for solving heterogeneous fixed fleet routing problems: passenger pickup algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856161)
