A hybrid meta-heuristic algorithm for optimization of crew scheduling

被引:68
作者
Azadeh, A. [1 ]
Farahani, M. Hosseinabadi [1 ]
Eivazy, H. [2 ]
Nazari-Shirkouhi, S. [1 ]
Asadipour, G. [1 ]
机构
[1] Univ Tehran, Dept Ind Engn, Ctr Excellence Intelligent Based Expt Mech, Dept Engn Optimizat Res,Coll Engn, Tehran 14174, Iran
[2] Univ Alberta, Dept Civil Engn, Edmonton, AB T6G 2M7, Canada
关键词
Crew scheduling; Combinatorial optimization; Particle swarm optimization; Ant colony optimization; Genetic algorithm; Meta-heuristics; PARTICLE SWARM OPTIMIZATION; NETWORK MODEL; GENERATION;
D O I
10.1016/j.asoc.2012.08.012
中图分类号
TP18 [人工智能理论];
学科分类号
140502 [人工智能];
摘要
Crew scheduling problem is the problem of assigning crew members to the flights so that total cost is minimized while regulatory and legal restrictions are satisfied. The crew scheduling is an NP-hard constrained combinatorial optimization problem and hence, it cannot be exactly solved in a reasonable computational time. This paper presents a particle swarm optimization (PSO) algorithm synchronized with a local search heuristic for solving the crew scheduling problem. Recent studies use genetic algorithm (GA) or ant colony optimization (ACO) to solve large scale crew scheduling problems. Furthermore, two other hybrid algorithms based on GA and ACO algorithms have been developed to solve the problem. Computational results show the effectiveness and superiority of the proposed hybrid PSO algorithm over other algorithms. (C) 2012 Elsevier B. V. All rights reserved.
引用
收藏
页码:158 / 164
页数:7
相关论文
共 36 条
[1]
A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery [J].
Ai, The Jin ;
Kachitvichyanukul, Voratas .
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (05) :1693-1702
[2]
RECENT ADVANCES IN CREW-PAIRING OPTIMIZATION AT AMERICAN-AIRLINES [J].
ANBIL, R ;
GELMAN, E ;
PATTY, B ;
TANGA, R .
INTERFACES, 1991, 21 (01) :62-74
[3]
Andersson E., 1998, INT SERIES OPERATION, P228
[4]
A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times [J].
Anghinolfi, Davide ;
Paolucci, Massimo .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 193 (01) :73-85
[5]
A NETWORK MODEL FOR THE ROTATING WORKFORCE SCHEDULING PROBLEM [J].
BALAKRISHNAN, N ;
WONG, RT .
NETWORKS, 1990, 20 (01) :25-42
[6]
A MATCHING BASED HEURISTIC FOR SCHEDULING MASS TRANSIT CREWS AND VEHICLES [J].
BALL, M ;
BODIN, L ;
DIAL, R .
TRANSPORTATION SCIENCE, 1983, 17 (01) :4-31
[7]
An approximate model and solution approach for the long-haul crew pairing problem [J].
Barnhart, C ;
Shenoi, RG .
TRANSPORTATION SCIENCE, 1998, 32 (03) :221-231
[8]
A dynamic programming based algorithm for the crew scheduling problem [J].
Beasley, JE ;
Cao, B .
COMPUTERS & OPERATIONS RESEARCH, 1998, 25 (7-8) :567-582
[9]
BODIN L, 1983, COMPUT OPER RES, V10, P63, DOI 10.1016/0305-0548(83)90030-8
[10]
Solving large scale crew scheduling problems [J].
Chu, HD ;
Gelman, E ;
Johnson, EL .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 97 (02) :260-268