A unique hybrid particle swarm optimisation algorithm for simulation and improvement of crew scheduling problem

Ali Azadeh, Ghazal Asadipour, Hesam Eivazy and Salman Nazari-Shirkouhi

International Journal of Operational Research, 2012, vol. 13, issue 4, 406-422

Abstract: The crew scheduling problem is a set covering or set partitioning problem. It schedules the crew members so that all flights are covered, while the cost is minimised. The crew scheduling is an non-deterministic polynomial-time hard constrained combinatorial optimisation problem, so it cannot be exactly solved in a reasonable computation time. This paper presents a particle swarm optimisation (PSO) algorithm for simulating and solving the crew scheduling problem. The proposed algorithm is extended from the discrete version of PSO. By applying PSO to the crew scheduling problem, the cost is improved when compared with other well-known algorithms. This is the first study that introduces PSO for simulation and optimisation of the crew scheduling problem.

Keywords: crew scheduling; PSO; particle swarm optimisation; evaluation; simulation; scheduling improvement; flight crews. (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.inderscience.com/link.php?id=46225 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:13:y:2012:i:4:p:406-422

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().