《数学建模》美赛优秀论文:2007 B O Z Boarding-Step by Step

Abstracts 247 Boarding-Step by Step: A Cellular Automaton Approach to Optimising Aircraft Boarding Time Chris rohwer Andreas Haver Louise viljoen University of Stellenbosch Stellenbosch, South africa Advisor: Jan H. van Vuuren Summary We model the boarding time for the aircraft using a cellular automaton. We investigate possible solutions and present recommendations about effective implementati The cellular automaton model is implemented in three stages Initialisation of the seating layout for a chosen aircraft type and assignment The sorting of passengers varIous propose Propagating" the passengers through the aisle(s)of the aircraft and seating them at their assigned places The rules governing the automaton take into account various factors. Among these are the load factor(percentage filled )of the craft, different walking speeds of passengers walking through the aisle, and time delays from stowing luggage nd obstructions by other passengers during the seating process. The algorithm accommodates predefined aircraft layouts of common aircraft and also user defined aircraft layouts We modeled and tested various boarding strategies for efficiency with re- gard to total boarding time and average boarding time per passenger. Thus, our approach focuses not only on optimisation of the process in favour of the airlines, but also yields information regarding convenience to passengers. Ran- dom boarding(where passengers with assigned seat numbers enter the plane in a random sequence)was used as a point of reference. Among other strategies tested were boarding the plane in groups from either end, boarding from seats farthest from the aisles toward the aisles, and combinations of these approaches
Abstracts 247 Boarding-Step by Step: A Cellular Automaton Approach to Optimising Aircraft Boarding Time Chris Rohwer Andreas Hafver Louise Viljoen University of Stellenbosch Stellenbosch, South Africa Advisor: Jan H. van Vuuren Summary We model the boarding time for the aircraft using a cellular automaton. We investigate possible solutions and present recommendations about effective implementation. The cellular automaton model is implemented in three stages: "* Initialisation of the seating layout for a chosen aircraft type and assignment of seats to passengers "* The sorting of passengers according to various proposed boarding methods "* "Propagating" the passengers through the aisle(s) of the aircraft and seating them at their assigned places. The rules governing the automaton take into account various factors. Among these are the load factor (percentage filled) of the craft, different walking speeds of passengers walking through the aisle, and time delays from stowing luggage and obstructions by other passengers during the seating process. The algorithm accommodates predefined aircraft layouts of common aircraft and also userdefined aircraft layouts. We modeled and tested various boarding strategies for efficiency with regard to total boarding time and average boarding time per passenger. Thus, our approach focuses not only on optimisation of the process in favour of the airlines, but also yields information regarding convenience to passengers. Random boarding (where passengers with assigned seat numbers enter the plane in a random sequence) was used as a point of reference. Among other strategies tested were boarding the plane in groups from either end, boarding from seats farthest from the aisles toward the aisles, and combinations of these approaches

248 The UMAP Journal 28.3 (2007) We conclude that boarding strategies starting farthest away from the en- trance or farthest away from the aisles yield shorter boarding times than ran- dom boarding. The most successful methods are combinations of these strate. gies, their detailed implementation depending on the exact layout/size of the aircraft. The method yielding the shortest total boarding time is not neces- sarily the one with shortest average boarding time per passenger. By consid ering standard deviations of total and individual boarding times over many iterations of the simulation, we can derive conclusions regarding the stabil- ity /consistency of the specific boarding strategies and how evenly the waiting time is distributed amongst the passengers. By selecting appropriate strategies, time savings of 2-3 min for st medium aircraft could be achieved. for a custom 800-seat aircraft aisles, more than 6 min could be saved compared to random boarding the pared our results to actual turnaround times quoted by airlines, we believe m to be realistic. The text of this paper appears on pp. 463-478
248 The UMAP Journal 28.3 (2007) We conclude that boarding strategies starting farthest away from the entrance or farthest away from the aisles yield shorter boarding times than random boarding. The most successful methods are combinations of these strategies, their detailed implementation depending on the exact layout/ size of the aircraft. The method yielding the shortest total boarding time is not necessarily the one with shortest average boarding time per passenger. By considering standard deviations of total and individual boarding times over many iterations of the simulation, we can derive conclusions regarding the stability! consistency of the specific boarding strategies and how evenly the waiting time is distributed amongst the passengers. By selecting appropriate strategies, time savings of 2-3 min for small and medium aircraft could be achieved. For a custom 800-seat aircraft with two aisles, more than 6 min could be saved compared to random boarding. Having compared our results to actual turnaround times quoted by airlines, we believe them to be realistic. The text of this paper appears on pp. 463-478

