Regresar

Hybrid approach to crew pairing optimization

Abstract:

In order to be able to solve any combinatorial optimization problem It seems that a good idea is to use both Incomplete and complete techniques together. When problems are easy enough to allow searching for the optimal solution, complete techniques can be used. When problems become harder, incomplete techniques represent a good alternative in order to solve approximately the problem. Particularly, promising possibilities of hybrizing Constraint Programming and Ant metaheuristics to solve crew pairing are pointed out in this work. © 2008 IEEE.

Año de publicación:

2008

Keywords:

    Fuente:

    scopusscopus

    Tipo de documento:

    Conference Object

    Estado:

    Acceso restringido

    Áreas de conocimiento:

    • Optimización matemática
    • Optimización matemática
    • Optimización matemática

    Áreas temáticas:

    • Ciencias de la computación

    Contribuidores:

    Nibaldo RodríguezNibaldo Rodríguez
    Crawford B.Crawford B.
    Castro C.Castro C.
    Monfroy E.Monfroy E.