An improved estimation of distribution algorithm for multi-compartment electric vehicle routing problem

Abstract

The multi-compartment electric vehicle routing problem (EVRP) with soft time window and multiple charging types (MCEVRP-STW&MCT) is studied, in which electric multi-compartment vehicles that are environmentally friendly but need to be recharged in course of transport process, are employed. A mathematical model for this optimization problem is established with the objective of minimizing the function composed of vehicle cost, distribution cost, time window penalty cost and charging service cost. To solve the problem, an estimation of the distribution algorithm based on Lévy flight (EDA-LF) is proposed to perform a local search at each iteration to prevent the algorithm from falling into local optimum. Experimental results demonstrate that the EDA-LF algorithm can find better solutions and has stronger robustness than the basic EDA algorithm. In addition, when comparing with existing algorithms, the result shows that the EDA-LF can often get better solutions in a relatively short time when solving medium and large-scale instances. Further experiments show that using electric multi-compartment vehicles to deliver incompatible products can produce better results than using traditional fuel vehicles.

Multi-Trip Multi-Compartment Vehicle Routing Problem with Backhauls

“…Manufacturing-based examples are discussed in (Pasha et al 2020) and (Zou, Pan, and Tasgetiren 2021). Additionally, liquid or fuel containers based cases are addressed in (Cornillier et al 2008), (Asawarungsaengkul et al 2013), (Lahyani et al 2015), (Febriandini, Sutopo, et al 2020), (Wang, Kinable, and Van Woensel 2020), (Chowmali and Sukto 2021), (Yindong, Liwen, and Jingpeng 2021), (Ramadhani, Masruroh, and Waluyo 2021) and (Guo et al 2022). Lastly, studies such as (Henke, Speranza, and Wäscher 2015), (Gajpal et al 2017), (Mofid-Nakhaee and Barzinpour 2019) and (Paksaz, Salamian, and Jolai 2020) focused on garbage collection-related issues.…”

A Novel Levy Walk-based Framework for Scheduling Power-intensive Mobile Edge Computing Tasks

“…Our proposed approach dynamically models the mobility patterns of users and devices in MEC. It adjusts resource allocation and task scheduling to minimize completion time while reducing energy consumption [9] [10]. For example, imagine a user streaming a video on their mobile device while on the move.…”

Green Vehicle Routing Problem with Capacitated Service Stations

“…The algorithm combines the maximum-space-utilization-based tabu search (MSUTS) algorithm to solve the feasibility of each route in the 2L-SDVRP problems. [24]- [26] Building upon these accomplishments, this study proposes a hybrid two-stage heuristic algorithm (HTSHA) to solve the green vehicle routing problem (GVRP-CSS) by taking into account the limited capacity of service stations.…”