scholarly journals Collaborative Hybrid Aerial and Ground Vehicle Routing for Post-Disaster Assessment

2021 ◽  
Vol 13 (22) ◽  
pp. 12841
Author(s):  
Anak Agung Ngurah Perwira Redi ◽  
Bertha Maya Sopha ◽  
Anna Maria Asih ◽  
Rahmad Inca Liperda
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Operation Time ◽  
Ground Vehicles ◽  
Routing Problem ◽  
Efficient Operation ◽  
Ground Vehicle ◽  
Battery Capacity ◽  
Disaster Assessment ◽  
Post Disaster

Hybrid aerial and ground vehicles are seen as a promising option for deployment in a post-disaster assessment due to the risk of infrastructure damage that may hinder the assessment operation. The efficient operation of the hybrid aerial and ground vehicle, particularly routings, remains a challenge. The present study proposed a collaborative hybrid aerial and ground vehicle to support the operation of post-disaster assessment. The study developed two models, i.e., the Two-Echelon Vehicle Routing Problem combined with Assignment (2EVRPA) and the Two-Echelon Collaborative Vehicle Routing Problem (2ECoVRP) to evaluate optimal routings for both aerial and ground vehicles. The difference lies in the second echelon in which the 2EVRPA uses a single point-to-point assignment, whereas the 2ECoVRP considers the collaborative routings between the ground vehicle and the aerial vehicle. To demonstrate its applicability, the developed models were applied to solve the post-disaster assessment for the Mount Merapi eruption in Yogyakarta, Indonesia. Sets of numerical experiments based on the empirical case were conducted. The findings indicate that the 2ECoVRP performs better than 2EVRPA in terms of the total operation time. The tabu search algorithm was found to be a promising method to solve the models due to its good quality solution and computational efficiency. The deployment of eight drones appears to be optimum for the given network configuration of the studied case. Flight altitude and battery capacity were found to be influential to the operation time, hence requiring further exploration. Other potential avenues for future research are also discussed.

scholarly journals Electric vehicle routing problem with backhauls considering the location of charging stations and the operation of the electric power distribution system

TecnoLógicas ◽  
2019 ◽  
Vol 22 (44) ◽  
pp. 1-20 ◽  
Author(s):  
Luis Carlos Cubides ◽  
Andrés Arias Londoño ◽  
Mauricio Granada Echeverri
Keyword(s):  
Vehicle Routing ◽  
Electric Vehicle ◽  
Power Distribution ◽  
Vehicle Routing Problem ◽  
Distribution Network ◽  
Optimal Operation ◽  
Mixed Integer ◽  
Routing Problem ◽  
Battery Capacity ◽  
Charging Stations

Logistics companies are largely encouraged to make greener their operations through an efficient solution with electric vehicles (EVs). However, the driving range is one of the limiting aspects for the introduction of EVs in logistics fleet, due to the low capacity provided by the batteries to perform the routes. In this regards, it is necessary to set up a framework to virtually increase this battery capacity by locating EV charging stations (EVCSs) along the transportation network for the completion of their routes. By the other side, the Distribution Network Operators (DNOs) express the concern associated with the inclusion of new power demands to be attended (installation of EVCSs) in the Distribution Network (DN), without reducing the optimal power supply management for the end-users. Under these circumstances, in this paper the Electric Vehicle Routing Problem with Backhauls and optimal operation of the Distribution Network (EVRPB-DN) is introduced and formulated as a mixed-integer linear programming model, considering the operation of the DN in conditions of maximum power demand. Different candidate points for the EVs charging are considered to recharge the battery at the end of the linehaul route or during the backhaul route. The problem is formulated as a multi-objective approach where the transportation and power distribution networks operation are modeled. The performance and effectiveness of the proposed formulation is tested in VRPB instance datasets and DN test systems from the literature. Pareto fronts for each instance are presented, using the ε-constraint methodology.

scholarly journals The Mobile Charging Vehicle Routing Problem with Time Windows and Recharging Services

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Shaohua Cui ◽  
Hui Zhao ◽  
Hui Chen ◽  
Cuiping Zhang
Keyword(s):  
Vehicle Routing ◽  
Electric Vehicles ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Sensitivity Analyses ◽  
Mixed Integer ◽  
Mixed Integer Linear Program ◽  
Routing Problem ◽  
Battery Electric Vehicles ◽  
Battery Capacity

