Access the full text.
Sign up today, get DeepDyve free for 14 days.
S. Fang, J. Tsao (1995)
Linearly-Constrained Entropy Maximization Problem with Quadratic Cost and Its Applications to Transportation Planning ProblemsTransp. Sci., 29
J. Tsao, W. Wei, A. Pratama (2009)
Integrated Taxiing and Take-Off Scheduling for Optimization of Airport Surface Operations
A. Odoni, J. Bowman, D. Delahaye, J. Deyst, E. Feron, R. Hansman, Kashif Khan, J. Kuchar, Nicolas Pujet, R. Simpson (1997)
Existing and Required Modeling Capabilities for Evaluating ATM Systems and Concepts
E. Jaynes (1957)
Information Theory and Statistical MechanicsPhysical Review, 106
S. Fang, H. Tsao (1994)
A quadratically convergent global algorithm for the linearly-constrained minimum cross-entropy problemEuropean Journal of Operational Research, 79
H. Baik, A. Trani (2008)
Framework of a Time-Based Simulation Model for the Analysis of Airfield OperationsJournal of Transportation Engineering-asce, 134
J. Kapur (1992)
Maximum-entropy models in science and engineering
T. Cover, Joy Thomas (1991)
Elements of Information Theory
Jin Shin, Sang Kim (2006)
A Mathematical Theory of Communication
G. Couluris, R. Fong, M.B. Downs, N. Mittler, D. Signor, A. Stassart, T. Hsiao (2008)
A new modeling capability for airport surface traffic analysis2008 IEEE/AIAA 27th Digital Avionics Systems Conference
B. Capozzi, J. DiFelici, Ray Jakobovits (2004)
Towards Automated Airport Surface Traffic Control: Potential Benefits and Feasibility
I. Anagnostakis, J. Clarke, D. Böhme, U. Völckers (2001)
Runway operations planning and control sequencing and schedulingProceedings of the 34th Annual Hawaii International Conference on System Sciences
Robert Malouf (2010)
Maximum Entropy Models
H. Tsao, S. Fang, D. Lee (1993)
A Bayesian Interpretation of the Linearly-Constrained Cross-Entropy Minimization ProblemEngineering Optimization, 22
S. Fang, J. Tsao (1993)
Linear programming with entropic perturbationZeitschrift für Operations Research, 37
S. Fang, J. Tsao (2009)
Entropy Optimization: Shannon Measure of Entropy and its Properties
H. Tsao, Wenbin Wei (2009)
Optimization Architecture for Airport Surface Operations
S. Fang (1996)
LINEAR PROGRAMMING WITH INEQUALITY CONSTRAINTS VIA ENTROPIC PERTURBATIONInternational Journal of Mathematics and Mathematical Sciences, 19
篠原 正明 (1998)
Shu-Cherng Fang, J.R. Rajasekera and H.S.J. Tsao著, Entropy Optimization and Mathematical Programming, Kluwer Academic Publishers, 343頁, 1997年, 43
S. Fang, Jay Rajasekera, H. Tsao (1997)
Entropy Optimization and Mathematical Programming
J. Tsao, S. Fang (1995)
An unconstrained dual approach to solving Karmarkar-type linear programs using conventional barrier functionsZeitschrift für Operations Research, 42
(1991)
Elements of Information Theory, Wiley-Inderscience, New York
S. Fang, J. Tsao (2001)
Principle of Maximum Entropy: Image Reconstruction, 3
(1957)
Information theory and statistical mechanics II
H. Baik, H. Sherali, A. Trani (2002)
Time-Dependent Network Assignment Strategy for Taxiway Routing at AirportsTransportation Research Record, 1788
E. Jaynes (1988)
The Relation of Bayesian and Maximum Entropy Methods
H. Idris, R. Hansman (2000)
Observation and Analysis of Departure Operations at Boston Logan International Airport
(2008)
An optimization architecture for airport surface operations’, available at http://www.engr.sjsu.edu/jtsao/papers/Airport-Operations-OptimizationArchitecture.pdf (accessed on
We propose a new application of information entropy and motivate this application with the problem of routing aircraft between their gates and assigned runways for optimising airport surface operations. In this context, the more clustered (i.e., the less scattered) the scheduled uses of taxiway links, the higher temporal resource contention, which in turn results in higher congestion probability and larger amounts of delays, wasted fuel and emissions. A measure of ‘scatteredness’ is needed. The connection between such a measure and entropy lies in the fact that the arrival times of the n aircraft that reach a given taxiway link within a given time interval partition the interval into n + 1 subintervals. The n + 1 corresponding subinterval-length proportions constitute a probability distribution, and the entropy of this distribution can be used to measure the scatteredness of the use pattern. Our numerical experience demonstrates the significant advantage of entropy maximisation in aircraft taxiway routing.
International Journal of Information and Decision Sciences – Inderscience Publishers
Published: Jan 1, 2011
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.