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

Fixed-fleet heterogeneous vehicle routing is a type of vehicle routing problem that aims to provide service to a specific customer group with minimum cost, with a limited number of vehicles with different capacities. In this study, a new intuitional algorithm, which can divide the demands at the sto...

Full description

Saved in:
Bibliographic Details
Published inApplied mathematics and computation Vol. 181; no. 2; pp. 1552 - 1567
Main Authors Gencer, Cevriye, Top, İsmail, Aydogan, Emel Kizilkaya
Format Journal Article
LanguageEnglish
Published New York, NY Elsevier Inc 15.10.2006
Elsevier
Subjects
Algorithm
Applied sciences
Exact sciences and technology
Heterogeneous fleet
Mathematical programming
Operational research and scientific management
Operational research. Management science
Optimization. Search problems
Routing
Routing
Algorithm
Heterogeneous fleet
Routing algorithm
Applied mathematics
Online AccessGet full text
ISSN0096-3003
1873-5649
DOI10.1016/j.amc.2006.02.043

Cover

More Information
Summary:Fixed-fleet heterogeneous vehicle routing is a type of vehicle routing problem that aims to provide service to a specific customer group with minimum cost, with a limited number of vehicles with different capacities. In this study, a new intuitional algorithm, which can divide the demands at the stops for fixed heterogeneous vehicle routing, is developed and tested on tests samples. The algorithm is compared to the BATA Algorithm available in the literature in relation to the number of vehicles, fixed cost, variable cost and total cost.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2006.02.043