Regresar

A study on genetic algorithms for the DARP problem

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.

Año de publicación:

2007

Keywords:

    Fuente:

    scopusscopus

    Tipo de documento:

    Conference Object

    Estado:

    Acceso restringido

    Áreas de conocimiento:

    • Algoritmo
    • Algoritmo

    Áreas temáticas:

    • Ciencias de la computación

    Contribuidores:

    Cubillos C.Cubillos C.
    Nibaldo RodríguezNibaldo Rodríguez
    Crawford B.Crawford B.