Observatorio de I+D+i UPM

Memorias de investigación
Communications at congresses:
ACO algorithms for solving a new Fleet Assignment Problem
Year:2011
Research Areas
  • Operative research,
  • Engineering,
  • Economy
Information
Abstract
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.
International
Si
Congress
18th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA 2011). In conjunction with IJCAI 2011
960
Place
Barcelona
Reviewers
Si
ISBN/ISSN
-
Start Date
17/07/2011
End Date
18/07/2011
From page
142
To page
147
Proceedings of the 18th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA 2011).
Participants
  • Autor: Francisco Javier Diego Martin (UPM)
  • Autor: Ignacio Rubio Sanz
  • Autor: Miguel Angel Ortega Mier (UPM)
  • Autor: Alvaro Garcia Sanchez (UPM)
Research Group, Departaments and Institutes related
  • Creador: Grupo de Investigación: Ingeniería de Organización y Logística
S2i 2020 Observatorio de investigación @ UPM con la colaboración del Consejo Social UPM
Cofinanciación del MINECO en el marco del Programa INNCIDE 2011 (OTR-2011-0236)
Cofinanciación del MINECO en el marco del Programa INNPACTO (IPT-020000-2010-22)