A time-dependent hierarchical Chinese postman problem

Çodur, Merve Kayacı; Yılmaz, Mustafa

doi:10.1007/s10100-018-0598-8

Cited by 16 publications

(5 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As time constraint is inherent in this scenario, the solution will be based on VRP with time windows (VRPTW). Different routing techniques can be used for scenarios such as Chinese postman problems, ant colony optimization, traveling salesman problems, and others [45,46]. However, the current study is based on VRPTW.…”

Section: Methodsmentioning

confidence: 99%

Towards Smart Healthcare: UAV-Based Optimized Path Planning for Delivering COVID-19 Self-Testing Kits Using Cutting Edge Technologies

et al. 2021

View full text Add to dashboard Cite

Coronavirus Disease 2019 (COVID-19) has emerged as a global pandemic since late 2019 and has affected all forms of human life and economic developments. Various techniques are used to collect the infected patients’ sample, which carries risks of transferring the infection to others. The current study proposes an AI-powered UAV-based sample collection procedure through self-collection kits delivery to the potential patients and bringing the samples back for testing. Using a hypothetical case study of Islamabad, Pakistan, various test cases are run where the UAVs paths are optimized using four key algorithms, greedy, intra-route, inter-route, and tabu, to save time and reduce carbon emissions associated with alternate transportation methods. Four cases with 30, 50, 100, and 500 patients are investigated for delivering the self-testing kits to the patients. The results show that the Tabu algorithm provides the best-optimized paths covering 31.85, 51.35, 85, and 349.15 km distance for different numbers of patients. In addition, the algorithms optimize the number of UAVs to be used in each case and address the studied cases patients with 5, 8, 14, and 71 UAVs, respectively. The current study provides the first step towards the practical handling of COVID-19 and other pandemics in developing countries, where the risks of spreading the infections can be minimized by reducing person-to-person contact. Furthermore, the reduced carbon footprints of these UAVs are an added advantage for developing countries that struggle to control such emissions. The proposed system is equally applicable to both developed and developing countries and can help reduce the spread of COVID-19 through minimizing the person-to-person contact, thus helping the transformation of healthcare to smart healthcare.

show abstract

Section: Methodsmentioning

confidence: 99%

Towards Smart Healthcare: UAV-Based Optimized Path Planning for Delivering COVID-19 Self-Testing Kits Using Cutting Edge Technologies

et al. 2021

View full text Add to dashboard Cite

show abstract

“…We develop an algorithm based on a Genetic Algorithm (GA) and a Constructive Heuristic (CH). Notice that GAs have been applied successfully in time-dependent traveling salesmanrelated problems [61]- [65].…”

Section: Genetic Algorithmmentioning

confidence: 99%

Modeling and Solving the Time-Dependent in-Building Delivery Problem in Last-Mile Logistics

Paredes-Belmar,

Latorre-Núñez,

Bronfman

2024

IEEE Access

View full text Add to dashboard Cite

This article introduces, models, and solves the time-dependent in-building delivery problem in last-mile logistics. It determines efficient travel sequences for a worker (e.g., delivery person, deliveryman, mailman, agent) who delivers goods or provides services directly to customers located within a building using its elevation system. We study, in detail, all the steps involved in a travel sequence inside a building: horizontal trips, unloading products to the customers, waiting for elevators, and vertical trips within elevators. The sequences and their total times vary depending on the building type, the elevation system, the moment of the day, and the arrival time because of the daily building traffic intensity variations. A mixed-integer linear programming model and a genetic algorithm-based metaheuristic are proposed to solve a set of instances in two office buildings. The results show that it is very important to determine the best time to visit a building because of its time dependency. The variation in delivery time between off-peak hours versus peak hours is between 15% and 30% for the set of solved instances. Moreover, the order of customer visits differs drastically depending on the arrival time to the building.INDEX TERMS in-building deliveries, genetic algorithm, last-mile delivery I. INTRODUCTION

show abstract

“…Codur et al [10] proposed a time-dependent variant of the Hierarchical Chinese Postman Problem (HCCP). Through mixed-integer linear programming, the proposed method minimizes the total travel time while maintaining precedence relationships between edges.…”

Section: Introductionmentioning

confidence: 99%

Optimization of Snowplow Routes for Real-World Conditions

Abdullah

Seo

et al. 2022

Sustainability

View full text Add to dashboard Cite

During the winter season, snowplowing has a significant effect on road users as it is critical to winter road maintenance and operations. The main goal of this study is to generate optimal routes for snowplowing trucks for efficient road maintenance. In addition to the conventional problem of reducing travel time and distance, this study also incorporates actual operational constraints, such as minimum maintenance standards and driver safety, to improve the overall efficiency of operations. To achieve the objectives, we first implemented the Chinese Postman Problem (CPP) to create Euler circuits from the initial routes and then identified the shortest paths by applying Dijkstra’s algorithm. Then, the Tabu search algorithm was chosen as a metaheuristic algorithm for the optimization process that finds near-optimal solutions by considering operational constraints for snowplow routes. Unsafe turning conditions and minimum maintenance standards were taken into account in the objective function defined for the optimization process. In simulations, the route obtained by our approach was compared to one with the application of CPP only in terms of travel distance, time, turning conditions, and road maintenance priority.

show abstract

A time-dependent hierarchical Chinese postman problem

Cited by 16 publications

References 41 publications

Towards Smart Healthcare: UAV-Based Optimized Path Planning for Delivering COVID-19 Self-Testing Kits Using Cutting Edge Technologies

Towards Smart Healthcare: UAV-Based Optimized Path Planning for Delivering COVID-19 Self-Testing Kits Using Cutting Edge Technologies

Modeling and Solving the Time-Dependent in-Building Delivery Problem in Last-Mile Logistics

Optimization of Snowplow Routes for Real-World Conditions

Contact Info

Product

Resources

About