A variable neighborhood search approach for the crew pairing problem

DOI10.1016/J.ENDM.2017.03.012zbMath1384.90038OpenAlexW2606798920MaRDI QIDQ1687651

Alba Agustin, Eduardo G. Pardo, Angel A. Juan

Publication date: 4 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.03.012

zbMATH Keywords

heuristicsflight schedulingcrew pairinggeneral variable neighborhood search

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Variable neighborhood search
• Parallel variable neighbourhood search strategies for the cutwidth minimization problem

This page was built for publication: A variable neighborhood search approach for the crew pairing problem