Toward Baggage-Free Airport Terminals: A Case Study of London City Airport

Jiang, Yirui; Yang, Runjin; Zang, Chenxi; Wei, Zhiyuan; Thompson, John E.; Tran, Trung Hieu; Encinas-Oropesa, A.; Williams, Leon

doi:10.3390/su14010212

Cited by 6 publications

(3 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Sarmah et al [15] successfully applied the algorithm to the solid municipal waste collection problem for 15 municipality districts of Bilaspur (India). Jiang et al [16] focused on optimizing the vehicle routing for baggage pickup in airport terminals. Noteworthy results were obtained when comparing the Clarke and Wright algorithm with other methods.…”

Section: Literature Reviewmentioning

confidence: 99%

Modification of the Clarke and Wright Algorithm with a Dynamic Savings Matrix

Fikejz,

Brázdová,

Jánošíková

2024

Journal of Advanced Transportation

View full text Add to dashboard Cite

The goods collection and delivery process often relates to distribution logistics problems. The task is to deliver goods from warehouses to customers under specific circumstances. Efforts to optimize the process are largely aimed at reducing overall costs of goods transportation. Among the prominent algorithms for solving the basic type of the delivery (or collection) problem, which includes a single depot and a homogeneous vehicle fleet, is the algorithm developed by Clarke and Wright in 1964. This algorithm minimizes transportation costs by maximizing the savings achieved through merging multiple routes into one. This paper primarily aims to solve the pickup and delivery problem where the goods must be delivered and empty packaging collected in a single process. The request of a customer can be routed from the depot or from another customer. Similarly, the destination of the request may be the depot or another customer. Unlike the original version of the Clarke and Wright algorithm, the initial routes are created to satisfy delivery orders, and therefore, the same customer can occur in multiple routes. Consequently, a situation may arise in which two routes containing one or more common vertices must be combined during the calculation. Furthermore, these vertices need not be the outermost vertices of the routes. This situation cannot be addressed by using the original version of the Clarke and Wright algorithm, and that is why we propose its modification. Merging routes through inner vertices means that the cost savings depend on the configurations of the routes, and therefore, they cannot be calculated a priori. Instead, the dynamic savings matrix must be used.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Modification of the Clarke and Wright Algorithm with a Dynamic Savings Matrix

Fikejz,

Brázdová,

Jánošíková

2024

Journal of Advanced Transportation

View full text Add to dashboard Cite

show abstract

“…However, the continuous rise in passenger numbers and accompanying baggage poses challenges in the design of sustainable airports. A key strategy in emission reduction involves the implementation of baggage-less airport designs, thereby enabling passengers to confidently opt for public transportation and reducing the operational energy demand of airports, particularly within baggage handling systems [4].…”

Section: Introductionmentioning

confidence: 99%

Enhancing airport environmental sustainability through net zero energy building principles

Pandiangan,

Kurniawan,

Aurelia

et al. 2023

IOP Conf. Ser.: Earth Environ. Sci.

View full text Add to dashboard Cite

Airports play a crucial role in Indonesia, an archipelagic country, by connecting various regions, especially those separated by vast oceans. The extensive scale of airport construction directly influences environmental conditions, making environmental preservation and sustainability essential considerations. Hence, implementing the net zero energy building principle in airports, particularly in Indonesia, becomes imperative to enhance environmental sustainability. This study focused on Yogyakarta International Airport (YIA), a facility that has achieved Greenship Gold certification, making it a suitable case for investigating the application of net zero energy building principles. Adapting the net zero building concept to complex airport structures presents challenges. Besides using rating tools, simulation modeling offers a performance-based approach to assess the application of net zero energy building principles effectively. We used quantitative method by utilizing software like EDGE to simulate net zero energy buildings and identify optimal performance strategies for YIA. The study’s outcomes comprised an analysis of the net zero energy building model, providing valuable insights for developing specific guidelines on net zero energy principles in airport terminal buildings. This research aimed to expand knowledge on net zero building performance at airports, contributing to the development of guidelines for net zero airport terminal criteria.

show abstract

“…Considering the transfer time budget, a transfer demand-oriented objective function is formulated to improve the efficient utilization of gate resources. To reduce baggage transportation distance, Jiang et al [37] improved vehicle routes for baggage collection to minimize total vehicle distance.…”

Section: Introductionmentioning

confidence: 99%

Optimal Route Assignment at the Bus Hub with Multiple Berths for Minimal Passenger Transfer Distance

Zhang

Jin

Hao

et al. 2022

Journal of Mathematics

View full text Add to dashboard Cite

Bus hub is characterized with multiple berths, each serving specific bus routes. When bus routes at different berths share the same stops en route, passengers to the shared stops may rush among these berths to catch the newly arriving bus, causing inconvenience and deteriorating bus service level. Thus, this research attempts to optimize bus route assignment to the berths at a bus hub to minimize passenger transfer distance among the optional berths. The problem is modeled with integer linear programming, with the constraints of bus service capacity. To enhance computation efficiency, exclusive and inclusive constraints based on the count of shared stops among the bus routes are additionally added to the original model, though they may bring gap from the optimal solution. Case study follows to apply the proposed set of models to a bus terminal, where a total of 26 routes are assigned to 11 berths. It is found that the models with additional constraints can greatly reduce calculation time at the cost of small or no gap from the optimal solution. Thus, the models with additional constraints are recommended to obtain ideal solution quickly. This research provides insights into bus route management at the bus terminal with multiple berths, contributing to enhanced passenger waiting experience.

show abstract

Toward Baggage-Free Airport Terminals: A Case Study of London City Airport

Cited by 6 publications

References 20 publications

Modification of the Clarke and Wright Algorithm with a Dynamic Savings Matrix

Modification of the Clarke and Wright Algorithm with a Dynamic Savings Matrix

Enhancing airport environmental sustainability through net zero energy building principles

Optimal Route Assignment at the Bus Hub with Multiple Berths for Minimal Passenger Transfer Distance

Contact Info

Product

Resources

About