Wilson ep COPYRIGHT INFORMATION TITLE: Boarding-Step by Step: A Cellular Automaton Approach to Optimising Aircraft Boarding Time SOURCE: UMAP J 28 no 3 Fall 2007 The magazine publisher is the copyright holder of this article and it is reproduced with permission. Further reproduction of this article in violation of the copyright is prohibited. To contact the publisher Www.comap.com
COPYRIGHT INFORMATION TITLE: Boarding—Step by Step: A Cellular Automaton Approach to Optimising Aircraft Boarding Time SOURCE: UMAP J 28 no3 Fall 2007 The magazine publisher is the copyright holder of this article and it is reproduced with permission. Further reproduction of this article in violation of the copyright is prohibited. To contact the publisher: www.comap.com
按次数下载不扣除下载券;
注册用户24小时内重复下载只扣除一次;
顺序:VIP每日次数-->可用次数-->下载券;
- 《数学建模》美赛优秀论文:2007 B O Novel Approaches to Airplane Boarding.pdf
- 《数学建模》美赛优秀论文:2007 B O Boarding at the Speed of Flight.pdf
- 《数学建模》美赛优秀论文:2007 B O American Airlines Next Top Model.pdf
- 《数学建模》美赛优秀论文:2007 A O What to Feed a Gerrymander.pdf
- 《数学建模》美赛优秀论文:2007 A O P Electoral Redistricting with Moment of Inertia.pdf
- 《数学建模》美赛优秀论文:2007 A O Applying Voronoi Diagrams to the Redistricting Problem.pdf
- 《数学建模》美赛优秀论文:2007 A O A Cluster-Theoretic Approach to Political Districting.pdf
- 《数学建模》美赛优秀论文:2007 A H Genetic Algorithm for Non-Partisan Legislative Districting.pdf
- 《数学建模》美赛优秀论文:03a 点评s Commentary The Outstanding Stunt Person Papers.pdf
- 《数学建模》美赛优秀论文:03A You Too Can Be James Bond.pdf
- 《数学建模》美赛优秀论文:03A Thinking Outside the Box.pdf
- 《数学建模》美赛优秀论文:03A Safe Landings.pdf
- 《数学建模》美赛优秀论文:03A Cardboard Comfortable When It Comes to Crashing.pdf
- 《数学建模》美赛优秀论文:03 A O Fly With Confidence.pdf
- 《数学建模》美赛优秀论文:03 A O A Time-Independent Model of Box Safety for Stunt Motorcyclists.pdf
- 《数学建模》美赛优秀论文:02B(点评)Author Judge’s Commentary The Outstanding Airline Overbooking Papers.pdf
- 《数学建模》美赛优秀论文:02B Things That Go Bump in the Flight.pdf
- 《数学建模》美赛优秀论文:02B Probabilistically Optimized Airline Overbooking Strategies, or “Anyone Willing to Take a Later Flight!”.pdf
- 《数学建模》美赛优秀论文:02B Optimal Overbooking.pdf
- 《数学建模》美赛优秀论文:02B Models for Evaluating Overbooking.pdf
- 《数学建模》美赛优秀论文:2007 C O Analysis of Kidney Transplant System Using Markov Process Models.pdf
- 《数学建模》美赛优秀论文:2007 C O Optimizing the Effectiveness of Organ Allocation.pdf
- 《数学建模》美赛优秀论文:2008 C An Analysis of Healthcare Systems.pdf
- 《数学建模》美赛优秀论文:2008 C Evaluation and Improvement of Healthcare Systems.pdf
- 《数学建模》美赛优秀论文:2008 C The Most Expensive is Not the Best.pdf
- 《数学建模》美赛优秀论文:a convenient truth a model for sea level rise fore.pdf
- 《数学建模》美赛优秀论文:A Difficulty Metric and Puzzle Generator for Sudoku.pdf
- 《数学建模》美赛优秀论文:Commentary The Outstanding Healthcare Papers.pdf
- 《数学建模》美赛优秀论文:ease and toil analyzing sudoku[1].pdf.pdf
- 《数学建模》美赛优秀论文:s New Calling.pdf
- 《数学建模》美赛优秀论文:2009 C O Rebalancing Human-Influenced Ecosystems.pdf
- 《数学建模》美赛优秀论文:2009 C O Why Reintroducing More Species to Fish Farm.pdf
- 《数学建模》美赛优秀论文:2009 C P Authors’ Commentary The Outstanding Coral Reef Papers.pdf
- 《数学建模》美赛优秀论文:2009 C P Judges’ Commentary The Outstanding Coral Reef Papers.pdf
- 哈尔滨工程大学:《数学建模》常见算法_数学计算(数学建模方法分析概述).ppt
- 《数学建模》常见算法:数学建模竞赛中应当掌握的十类算法.doc
- 《数学建模》算法全收录(算法大全):参考文献.pdf
- 《数学建模》算法全收录(算法大全):第01章 线性规划.pdf
- 《数学建模》算法全收录(算法大全):第02章 整数规划.pdf
- 《数学建模》算法全收录(算法大全):第03章 非线性规划.pdf