A new heuristic branching scheme for the crew pairing problem with base constraints.

Frédéric Quesnel,Guy Desaulniers,François Soumis

Computers & Operations Research（2017）

引用 37|浏览6

暂无评分

摘要

•We study the crew pairing problem with base constraints.•The new branching heuristic revises poor branching decisions without backtracking.•Four branch-and-price heuristics are compared.•The one with the new branching outperforms the others for constrained scenarios.

查看译文

关键词

Airline crew pairing,Column generation,Branching methods

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要