In *Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*, volume 4528 LNCS, pages 317-327, 2007.

abstract bibtex

abstract bibtex

This paper is about Set Partitioning formulation and resolution for a particular case of VRP, the Dial-a-ride Problem. Set Partitioning has demonstrated to be useful modeling this problem and others very visible and economically significant problems. But the main disadvantage of this model is the need to explicitly generate a large set of possibilities to obtain good solutions. Additionally, in many cases a prohibitive time is needed to find the exact solution. Nowadays, many efficient metaheuristic methods have been developed to make possible a good solution in a reasonable amount of time. In this work we try to solve it with Low-level Hybridizations of Ant Colony Optimization and Constraint Programming techniques helping the construction phase of the ants. Computational results solving some benchmark instances are presented showing the advantages of using this kind of hybridization. © Springer-Verlag Berlin Heidelberg 2007.

@inproceedings{38149069028, abstract = "This paper is about Set Partitioning formulation and resolution for a particular case of VRP, the Dial-a-ride Problem. Set Partitioning has demonstrated to be useful modeling this problem and others very visible and economically significant problems. But the main disadvantage of this model is the need to explicitly generate a large set of possibilities to obtain good solutions. Additionally, in many cases a prohibitive time is needed to find the exact solution. Nowadays, many efficient metaheuristic methods have been developed to make possible a good solution in a reasonable amount of time. In this work we try to solve it with Low-level Hybridizations of Ant Colony Optimization and Constraint Programming techniques helping the construction phase of the ants. Computational results solving some benchmark instances are presented showing the advantages of using this kind of hybridization. © Springer-Verlag Berlin Heidelberg 2007.", number = "PART 2", year = "2007", title = "Solving dial-a-ride problems with a low-level hybridization of ants and constraint programming", volume = "4528 LNCS", pages = "317-327", booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)" }

Downloads: 0