Welcome to Journal of University of Chinese Academy of Sciences,Today is

Journal of University of Chinese Academy of Sciences

Previous Articles     Next Articles

An improved multi-objective evolutionary algorithm for the multi-objective airline crew pairing problem*

LI Cong, JIANG Zhipeng, YANG Wenguo   

  1. School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing, 100049, China
  • Received:2024-01-24 Revised:2024-06-12 Online:2024-06-24
  • Contact: E-mail: jiangzhipeng@ucas.ac.cn
  • Supported by:
    *Supported by National Natural Science Foundation of China (12071459)

Abstract: The multi-objective airline crew pairing problem finds a subset of feasible pairings so that all flights are covered and each objective function is minimum. For the problem, we propose two mathematical models: a novel mathematical model that contains logical relationships and an integer programming model that is based on all feasible pairings enumerated by a depth-first search method. To solve the problem, we propose an improved multi-objective evolutionary algorithm, where this algorithm is a nondominated sorting genetic algorithm with the distance between the objective vector corresponding to each solution and an adaptive evaluation vector. The proposed algorithm uses the direction of the adaptive evaluation vector and the Pareto orientation for guidance to derive Pareto-optimal solutions. We also uses a repairing strategy and a local optimization strategy for deriving feasible and better solutions. For this problem, in our experimental results, the performance of the proposed algorithm is superior to that of the conventional nondominated sorting genetic algorithm II and another multi-objective genetic algorithm, respectively.

Key words: Airline Crew Pairing, Multi-objective Optimization, Pareto-optimal Solutions

CLC Number: