دانلود رایگان مقاله بهینه سازی تخصیص مسافر به صندلی هواپیما بر اساس بار قابل حمل

abstract

We build upon previous work that assigns passengers to a specific numerical position in line that depends on their seat location. The assignment of seat locations to passengers depends on the number of luggage they carry aboard the plane. In particular, we propose a mixed integer programming model that determines the number of luggage to be carried by passengers assigned to each seat. Numerical results indicate that the proposed approach results in a reduction of the time to complete the boarding of the plane. The improvement is greatest when many luggage are carried onto the plane. The optimal distribution of luggage assigns passengers with few carry-on bags to the rows of the plane closest to the entrance.

5. Conclusions

Using the proposed mixed integer programming (MIP) modeldto determine the number of bags to be carried by passengers assigned to each seatdresults in a meaningful reduction in the time to complete the boarding of an airplane when compared with the method of Milne and Kelly (2014). As noted in Milne and Kelly (2014), their method results in a two to three percent improvement versus Steffen (2008)dthe best previous method for minimizing boarding time. Both the proposed method and that of Milne and Kelly (2014) use the Steffen (2008) approach of assigning passengers to a specific numerical position in the boarding line that depends on their seat location. The proposed method and the Milne and Kelly (2014) method utilize information on the number of bags passengers carry aboard the plane. This raises two practical concerns: 1) How can an airline know in advance the number of carryon bags a passenger will bring on board? 2) How to line up the passengers so that they board the plane in the proper sequence? We address these two concerns in turn