Yirui Jiang
1
,
Runjin Yang
2
,
Chenxi Zang
3
,
Zhiyuan Wei
4
,
John Thompson
5
,
Trung Hieu Tran
6
,
Adriana Encinas-Oropesa
7
,
Leon Williams
8
1
Cranfield University
2
Cranfield University
3
Cranfield University
4
Cranfield University
5
Cranfield University
6
Cranfield University
7
Cranfield University
8
Cranfield University
Abstract
Nowadays, the aviation industry pays more attention to emission reduction toward the net-zero carbon goals. However, the volume of global passengers and baggage is exponentially increasing, which leads to challenges for sustainable airports. A baggage-free airport terminal is considered a potential solution in solving this issue. Removing the baggage operation away from the passenger terminals will reduce workload for airport operators and promote passengers to use public transport to airport terminals. As a result, it will bring a significant impact on energy and the environment, leading to a reduction of fuel consumption and mitigation of carbon emission. This paper studies a baggage collection network design problem using vehicle routing strategies and augmented reality for baggage-free airport terminals. We use a spreadsheet solver tool, based on the integration of the modified Clark and Wright savings heuristic and density-based clustering algorithm, for optimizing the location of logistic hubs and planning the vehicle routes for baggage collection. This tool is applied for the case study at London City Airport to analyze the impacts of the strategies on carbon emission quantitatively. The result indicates that the proposed baggage collection network can significantly reduce 290.10 tonnes of carbon emissions annually.
Jiang, Y., Yang, R., Zang, C., Wei, Z., Thompson, J., Tran, T. H., … Williams, L. (2026). Toward Baggage-Free Airport Terminals: A Case Study of London City Airport. Asia Journal of Social Innovation and Development, 2(1), 24. Retrieved from https://www.ajsid.org/index.php/pub/article/view/24
📄4. Kallehauge, B.; Larsen, J.; Madsen, O.B.; Solomon, M.M. Vehicle routing problem with time windows. In Column Generation;Springer: Boston, MA, USA, 2005; pp. 67–98.
📄5. Karakatiˇc, S.; Podgorelec, V. A survey of genetic algorithms for solving multi depot vehicle routing problem. Appl. Soft Comput.2015, 27, 519–532. [CrossRef]
📄6. Brandão, J.C.S.; Mercer, A. The multi-trip vehicle routing problem. J. Oper. Res. Soc. 1998, 49, 799–805. [CrossRef]
📄7. Baldacci, R.; Battarra, M.; Vigo, D. Routing a heterogeneous fleet of vehicles. In The Vehicle Routing Problem: Latest Advances andNew Challenges; Springer: Boston, MA, USA, 2008; pp. 3–27.
📄8. Erdo ˘gan, S.; Miller-Hooks, E. A Green Vehicle Routing Problem. Transp. Res. Part E Logist. Transp. Rev. 2012, 48, 100–114.[CrossRef]
📄9. Bekta¸s, T.; Laporte, G. The pollution-routing problem. Transp. Res. Part B Methodol. 2011, 45, 1232–1250. [CrossRef]
📄10. Franceschetti, A.; Honhon, D.; Van Woensel, T.; Bektas, T.; Laporte, G. The time-dependent pollution-routing problem. Transp.Res. Part B Methodol. 2013, 56, 265–293. [CrossRef]
📄11. Koç, Ç.; Bekta¸s, T.; Jabali, O.; Laporte, G. The fleet size and mix pollution-routing problem. Transp. Res. Part B Methodol. 2014, 70,239–254. [CrossRef]
📄12. Zhang, W.; Gajpal, Y.; Appadoo, S.S.; Wei, Q. Multi-Depot Green Vehicle Routing Problem to Minimize Carbon Emissions.Sustainability 2020, 12, 3500. [CrossRef]
📄13. Ge, X.; Ge, X.; Wang, W. A path-based selection solution approach for the low carbon vehicle routing problem with a time-windowconstraint. Appl. Sci. 2020, 10, 1489. [CrossRef]
📄14. Ghorbani, E.; Alinaghian, M.; Gharehpetian, G.B.; Mohammadi, S.; Perboli, G. A Survey on Environmentally Friendly VehicleRouting Problem and a Proposal of Its Classification. Sustainability 2020, 12, 9079. [CrossRef]
📄15. Felipe, Á.; Ortuño, M.T.; Righini, G.; Tirado, G. A heuristic approach for the green vehicle routing problem with multipletechnologies and partial recharges. Transp. Res. Part E Logist. Transp. Rev. 2014, 71, 111–128. [CrossRef]
📄16. Schneider, M.; Stenger, A.; Goeke, D. The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations. Transp.Sci. 2014, 48, 500–520. [CrossRef]
📄17. Omidvar, A.; Tavakkoli-Moghaddam, R. Sustainable vehicle routing: Strategies for congestion management and refuelingscheduling. In Proceedings of the IEEE International Energy Conference (ENERGYCON ’12), Florence, Italy, 9–12 September 2012; pp. 1089–1094.
📄6360/simplified-guidance-eu-drivers-hours-working-time-rules.pdf (accessed on 23 March 2021).
📄24. Hansen, W.G. Accessibility and Residential Growth. Ph.D. Thesis, Massachusetts Institute of Technology, Cambridge, MA, USA,1959.
📄25. Zhao, X. Based on gravity method of logistics distribution center location strategy research. In Proceedings of the International Conference on Logistics Engineering, Management and Computer Science (LEMCS 2014), Shenyang, China, 24–26 May 2014; Atlantis Press: Paris, France, 2014; pp. 586–589.
📄26. Alam, S.A. Evaluation of the potential locations for logistics hubs: A case study for a logistics company. Master’s Thesis, KTH Royal Institute of Technology, Stockholm, Sweden, 2013.
📄28. Kishita, Y.; Ohishi, Y.; Uwasu, M.; Kuroda, M.; Takeda, H.; Hara, K. Evaluating the life cycle CO2 emissions and costs of thermoelectric generators for passenger automobiles: A scenario analysis. J. Clean. Prod. 2016, 126, 607–619. [CrossRef]
📄29. Börjeson, L.; Höjer, M.; Dreborg, K.H.; Ekvall, T.; Finnveden, G. Scenario types and techniques: Towards a user’s guide. Futures 2006, 38, 723–739. [CrossRef]