Access the full text.
Sign up today, get DeepDyve free for 14 days.
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.
Aircraft Engineering and Aerospace Technology – Emerald Publishing
Published: Mar 13, 2019
Keywords: Crew pairing; Evolutionary algorithm; Fleet assignment; Flight scheduling; Integrated solution; Small aircraft transport system (SATS)
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.