Abstract
Taxi planning problem studies aircraft routing and scheduling on the airport ground. Taxi planning has been formulated using a binary multicommodity flow model in a space-time airport network. The flow capacity constraints are used to represent the conflicts among aircraft, given an airport’s capacity. Branch and price methodology has been adapted to take advantage of the integer model structures. The computational tests have been run with real data from Adolfo Suárez Madrid-Barajas airport. The tests were oriented toward comparing the new adapted branch and price with the classic Branch and Bound algorithm, trying to obtain conclusions that are useful for airport managers.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
