An ACO model for a non-stationary formulation of the single elevator problem

• Autores: Silvia Molina, Mario Guillermo Leguizamón, Enrique Alba Torres
• Localización: Journal of Computer Science and Technology, ISSN-e 1666-6038, Vol. 7, Nº. 1, 2007 (Ejemplar dedicado a: Nineteenth Issue), págs. 45-51
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • The Ant Colony Optimization (ACO) metaheuristic is a bio-inspired approach for hard combinatorial optimization problems for stationary and non-stationary environments. In the ACO metaheuristic, a colony of artificial ants cooperate for finding high quality solutions in a reasonable time. An interesting example of a non-stationary combinatorial optimization problem is the Multiple Elevators Problem (MEP) which consists in finding a sequence of movements for each elevator to perform in a building so that to minimize, for instance, the users waiting average time. Events like the arrival of one new user to the elevator queue or the fault of one elevator dynamically produce changes of state in this problem. A subclass of MEP is the the so called Single Elevator Problem (SEP). In this work, we propose the design of an ACO model for the SEP that can be implemented as an Ant Colony System (ACS). Keywords: Ant Colony Optimization, Single Elevator Problem, Non-stationary Problems, Ant Colony System design.