For the environmental friendliness of the technology on battery electric vehicles, there is growing attention on it. However, the market share of battery electric vehicles remains low due to the range anxiety. As a remedy, the mobile charging services could offer charging service at any time or locations requested. For profitability of the services, the operator should route the charging vehicles in a more efficient manner. For this consideration, we formulate the mobile charging vehicle routing problem as a mixed integer linear program based on the classical vehicle routing problem with time windows. To demonstrate the model, test instances are designed and computational results are presented. In order to examine the change of the number of mobile charging vehicles and travel distance, sensitivity analyses, such as battery capacity and recharging rate, are performed. The results show that larger battery capacity, quicker charging rate, or higher service efficiency could decrease the number of mobile charging vehicles and total traveled distances, respectively.

scholarly journals An Adaptive Memetic Algorithm for Dynamic Electric Vehicle Routing Problem with Time-Varying Demands

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Na Wang ◽  
Yihao Sun ◽  
Hongfeng Wang
Keyword(s):  
Vehicle Routing ◽  
Electric Vehicle ◽  
Vehicle Routing Problem ◽  
Memetic Algorithm ◽  
Dynamic Environment ◽  
Time Varying ◽  
Routing Problem ◽  
Battery Capacity ◽  
Encoding Strategy ◽  
Local Search Operator

Dynamic electric vehicle routing problem (DEVRP) is an extension of the electric vehicle routing problem (EVRP) into dynamic logistical transportation system such that the demand of customer may change over time. The routing decision of DEVRP must concern with the driving range limitation of electric vehicle (EV) in a dynamic environment since both load degree and battery capacity are variable according to the time-varying demands. This paper proposes an adaptive memetic algorithm, where a special encoding strategy, an adaptive local search operator, and an economical random immigrant scheme are employed in the framework of evolutionary algorithm, to solve DEVRP efficiently. Numeric experiments are carried out upon a series of test instances that are constructed from a stationary VRP benchmark. The computational results show that the proposed algorithm is more effective in finding high-quality solution than several peer algorithms as well as significant in improving the capacity of the routing plan of EVs in dynamic transportation environment.

scholarly journals SVND Enhanced Metaheuristic for Plug-In Hybrid Electric Vehicle Routing Problem

2020 ◽  
Vol 10 (2) ◽  
pp. 441 ◽  
Author(s):  
Xiaohui Li ◽  
Xuemin Shi ◽  
Yi Zhao ◽  
Huagang Liang ◽  
Yuan Dong
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Hybrid Electric Vehicle ◽  
Low Cost ◽  
Mixed Integer ◽  
Routing Problem ◽  
Routing Optimization ◽  
Planning Optimization ◽  
Battery Capacity ◽  
Hybrid Electric

Plug-in Hybrid Electric Vehicles (PHEVs), as a new type of environmental-friendly low cost transportation, have attracted growing interests for logistics. The path-planning optimization for PHEV has become a major challenge. In fact, PHEV-based routing optimization is a type of hybrid vehicle routing problem (HVRP). Compared with the traditional Traveling Salesman Problem (TSP) and Vehicle Routing Problem (VRP), the PHEV routing problem should consider more constraints, such as time limits, capacity constraints (including fuel tank capacity and battery capacity), electric stations, fuel stations and so forth. In this paper, a Mixed Integer Linear Programming formulation is presented and a novel hybrid metaheuristic approach (HMA_SVND) is proposed. Our method is a combination of memetic algorithm (MA), sequential variable neighborhood descent (SVND) and a revised 2_opt method. Comparative studies show that our proposed method outperformed previous works.

scholarly journals Two - Echelon Vehicle Routing Problem with Recharge Stations

2019 ◽  
Vol 20 (4) ◽  
pp. 305-317
Author(s):  
Anita Agárdi ◽  
László Kovács ◽  
Tamás Bányai
Keyword(s):  
Vehicle Routing ◽  
Electric Vehicles ◽  
Vehicle Routing Problem ◽  
Manufacturing Systems ◽  
Route Planning ◽  
Planning Problem ◽  
Test Results ◽  
Routing Problem ◽  
Efficient Operation ◽  
Wide Range

Abstract The efficient operation of logistic processes requires a wide range of design tasks to ensure efficient, flexible and reliable operation of connected production and service processes. Autonomous electric vehicles support the flexible in-plant supply of cyber-physical manufacturing systems. Within the frame of this article, the extension of the Two-Echelon Vehicle Routing Problem with recharge stations is analyzed. The objective function of the optimization problem is the minimization of operation costs. The extension of 2E-VRP means that the second level vehicles (electric vehicles, must be recharged) come from one recharge station, then pick up the products from the satellite, visit the customers and return to the recharge station from where it started. We solved the route planning problem with the application of construction heuristics and improvement heuristics. The test results indicate that the combination of this approach provides a superior efficiency.

