Scholarlink

<p>For the aircraft routing and crew pairing problems, a sequential approach is usually used to solve they. When solving the crew pairing problem, the impact of aircraft routing problem is often neglected so that these two problems are independent. This approach reduces the complexity of the solution process, but it may obtain a suboptimal solution. In this paper, we consider an integrated aircraft routing and crew pairing problem. We propose an integrated model that integrates the aircraft routing and crew pairing problems. We propose a solution algorithm based on a heuristic alternating Lagrangian decomposition to address coupling constraint of the integrated model. The solution algorithm iterates between the first Lagrangian subproblem about aircraft routing and the second Lagrangian subproblem about crew pairing. These two Lagrangian subproblems are solved by a branch-and-price algorithm. In the branch-and-price algorithm, we present a heuristic branching strategy. The computational experiments are conducted on several real-world data sets.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Integrated airline aircraft routing and crew pairing by alternating Lagrangian decomposition

  • 期刊论文

  • 发表日期：

    2025年5月29日

查看全文
  • Cong Li,
  • Suixiang Gao,
  • Wenguo Yang,
  • Zhipeng Jiang

摘要

For the aircraft routing and crew pairing problems, a sequential approach is usually used to solve they. When solving the crew pairing problem, the impact of aircraft routing problem is often neglected so that these two problems are independent. This approach reduces the complexity of the solution process, but it may obtain a suboptimal solution. In this paper, we consider an integrated aircraft routing and crew pairing problem. We propose an integrated model that integrates the aircraft routing and crew pairing problems. We propose a solution algorithm based on a heuristic alternating Lagrangian decomposition to address coupling constraint of the integrated model. The solution algorithm iterates between the first Lagrangian subproblem about aircraft routing and the second Lagrangian subproblem about crew pairing. These two Lagrangian subproblems are solved by a branch-and-price algorithm. In the branch-and-price algorithm, we present a heuristic branching strategy. The computational experiments are conducted on several real-world data sets.