Access the full text.
Sign up today, get DeepDyve free for 14 days.
J. Provan, M. Ball (1983)
The Complexity of Counting Cuts and of Computing the Probability that a Graph is ConnectedSIAM J. Comput., 12
A. Ceder, H. Stern (1981)
DEFICIT FUNCTION BUS SCHEDULING WITH DEADHEADING TRIP INSERTIONS FOR FLEET SIZE REDUCTIONTransportation Science, 15
L. Valiant (1979)
The Complexity of Enumeration and Reliability ProblemsSIAM J. Comput., 8
D. Knuth (1974)
Estimating the efficiency of backtrack programs.Mathematics of Computation, 29
Radislav Vaisman, Dirk Kroese (2017)
Stochastic Enumeration Method for Counting TreesMethodology and Computing in Applied Probability, 19
HI Stern, IB Gertsbakh (2019)
Using deficit functions for aircraft fleet routingOper Res Perspect, 6
M. Dyer, L. Goldberg, Catherine Greenhill, M. Jerrum (2000)
On the relative complexity of approximate counting problems
Lavanya Marla, Vikrant Vaze, C. Barnhart (2018)
Robust optimization: Lessons learned from aircraft routingComput. Oper. Res., 98
Shan Lan, J. Clarke, C. Barnhart (2006)
Planning for Robust Airline Operations: Optimizing Aircraft Routings and Flight Departure Times to Minimize Passenger DisruptionsTransp. Sci., 40
A. Broder (1986)
How hard is it to marry at random? (On the approximation of the permanent)
G. Stojković, F. Soumis, J. Desrosiers, M. Solomon (2002)
AN OPTIMIZATION MODEL FOR A REAL-TIME FLIGHT SCHEDULING PROBLEMTransportation Research Part A-policy and Practice, 36
RP Dilworth (1950)
A decomposition theorem for partially ordered setsAnnal Math, 51
VV Vazirani (2003)
10.1007/978-3-662-04565-7Approximation algorithms
D. Fulkerson (1956)
Note on Dilworth’s decomposition theorem for partially ordered sets, 7
Mohit Singh, Kunal Talwar (1997)
Approximation AlgorithmsProceedings of the National Academy of Sciences of the United States of America, 94 24
Author Dilworth, BY Dilworth (1950)
A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETSAnnals of Mathematics, 51
Juan Cortes, Yoshinori Suzuki (2020)
Vehicle Routing with Shipment ConsolidationInternational Journal of Production Economics, 227
M. Ahmed, Farah Mansour, M. Haouari (2018)
Robust integrated maintenance aircraft routing and crew pairingJournal of Air Transport Management
R. Rubinstein, Ad Ridder, Radislav Vaisman (2013)
Fast Sequential Monte Carlo Methods for Counting and Optimization
S. Asmussen, P. Glynn (2007)
Stochastic Simulation: Algorithms and Analysis
E. Nasibov, U. Eliiyi, M. Ertaç, Ümit Kuvvetli (2013)
Deadhead Trip Minimization in City Bus Transportation: A Real Life ApplicationPromet-traffic & Transportation, 25
M. Dyer, L. Goldberg, Catherine Greenhill, M. Jerrum (2000)
The Relative Complexity of Approximate Counting ProblemsAlgorithmica, 38
JE Hopcroft, RM Karp (1973)
An n5/2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n^{5/2}$$\end{document} algorithm for maximum matchings in bipartite graphsSIAM J Comput., 2
F. Arnold, M. Gendreau, K. Sörensen (2019)
Efficiently solving very large-scale routing problemsComput. Oper. Res., 107
U. Bertelè, F. Brioschi (1969)
Contribution to nonserial dynamic programmingJournal of Mathematical Analysis and Applications, 28
Lei Zhou, Zhe Liang, C. Chou, W. Chaovalitwongse (2020)
Airline planning and scheduling: Models and solution methodologiesFrontiers of Engineering Management, 7
D. Simovici, C. Djeraba (2014)
Mathematical Tools for Data Mining
Radu Curticapean, Holger Dell, F. Fomin, L. Goldberg, John Lapinskas (2017)
A Fixed-Parameter Perspective on #BISAlgorithmica, 81
Radislav Vaisman, Dirk Kroese, I. Gertsbakh (2016)
Improved Sampling Plans for Combinatorial Invariants of Coherent SystemsIEEE Transactions on Reliability, 65
D. Simovici, C. Djeraba (2008)
Mathematical Tools for Data Mining: Set Theory, Partial Orders, CombinatoricsMathematical Tools for Data Mining
Oded Goldreich (2008)
Computational complexity: a conceptual perspectiveACM SIGSOFT Software Engineering Notes, 35
A. Sinclair (1988)
Randomised algorithms for counting and generating combinatorial structures
Tao Liu, A. Ceder (2017)
Deficit function related to public transport: 50 year retrospective, new developments, and prospectsTransportation Research Part B-methodological, 100
J. Hopcroft, R. Karp (1971)
A n^5/2 Algorithm for Maximum Matchings in Bipartite GraphsSIAM J. Comput., 2
We consider the task of constructing a cost-effective daily flight schedule with a minimum number of required aircrafts and a maximum number of balanced flight routes, namely, routes with the same start and end spatial location. We suggest a solution strategy which is able to determine the problem’s hardness by estimating the number of all flight plans with a minimum number of required aircrafts. Provided that this number is not too large, the same algorithm is utilized for fully enumerating and detecting the set of solutions that have the maximum number of balanced routes. Our experimental study implies that the method is both effective and scalable in practice. For example, when applied to the Australian domestic flights timetable which is serviced by a total of eighty-eight aircrafts, our method manages to increase the number of balanced flight routes from nine to forty-two, while using only several minutes of computational time.
Public Transport – Springer Journals
Published: Mar 1, 2023
Keywords: Optimal flight scheduling; deadheading flights; approximate counting; optimization; heuristic
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.