A taxonomic review of metaheuristic algorithms for solving the vehicle routing problem and its variants

Elshaer, Raafat; Awad, Hadeer

doi:10.1016/j.cie.2019.106242

Cited by 200 publications

(102 citation statements)

References 316 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recent literature has demonstrated added value in switching between multiple destroy-repair couples during the search by adopting a metaheuristic approach (Elshaer and Awad, 2020). Metaheuristics automate the choice of the destroyrepair methods to be employed at any iteration in the search by proposing a selection mechanism.…”

Section: State Of the Artmentioning

confidence: 99%

The electric autonomous dial-a-ride problem

Bongiovanni

Kaspi

Geroliminis

2019

Transportation Research Part B: Methodological

102

View full text Add to dashboard Cite

Section: State Of the Artmentioning

confidence: 99%

The electric autonomous dial-a-ride problem

Bongiovanni

Kaspi

Geroliminis

2019

Transportation Research Part B: Methodological

102

View full text Add to dashboard Cite

“…Constraints (13) ensure that each student is allocated to a single bus stop. Constraints (14) guarantee that each active stop is visited by one bus and no bus visits a bus stop which is non-active. Constraints (15) make sure that those bus stops with no students allocated remain non-active.…”

Section: Solving a Milp Problem For Selecting The Active Stopsmentioning

confidence: 99%

“…On the other hand, metaheuristic algorithms are widely used in routing problems. Toth and Vigo [13], Elshaer and Awad [14] and Vidal et al [15] provide recent and complete reviews on the variants of the Vehicle Routing Problems and the use of metaheuristic algorithms for solving them. This paper addresses the School Bus Routing Problem with bus Stop Selection and a Maximum walking Distance constraint (SBRP-SS-MD) as defined by Schittekat et al [16] and usually associated with urban areas.…”

Section: Introductionmentioning

confidence: 99%

A Partial Allocation Local Search Matheuristic for Solving the School Bus Routing Problem with Bus Stop Selection

et al. 2020

View full text Add to dashboard Cite

This paper addresses the school bus routing problem with bus stop selection, which jointly handles the problems of determining the set of bus stops to visit, allocating each student to one of these bus stops and computing the routes that visit the selected bus stops, so that the total routing cost is minimized and the walking distance of the students is limited by a given value. A fast and efficient matheuristic is developed based on an innovative approach that first partially allocates the students to a set of active stops that they can reach, and computes a set of routes that minimizes the routing cost. Then, a refining process is performed to complete the allocation and to adapt the routes until a feasible solution is obtained. The algorithm is tested on a set of benchmark instances. The computational results show the efficiency of the algorithm in terms of the quality of the solutions yielded and the computing time.

show abstract

“…Eq. (10) shows that demand nodes receive the products only by vehicles that have been already used. Eq.…”

Section: Problem Descriptionmentioning

confidence: 99%

“…The most remarkable reference in the VRP is the book published by Toth and Vigo [9] which presents a proper list of high-performance algorithms to solve the CVRP. Recently, a comprehensive review of meta-heuristic algorithms for solving the CVRP and other variants of VRP was conducted by Elshaer and Awad [10]. The literature of CVRP is rich in different metaheuristic algorithms such as simulated annealing (SA) [11], genetic algorithm (GA) [12], tabu search (TS) algorithm [13] and variable neighborhood search (VNS) algorithm [14].…”

Section: Introductionmentioning

confidence: 99%

A Capacitated Vehicle Routing Problem considering Satisfaction Level of Customers: A Genetic Algorithm

Naghshnilchi

2019

IJOR

View full text Add to dashboard Cite

Capacitated vehicle routing problem (CVRP) is one of the most well-known and applicable issues in the field of transportation. It has been proved to be an NP-Complete problem. To this end, it is needed to develop a high-performance algorithm to solve the problem, particularly in large scales. This paper develops a novel mathematical model for the CVRP considering the satisfaction level of demand nodes. Then, the proposed model is validated using a numerical example and sensitivity analyses that are implemented by CPLEX solver/GAMS software. To solve the problem efficiently, a Genetic Algorithm (GA) is designed and implemented. The obtained results demonstrate that the proposed GA can yield high-quality solutions compared to exact solutions.

show abstract

A taxonomic review of metaheuristic algorithms for solving the vehicle routing problem and its variants

Cited by 200 publications

References 316 publications

The electric autonomous dial-a-ride problem

The electric autonomous dial-a-ride problem

A Partial Allocation Local Search Matheuristic for Solving the School Bus Routing Problem with Bus Stop Selection

A Capacitated Vehicle Routing Problem considering Satisfaction Level of Customers: A Genetic Algorithm

Contact Info

Product

Resources

About