Abstract
This work presents the results on applying a genetic approach for solving the Dial-A-Ride Problem (DARP). The problem consists of assigning and scheduling a set of user transport requests to a fleet of available vehicles in the most efficient way according to a given objective function. The literature offers different heuristics for solving DARP, a well known NP-hard problem, which range from traditional insertion and clustering algorithms to soft computing techniques. On the other hand, the approach through Genetic Algorithms (GA) has been experienced in problems of combinatorial optimization. We present our experience and results of a study to develop and test different GAs in the aim of finding an appropriate encoding and configuration, specifically for the DARP problem with time windows. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Cubillos, C., Rodriguez, N., & Crawford, B. (2007). A study on genetic algorithms for the DARP problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4527 LNCS, pp. 498–507). Springer Verlag. https://doi.org/10.1007/978-3-540-73053-8_50
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
