Optimal Scheduling and Simulation of Snow Removers for Airfield Pavement Based on Breadth-First Search

Article Preview

Abstract:

In this paper, the Breadth-First Search algorithm is adopted to optimize the scheduling of Snow Removers for Airfield Pavement in large airports, as a result, the efficiency of cleaning work can be improved and the delayed time of the airport open can be decreased. The designed function of the automatic formation of plaque, the Airport Road area of adjacency matrix method, weight matrix, completed the snow removal vehicle scheduling model. Finally, an example, show that the algorithm of the allocation of airport runway snow removal vehicles, the optimized performance, as the airport runway snow removal vehicles provide a new strategy for optimal operation.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

383-387

Citation:

Online since:

February 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Martin Saska, Martin Hess and Klaus Schilling: Efficient Airport Snow Shoveling by Applying AutonomousMulti-Vehicle Formations. 2008 IEEE International Conference on Robotics and Automation, May, 2008, pp.19-23.

DOI: 10.1109/robot.2008.4543443

Google Scholar

[2] Thomas H. Cormen , Charles E. Leiserson, Ronald L. Rivest, Clifford Stein: Introduction to Algorithms, Beijing, China Machine Press, (2006).

Google Scholar

[3] Martin Saska, Martin Hess and Klaus Schilling: Route Scheduling Approach for Airport Snow Shoveling using Formations of Autonomous Ploughs. 2008 10th Intl. Conf. on Control, Automation, Robotics and Vision, Dec. 2008, pp.390-397.

DOI: 10.1109/icarcv.2008.4795551

Google Scholar

[4] Jing cun WANG, Xiao tong Zhang, Bin Chen, He ping Chen: A heuristic optimization path2finding algorithm based on Dijkst ra algorithm. Journal of Science and Technology University of Beijing, vol. 29, 2007, pp.346-349.

Google Scholar

[5] Donald B. Johnson: Efficient algorithms for shorest paths in sparse networks. Journal of the ACM, 24(1): 1-13, (1977).

Google Scholar

[6] T. D. Barfoot and C. M. Clark: Motion planning for formations ofmobile robots. Robotics and Autonomous Systems, vol. 46, p.65–78, February (2004).

DOI: 10.1016/j.robot.2003.11.004

Google Scholar