A two-stage solution approach for the Directed Rural Postman Problem with Turn Penalties

Cerrone, Carmine; Dussault, Benjamin; Wang, Xingyin; Golden, Bruce L.; Wasil, Edward

doi:10.1016/j.ejor.2018.07.004

Cited by 7 publications

(3 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When the patrol targets of vehicles and drones are segments in the road network, this problem is described as a variant of the arc routing problem [ 17 ]. The arc routing problem was developed from graph theory [ 29 ], and the most widely studied arc routing problems include the Chinese postman problem (CPP) [ 30 , 31 ], rural postman problem (RPP) [ 32 , 33 , 34 ], and capacitated arc routing problem (CARP) [ 35 , 36 ]. Kwan [ 37 ] first proposed the CPP, and designed a deterministic solution method.…”

Section: Related Workmentioning

confidence: 99%

A Coordinated Vehicle–Drone Arc Routing Approach Based on Improved Adaptive Large Neighborhood Search

Zhao

Cheng

et al. 2022

Sensors

View full text Add to dashboard Cite

Through urban traffic patrols, problems such as traffic congestion and accidents can be found and dealt with in time to maintain the stability of the urban traffic system. The most common way to patrol is using ground vehicles, which may be inflexible and inefficient. The vehicle–drone coordination maximizes utilizing the flexibility of drones and addresses their limited battery capacity issue. This paper studied a vehicle–drone arc routing problem (VD-ARP), consisting of one vehicle and multiple drones. Considering the coordination mode and constraints of the vehicle–drone system, a mathematical model of VD-ARP that minimized the total patrol time was constructed. To solve this problem, an improved, adaptive, large neighborhood search algorithm (IALNS) was proposed. First, the initial route planning scheme was generated by the heuristic rule of “Drone-First, Vehicle-Then”. Then, several problem-based neighborhood search strategies were embedded into the improved, adaptive, large neighborhood search framework to improve the quality of the solution. The superiority of IALNS is verified by numerical experiments on instances with different scales. Several critical factors were tested to determine the effects of coordinated traffic patrol; an example based on a real road network verifies the feasibility and applicability of the algorithm.

show abstract

Section: Related Workmentioning

confidence: 99%

A Coordinated Vehicle–Drone Arc Routing Approach Based on Improved Adaptive Large Neighborhood Search

Zhao

Cheng

et al. 2022

Sensors

View full text Add to dashboard Cite

show abstract

“…( 2017 ) and used in Cerrone et al. ( 2019 ). The computational results on this set of instances are shown in Table 6 .…”

Section: Computational Experimentsmentioning

confidence: 99%

VRP in urban areas to optimize costs while mitigating environmental impact

Cerrone

Sciomachen

2022

Soft Comput

Self Cite

View full text Add to dashboard Cite

Nowadays, the need to think about sustainable mobility, both goods and people, is widely recognized. For this reason, many recent papers have moved in this direction. In this context, particular attention is now devoted to urban mobility, mainly from a smart city perspective. The present work focuses on sustainable urban freight distribution and proposes a variant of the VRP, which presents some innovative aspects. The goal is to minimize the routes’ cost components, including traveling and external costs due to environmental issues, depending on the chosen vehicles and the different urban streets to cross. In addition, restrictions on the maximum duration of each route to ensure frequent sanitation of vehicles used for deliveries, as required from the beginning of the COVID-19 pandemic, are imposed. The distribution network is modeled by a weighted digraph for which some properties are proved. To face the problem, we present a mixed-integer linear programming model, a math-heuristic associated with it, and a memetic algorithm approach. The results of the reported computational experimentation with random instances specifically tailored for the problem show the efficiency of the proposed methods. Further, test cases based on data of the distribution network of two B2C companies operating in the city of Genoa, Italy, proved the effective application of the proposed methods in the direction of sustainable urban distribution plans.

show abstract

“…POGR is very similar to RPP problem. RPP is to find a loop with the shortest distance, when a postman passes through all edges and each edge is passed only once in the graph [47]. It belongs to the combinatorial optimization problems.…”

Section: Modelingmentioning

confidence: 99%

Path Optimization of Gluing Robot Based on Improved Genetic Algorithm

et al. 2021

View full text Add to dashboard Cite

The worn belt surface has acceleration characteristics. Thus, timely and rapid maintenance of the microdamage is vital. To quickly and automatically repair the microdamage is a prime target for the gluing robot (GR).To that end, a new variant Traveling Salesman Problem (TSP) is put forward: according to the worn information and GR's workspace, the worn segments are divided; at a certain worn segment, path optimization of the gluing robot (POGR) problem is presented; then the POGR is simplified into a "double vertices" TSP by Hamilton graph, and the mathematical modeling is built. An improved genetic algorithm (IGA) is proposed to handle the POGR problem, which is called IGA-POGR. The main benefit of the proposed IGA-POGR is the ability to solve POGR of different scales in different ways. The performance of the IGA-POGR is illustrated on four well-known TSP problems and Python simulation is carried out. Numerical results show that IGA-POGR does not give any deviation (0%) from the optimal solution. Compared with discrete particle swarm optimization (DPSO), IGA-POGR has better performance in terms of the solving quality and time consumption when solving four POGR problems.

show abstract

A two-stage solution approach for the Directed Rural Postman Problem with Turn Penalties

Cited by 7 publications

References 23 publications

A Coordinated Vehicle–Drone Arc Routing Approach Based on Improved Adaptive Large Neighborhood Search

A Coordinated Vehicle–Drone Arc Routing Approach Based on Improved Adaptive Large Neighborhood Search

VRP in urban areas to optimize costs while mitigating environmental impact

Path Optimization of Gluing Robot Based on Improved Genetic Algorithm

Contact Info

Product

Resources

About