Abstract
This paper considers the process of aircraft refuelling using refuelling trucks at an airport. The problem which arises is to determine the minimum number of refuelling trucks and their routes for the given demand (schedule and fuel quantities). The constraint is that there is no aircraft departure delay due to the refuelling process. The optimum solution is found here using the branch-and-bound technique. This solution is compared with results obtained on the basis of random assignment and a few conclusions are made. The paper also presents a model application example based on real life data from a medium-sized airport.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
