|
Descripción
|
|
|---|---|
| The Fleet Assignment Problem (FAP), which transportation companies have to deal with, consists in deciding the ¿eet size and assigning a type of vehicle to a set of scheduled trips in order to minimize the total operational costs. In this paper, we ropose a new model for the FAP, referred to as the new ¿exible model for the ¿eet assignment problem. We have developed Ant Colony Optimization (ACO) method and have analyzed its performance and compared it with Branch&Bound in a wide range of instances. | |
|
Internacional
|
Si |
|
Nombre congreso
|
18th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA 2011). In conjunction with IJCAI 2011 |
|
Tipo de participación
|
960 |
|
Lugar del congreso
|
Barcelona |
|
Revisores
|
Si |
|
ISBN o ISSN
|
- |
|
DOI
|
|
|
Fecha inicio congreso
|
17/07/2011 |
|
Fecha fin congreso
|
18/07/2011 |
|
Desde la página
|
142 |
|
Hasta la página
|
147 |
|
Título de las actas
|
Proceedings of the 18th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA 2011). |