Method of Inequality-Based Multiobjective Genetic Algorithm for Domestic Daily Aircraft Routing

Authors:
Ta-Yuan Chou;Tung-Kuan Liu;Chung-Nan Lee;Chi-Ruey Jeng
Affiliations:
Nat. Sun Yat-Sen Univ., Kaohsiung;-;-;-
Venue:
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Year:
2008

Citing 0
Cited 4

Conservation of information in search: measuring the cost of success

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Optimization of short-haul aircraft schedule recovery problems using a hybrid multiobjective genetic algorithm

Expert Systems with Applications: An International Journal
Solving the flight frequency programming problem with particle swarm optimization

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Greedy-search-based multi-objective genetic algorithm for emergency logistics scheduling

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This study proposes a method of inequality-based multiobjective genetic algorithm (MMGA) to solve the aircraft routing problem. The proposed algorithm includes the following features: 1) a method of inequality to confine a genetic algorithm to search a Pareto optimal set in regions of interest with little computing effort; 2) an improved rank-based fitness assignment method to significantly increase the speed of fitness evaluation; and 3) a repairing strategy to relax the infeasible flight schedules to help reduce violations of solutions. The MMGA is successfully applied to solve the aircraft routing problems in a local airline company.