A variable neighborhood search approach for the crew pairing problem-Reference-Cited by-同舟云学术

A variable neighborhood search approach for the crew pairing problem

Published:2017-04 Issue: Volume:58 Page:87-94
ISSN:1571-0653
Container-title:Electronic Notes in Discrete Mathematics
language:en
Short-container-title:Electronic Notes in Discrete Mathematics

Author:

Agustin Alba,Juan Angel,Pardo Eduardo G.

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference7 articles.

1. Optimizing airline crew scheduling using biased randomization: A case study;Agustin;Lecture Notes in Computer Science/LNAI,2016

2. A multi-start randomized heuristic for real-life crew rostering problems in airlines with work-balancing goals;De Armas;Annals of Operations Research,2016

3. Multi-objective variable neighborhood search: an application to combinatorial optimization problems;Duarte;Journal of Global Optimization,2014

4. Parallel variable neighbourhood search strategies for the cutwidth minimization problem;Duarte;IM Journal of Management Mathematics,2016

5. Crew management information systems;Klabjan,2012

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An adaptive greedy heuristic for large scale airline crew pairing problems;Journal of Air Transport Management;2024-01

2. A flexible mathematical model for crew pairing optimization to generate n-day pairings considering the risk of COVID-19: a real case study;Kybernetes;2021-09-06

3. A review on optimization methods for workforce planning in electrical distribution utilities;Computers & Industrial Engineering;2019-09

4. A survey of the literature on airline crew scheduling;Engineering Applications of Artificial Intelligence;2018-09