Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Partially feasible solution space for integrated SATS operations

Partially feasible solution space for integrated SATS operations The purpose of this paper is to investigate the feasibility of solving an integrated flight scheduling, fleet assignment and crew pairing problem for an on-demand service using a small, up to 19-seater, aircraft.Design/methodology/approachEvolutionary algorithm is developed to solve the problem. Algorithm design assumes indirect solution representation that allows to evaluate partially feasible solutions only and speed up calculations. Tested algorithm implementation takes advantage of the graphic processing unit.FindingsPerformed tests confirm that the algorithm can successfully solve the defined integrated scheduling problem.Practical implicationsThe presented algorithm allows to optimise on-demand transport service operation within minutes.Social implicationsOptimisation of operation cost contributes to better accessibility of transport.Originality/valueThe presented integrated formulation allows to avoid sub optimal solutions that are results of solving sequential sub problems. Indirect representation and evaluation strategy can be applied to speed up calculations in other problems as well. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Aircraft Engineering and Aerospace Technology Emerald Publishing

Partially feasible solution space for integrated SATS operations

Loading next page...
 
/lp/emerald-publishing/partially-feasible-solution-space-for-integrated-sats-operations-gdXWRtVAPE
Publisher
Emerald Publishing
Copyright
© Emerald Publishing Limited
ISSN
1748-8842
DOI
10.1108/aeat-01-2018-0045
Publisher site
See Article on Publisher Site

Abstract

The purpose of this paper is to investigate the feasibility of solving an integrated flight scheduling, fleet assignment and crew pairing problem for an on-demand service using a small, up to 19-seater, aircraft.Design/methodology/approachEvolutionary algorithm is developed to solve the problem. Algorithm design assumes indirect solution representation that allows to evaluate partially feasible solutions only and speed up calculations. Tested algorithm implementation takes advantage of the graphic processing unit.FindingsPerformed tests confirm that the algorithm can successfully solve the defined integrated scheduling problem.Practical implicationsThe presented algorithm allows to optimise on-demand transport service operation within minutes.Social implicationsOptimisation of operation cost contributes to better accessibility of transport.Originality/valueThe presented integrated formulation allows to avoid sub optimal solutions that are results of solving sequential sub problems. Indirect representation and evaluation strategy can be applied to speed up calculations in other problems as well.

Journal

Aircraft Engineering and Aerospace TechnologyEmerald Publishing

Published: Mar 13, 2019

Keywords: Crew pairing; Evolutionary algorithm; Fleet assignment; Flight scheduling; Integrated solution; Small aircraft transport system (SATS)

References