Application of a hybrid genetic algorithm to airline crew scheduling

DOI10.1016/0305-0548(95)00060-7zbMath0847.90097OpenAlexW1984345688MaRDI QIDQ1915974

Yanyan Li

Publication date: 26 September 1996

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(95)00060-7

zbMATH Keywords

branch-and-boundairline crew schedulingbranch-and-cuthybrid genetic algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Related Items

A model and computational tool for crew scheduling in train transportation of mine materials by using a local search strategy ⋮ A portable and scalable algorithm for a class of constrained combinatorial optimization problems ⋮ Elitist genetic algorithm for assignment problem with imprecise goal ⋮ A random-key genetic algorithm for the generalized traveling salesman problem ⋮ Solving a large-scale integrated fleet assignment and crew pairing problem ⋮ Solving a multi-objective interval crew-scheduling problem via genetic algorithms ⋮ A dynamic programming based algorithm for the crew scheduling problem. ⋮ A mathematical model for blood flow in magnetic field ⋮ Two-level decomposition-based matheuristic for airline crew rostering problems with fair working time ⋮ A distributed genetic algorithm for deterministic and stochastic labor scheduling problems ⋮ Ship maintenance scheduling by genetic algorithm and constraint-based reasoning ⋮ An investigation of mating and population maintenance strategies in hybrid genetic heuristics for product line designs ⋮ A multiagent society for military transportation scheduling ⋮ A set covering approach for multi-depot train driver scheduling

Cites Work

• A genetic algorithm for the set covering problem
• Crew pairing at Air France
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• Solving Airline Crew Scheduling Problems by Branch-and-Cut
• Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5
• A global approach to crew-pairing optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item