A novel structure to model the distribution of relief items in a post-disaster situation

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Reza Sakiani ◽  
Abbas Seifi ◽  
Reza Ramezani Khorshiddost
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Network Flow ◽  
Routing Problem ◽  
Content Type ◽  
Realistic Case ◽  
Novel Structure ◽  
Disaster Situation ◽  
Post Disaster

Purpose There is usually a considerable shortage of resources and a lack of accurate data about the demand amount in a post-disaster situation. This paper aims to model the distribution and redistribution of relief items. When the new data on demand and resources become available the redistribution of previously delivered items may be necessary due to severe shortages in some locations and surplus inventory in other areas. Design/methodology/approach The presented model includes a vehicle routing problem in the first period and some network flow structures for succeeding periods of each run. Thereby, it can produce itineraries and loading plans for each vehicle in all periods when it is run in a rolling horizon manner. The fairness in distribution is sought by minimizing the maximum shortage of commodities among the affected areas while considering operational costs. Besides, equity of welfare in different periods is taken into account. Findings The proposed model is evaluated by a realistic case study. The results show that redistribution and multi-period planning can improve efficiency and fairness in supply after the occurrence of a disaster. Originality/value This paper proposes an operational model for distribution and redistribution of relief items considering the differences of items characteristics. The model integrates two well-known structures, vehicle routing problem with pickup and delivery and network flow problem to take their advantages. To get more practical results, the model relaxes some simplifying assumptions commonly used in disaster relief studies. Furthermore, the model is used in a realistic case study.

scholarly journals A Linearized Approach for the Electric Light Commercial Vehicle Routing Problem Combined with Charging Station Siting and Power Distribution Network Assessment

2021 ◽  
Vol 11 (11) ◽  
pp. 4870
Author(s):  
Andrés Arias-Londoño ◽  
Walter Gil-González ◽  
Oscar Danilo Montoya
Keyword(s):  
Vehicle Routing ◽  
Power Distribution ◽  
Vehicle Routing Problem ◽  
Distribution System ◽  
Mixed Integer ◽  
Routing Problem ◽  
Power Distribution System ◽  
Charging Station ◽  
Battery Capacity ◽  
Electric Light

Transportation electrification has demonstrated a significant position on power utilities and logistic companies, in terms of assets operation and management. Under this context, this paper presents the problem of seeking feasible and good quality routes for electric light commercial vehicles considering battery capacity and charging station siting on the power distribution system. Different transportation patterns for goods delivery are included, such as the capacitated vehicle routing problem and the shortest path problem for the last mile delivery. To solve the problem framed within a mixed integer linear mathematical model, the GAMS software is used and validated on a test instance conformed by a 19-customer transportation network, spatially combined with the IEEE 34 nodes power distribution system. The sensitivity analysis, performed during the computational experiments, show the behavior of the variables involved in the logistics operation, i.e., routing cost for each transport pattern. The trade-off between the battery capacity, the cost of the charging station installation, and energy losses on the power distribution system is also shown, including the energy consumption cost created by the charging operation.

Nested Vehicle Routing Problem: Combined Operations of UAV and Ground Vehicle

2020 ◽  
Author(s):  
Fanruiqi Zeng ◽  
Zaiwei Chen ◽  
Harold Nikoue ◽  
Jose Magalhaes ◽  
John-Paul Clarke
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Ground Vehicle ◽  
Combined Operations

scholarly journals Robust Optimization for Handling Time Uncertainty in Capacitated Vehicle Routing Problem for Post Disaster Aid Logistical Distribution

2020 ◽  
Vol 8 (5) ◽  
pp. 571-577
Keyword(s):  
Robust Optimization ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Optimal Solution ◽  
Routing Problem ◽  
Time Uncertainty ◽  
Capacitated Vehicle Routing Problem ◽  
Disaster Aid ◽  
Post Disaster ◽  
Capacitated Vehicle

In post-disaster aid logistical distribution, time is the most important thing to minimize the number of victim. But, time travelling become uncertain as the impact of disaster occurrence. In this paper, Robust Capacitated Vehicle Routing Problem (RCVRP) for post-disaster aid logistical distribution under time uncertainty is discussed to handle the uncertain travelling time. The robust optimal solution derivation is presented using Robust Optimization. The time uncertainty is assumed to be lied in a box and a polyhedral uncertainty set. This assumption yields a Robust Counterpart (RC) of the RCVRP model which are computationally tractable. Case study and simulation presented in this paper and shows a robust optimal solution.

Sign in / Sign up

Export Citation Format

Share Document