Computers & Industrial Engineering 140 (2020) 106242

Contents lists available at ScienceDirect

Computers & Industrial Engineering

journal homepage: www.elsevier.com/locate/caie

A taxonomic review of metaheuristic algorithms for solving the vehicle T

routing problem and its variants
Raafat Elshaer , Hadeer Awad
⁎

Industrial Engineering Department, Faculty of Engineering, Zagazig University. Zagazig, Egypt

ARTICLE INFO ABSTRACT

Keywords: Recently, a taxonomic review of the Vehicle Routing Problem (VRP) literature published between 2009 and June
Metaheuristics 2015 stated that most of the surveyed articles use metaheuristics for solving the problem and its variants. As
Vehicle Routing Problem extension to that work, this paper serves two-fold objectives: first, classifying the VRP and its variants solved
Taxonomic review using metaheuristic algorithms; second, investigating the contribution of each metaheuristic algorithm in solving
the VRP problems. Based on a metaheuristic classification, we classify 299 VRP articles published between 2009
and 2017. The results are analyzed to reveal the usage trends of the algorithms and the solved VRP variants for
showing the ones that are most popular, and those that are promising topics for future research.

1. Introduction
Metaheuristics represent a core research field in combinatorial op-
timization as illustrated by many literature reviews (e.g., (Blum & Roli,
2003; Boussaïd, Lepagnot, & Siarry, 2013; Gendreau & Potvin, 2005;
Osman & Laporte, 1996)) and books (e.g., (Gendreau & Potvin, 2010;
Glover & Kochenberger, 2003)). The Vehicle Routing Problem (VRP),
introduced by (Dantzig & Ramser, 1959), is one of the most attractive
topics in operation research, communications, manufacturing, trans-
portation, distribution, and logistics. It is of paramount importance for
thousands of companies and organizations engaged in the delivery and
collection of goods or people (Gendreau & Potvin, 2010; Glover &
Kochenberger, 2003). Several surveys and taxonomies for the VRP can
be found in (Bodin, 1975; Bodin & Golden, 1981; Braekers, Ramaekers,
& Van Nieuwenhuyse, 2016; Desrochers, Lenstra, & Savelsbergh, 1990;
Eksioglu, Vural, & Reisman, 2009) and in many books or book chapters
(Cordeau, Laporte, Savelsbergh, & Vigo, 2007; Golden, Raghavan, &
Wasil, 2008).
The VRP is an NP-hard problem and furthermore its real-life VRP
applications are considerably larger in scale. Therefore, metaheuristics
are often more suitable for practical applications. (Gendreau, Potvin,
Bräysy, Hasle, & Løkketangen, 2008) provide a categorized biblio-
graphy on metaheuristic approaches for different VRP variants. Re-
cently, a taxonomic review (Braekers et al., 2016) of the VRP literature
published between 2009 and mid-2015 stated that around 71.25% of
the surveyed articles use metaheuristics. To further extend that review,
the main objective of this work is to investigate the contribution of each
metaheuristic in solving the problem and its variants. The contribution
is measured based on the percentage of usage of a particular method or
algorithm. In addition, the problem attributes usages are also in-
vestigated. Due to limited space the performance of the surveyed me-
taheuristics in solving the problem is not considered.
The following two sections (Sections 2 and 3) introduce the VRP
problems and metaheuristics algorithms respectively. A search strategy
for collecting the VRP articles solved by metaheuristic algorithms is
designed in Section 4; the collected articles are classified based on the
VRP and its variants and based on the metaheuristic used in Section 5.
The two classifications allow analyzing which VRP variants (or meta-
heuristic methods) are most popular, and which are promising topics
for future research (Section 6).
2. VRP and its variants
The basic VRP, known as the Capacitated VRP (CVRP), is to find the
set of routes for a fleet of identical vehicles with overall minimum route
cost which service all the demands. All vehicles should begin and ter-
minate at the central depot. Each customer should be visited exactly
once, by exactly one route. The loading and traveling distance of each
vehicle cannot exceed the loading capacity and the maximum traveling
distance of vehicle and split deliveries are not allowed (e.g. (Akpinar,
2016; Bouzid, Aït Haddadene, & Salhi, 2017)). The basic VRP has many
variants. Next, the main categories of these variants are presented in
more details.

⁎
Corresponding author.
E-mail addresses: r_h_elshaer@zu.edu.eg, rhelshaer@eng.zu.edu.eg (R. Elshaer), hadeerawad@eng.zu.edu.eg (H. Awad).

https://doi.org/10.1016/j.cie.2019.106242
Received 19 November 2018; Accepted 20 December 2019
Available online 27 December 2019
0360-8352/ © 2019 Elsevier Ltd. All rights reserved.
R. Elshaer and H. Awad Computers & Industrial Engineering 140 (2020) 106242

Noising method (SA-NM)

Threshold accepting method

Simulated annealing methods (SA)
(SA-TA)

Microcanonic annealing (SA-MA)

Adaptive large neighborhood

search (ALNS)
large neighborhood search (LNS)
Very large scale neighborhood
Tabu search (TS)
Single-solution based search (VLSN)
Iterated local search (ILS)
Electromagnetism-Like Algorithm
Guided local search (GLS) (EMA)

Variable neighborhood search Memetic algorithm (MA)

Metaheuristics
(VNS)
Genetic algorithm (GA)
Greedy Randomized Adaptive
Genetic programming (GP)
Search Procedure (GRASP)
Evolutionary programming (EP)
Evolutionary computation (EC)
Evolution Strategy (ES)
Shuffled Frog Leaping Algorithm (SFLA)
Estimation of Distribution Algorithms
Population-based Intelligent Water Drops Algorithm (IWD)
(EDAs)
Cuckoo search (CS)
Differential Evolution (DE) algorithm
Firefly algorithm (FA)

Ant Colony Optimization (ACO) Coevolutionary algorithms (CoEA)

Particle Swarm Optimization (PSO) Cultural Algorithms (CA)

Swarm intelligence
(SI)
Biogeography -Based Optimization Scatter Search (SS)
algorithm (BBO)
Path Relinking (PR)
Artificial immune systems (AIS)

Bee colony optimization -based

algorithms (BCO)

Bacterial Foraging Optimization

Algorithm (BFOA)

Fig. 1. Classification tree of metaheuristic algorithms.

(1) The VRP with Time Windows (VRPTW) which impose that each
vehicle delivers the goods to the customers within specific time
interval and there are two types of time windows: VRP with soft
time window (VRPSTW) in which violating the time windows is
allowed, but associated with penalty costs (Iqbal, Kaykobad, &
Rahman, 2015), and VRP with hard time window (VRPHTW) in
which the time windows do not allow any delay (e.g. (Miranda &
Conceição, 2016; Zhang, Cai, Ye, Si, & Nguyen, 2017)). A mix of
soft and hard time windows are also considered (e.g. (Mouthuy,
Massen, Deville, & Van Hentenryck, 2015; Taş, Jabali, & Van
Woensel, 2014)).
(2) The Pickup and Delivery Problem (PDP), a number of goods needs
to be moved from certain pickup locations to other delivery lo-
cations. The PDP can be classified into VRP with backhauls
(VRPB) (e.g. (Dominguez, Guimarans, Juan, & de la Nuez, 2016;
Wassan, Wassan, Nagy, & Salhi, 2017)), VRP with Clustered
Backhauls (VRPCB) (Tarantilis, Anagnostopoulou, & Repoussis,
2013), VRP with mixed backhauls (VRPMB) (e.g., (Berghida &
Boukra, 2015; Wu, Tian, & Jin, 2016)), VRP with divisible de-
liveries and pickups (VRPDDP) (Nagy, Wassan, Speranza, &
Archetti, 2015), and VRP with simultaneous pickups and de-
liveries (VRPSPD) (e.g. (Avci & Topaloglu, 2016; Kalayci & Kaya,
2016)). For details of PDP, we refer the reader to (Parragh,
Doerner, & Hartl, 2008a, 2008b).
(3) The Heterogeneous VRP (HVRP) assumes the vehicles have dif-
ferent capacities (e.g., (Lai, Caliskan Demirag, & Leung, 2016; Liu,
2013)).
(4) The Multi-depot VRP (MDVRP) assumes that a company may have
several depots from which it can serve its customers ((Montoya-
Torres, López Franco, Nieto Isaza, Felizzola Jiménez, & Herazo-
Padilla, 2015).
(5) The Periodic VRP (PVRP) in which the classical VRP is generalized
by extending the planning horizon to several days and customers
may be visited more than once (e.g. (Campbell & Wilson, 2014;
Gulczynski, Golden, & Wasil, 2011b)).
(6) The Split-delivery VRP (SDVRP), in which the demands of custo-
mers are allowed to be split and delivered to the customer by
several vehicles on different routes (e.g. (Silva, Subramanian, &
Ochi, 2015)).
(7) The Stochastic VRP (SVRP) is the variant in which one or several
components of the problem are random that follows a probability
distribution. SVRP can be divided into the VRP with stochastic
demand (VRPSD), the VRP with stochastic customers (VRPSC), the
VRP with stochastic demands and customers (VRPSDC), and the
VRP with stochastic travel and service times (VRPSTS) (e.g.
(Marinaki & Marinakis, 2016; Miranda & Conceição, 2016)).
(8) The Open VRP (OVRP) in which vehicles do not necessarily return
to the original depot after completing their delivery services. If
they do, they must visit the same customers in the reverse order
(e.g. (Marinakis & Marinaki, 2014; Norouzi, Tavakkoli-
Moghaddam, Ghazanfari, Alinaghian, & Salamatbakhsh, 2012)).
(9) The Time-dependent VRP (TDVRP) in which travel speeds (times)
are assumed to depend on the time of travel when planning ve-
hicle routing (e.g. (Alinaghian & Naderipour, 2016; Franceschetti
et al., 2017)).
(10) The less commonly used variants are such as Green VRP (G-VRP),

2
R. Elshaer and H. Awad Computers & Industrial Engineering 140 (2020) 106242

Dynamic VRP (DVRP), VRP with Loading Constraints (VRPLC), Table 1

Generalized VRP (GVRP), Multi Trip VRP (MT-VRP), Truck and Overview of the number of selected articles per journal.
Trailer routing problem (TTRP), Multi-compartment VRP (MC- Journals 2015 impact Number of
VRP), Fuzzy VRP and Site-dependent VRP (SD-VRP) (Lin, Choy, factor (IF) selected articles
Ho, Chung, & Lam, 2014).
Journal of Cleaner Production 4.959 1
Journal of Hazardous Materials 4.836 1
Omega: The International Journal of 3.962 3
3. Metaheuristics Management Science
Transportation Research Part B: 3.769 2
Metaheuristics are widely recognized as efficient approaches for Methodological
Information Sciences 3.364 6
many hard optimization problems (Boussaïd et al., 2013). As depicted
Transportation Science 3.295 11
in Fig. 1, metaheuristic algorithms can be mainly grouped into two Networks and Spatial Economics 3.25 2
categories: single solution-based and population-based. Transportation Research Part C: Emerging 3.075 8
Single-based heuristics are split into eight types (SA, TS, GRASP, Technologies
Expert Systems with Applications 2.981 46
VNS, GLS and ILS) (Blum & Roli, 2003; Boussaïd et al., 2013). In ad-
Swarm and Evolutionary Computation 2.963 4
dition, other two algorithms are the large neighborhood search (LNS) Applied Soft Computing 2.857 18
and The adaptive large neighborhood search (ALNS) heuristic (Pisinger International Journal of Production 2.782 3
& Ropke, 2010). Economics
On the other hand, we have 16 population-based methods: ten European Journal of Operational Research 2.679 54
Decision Support Systems 2.604 2
Evolutionary Computation (EC) (GA, ES, EP, GP, EDAs, DE, CoEA, CA,
Neurocomputing 2.392 1
SS and PR), and six Swarm intelligence (SI) (ACO, PSO, BFOA, BCO, AIS Engineering Applications of Artificial 2.368 3
and BBO). For details of each algorithm, we refer the reader to (Blum & Intelligence
Roli, 2003; Boussaïd et al., 2013). Also, we have more six metaheur- Applied Mathematical Modelling 2.291 3
istics. Namely, two EC algorithms: Memetic algorithm (MA) (Gendreau Transportation Research Part E: Logistics 2.279 22
and Transportation Review
& Potvin, 2010) and Electromagnetism-Like Algorithm (EMA) (Birbil & Computers & Industrial Engineering 2.086 29
Fang, 2003; Lin, Wu, & Chung, 2012) and four SI algorithms: Firefly Sensors 2.033 1
algorithm (FA), Cuckoo search (CS), Intelligent Water Drops Algorithm Computers & Operations Research 1.988 60
(IWD) and Shuffled Frog Leaping Algorithm (SFLA) (Binitha & Sathya, Manufacturing & Service Operations 1.966 1
Management
2012; Yang & Karamanoglu, 2013).
International Journal of Systems Science 1.947 1
Computers and Electronics in Agriculture 1.892 1
Transportation Research Part D: Transport 1.864 4
4. Survey methodology and Environment
Operations Research 1.777 1
Measurement 1.742 2
In this work we applied the same search strategy given in (Braekers Production and Operations Management 1.732 1
et al., 2016). Here, we extend it to include and focus on metaheuristic as Soft Computing 1.63 1
a solution methodology within articles published between 2009 and The International Journal of Advanced 1.568 1
2017 in journals with Impact Factors based on Thomson Reuters 2015. Manufacturing Technology
Journal of Computational and Applied 1.357 1
Mathematics
Journal of Heuristics 1.344 1
5. Review results Journal of the Operational Research 1.225 2
Society
The search strategy resulted in a final set of 299 articles which Networks 0.943 1
Discrete Applied Mathematics 0.722 1
contain the majority of recent works on metaheuristics for VRP. These
collected articles can be considered as representative for the field. Total 299

An overview of number of articles per year published between 2009

and 2017 is illustrated in Fig. 2. Appendix A provides a more detailed
5.1. VRP and its variants
overview of the selected references according to publication year.
Table 1 gives an overview of the number of selected articles per journal
The 299 articles are further classified based on the problem attri-
and shows that Computers & Operations Research, European Journal of
butes as shown in Table 2. This classification helps to identify trends of
Operational Research and Expert Systems with Applications published
VRP variants over all reviewed articles and the relative presence per
most of the surveyed articles.
publication year. The overall percentages of VRP attributes in the study
period are illustrated in Fig. 3 that signifies which VRP variants are
50 44 most and least active in research.
41 40 From the results, the majority of articles (98.91%) consider capa-
Number of Articles

40 36
31 citated vehicles. About 37.32% of the articles are considered time
29 28 28 windows. Most often (30.8%), these time windows are hard time win-
30
22 dows, while soft time windows have been considered as well (5.43%),
20 and a mix of soft and strict time windows is rare (1.09%). The PDP are
considered in 16.3% of the articles. The Heterogeneous VRP and its
10
variants are considered in 13.41% of the articles. The Multi depots are
0 considered in 9.42% of the articles. Other variants, such as multiple
2009 2010 2011 2012 2013 2014 2015 2016 2017 periods, split deliveries, stochastic demands, Green VRP, open VRP,
Year dynamic, time-dependent, loading constraints, stochastic travel VRPs
Fig. 2. Distribution of publications per year across the period of the study (299 are considered in 7.97, 5.43, 5.43, 5.43, 4.71, 3.99, 3.62, 3.62, 3.26%
papers). of the articles, respectively. Each of the rest variants are rarely

3
R. Elshaer and H. Awad Computers & Industrial Engineering 140 (2020) 106242

Table 2
Relative presences of VRP variants in reviewed articles.
VRP Variants Number of models Relative presence (%)

Overall 2009 2010 2011 2012 2013 2014 2015 2016 2017

Capacitated VRP 273 98.91 100.00 96.43 95.45 100.00 100.00 96.77 100.00 100.00 100.00
Time windows VRP 103 37.32 24.14 28.57 31.82 32.14 50.00 45.16 53.66 28.21 31.82
Pickup and Delivery Problem 45 16.30 27.59 14.29 4.55 14.29 19.44 9.68 26.83 15.38 4.55
Heterogeneous VRP 37 13.41 20.69 10.71 9.09 14.29 19.44 12.90 9.76 15.38 4.55
Multiple depots VRP 26 9.42 0.00 0.00 18.18 10.71 13.89 16.13 7.32 12.82 4.55
Periodic VRP 22 7.97 6.90 10.71 9.09 10.71 8.33 9.68 9.76 5.13 0.00
Split Delivery VRP 15 5.43 3.45 7.14 9.09 0.00 13.89 3.23 4.88 5.13 0.00
Stochastic demands VRP 15 5.43 0.00 7.14 4.55 10.71 2.78 9.68 4.88 7.69 0.00
Green VRP 15 5.43 3.45 3.57 0.00 3.57 8.33 9.68 2.44 7.69 9.09
Open VRP 13 4.71 3.45 7.14 9.09 10.71 2.78 6.45 2.44 2.56 0.00
Dynamic VRP 11 3.99 3.45 3.57 4.55 3.57 5.56 0.00 4.88 5.13 4.55
Time-dependent VRP 10 3.62 3.45 3.57 4.55 7.14 0.00 3.23 0.00 7.69 4.55
VRP with Loading Constraint 10 3.62 0.00 3.57 0.00 3.57 2.78 0.00 4.88 10.26 4.55
Stochastic travel times VRP 9 3.26 0.00 3.57 0.00 3.57 5.56 3.23 2.44 5.13 4.55
Truck and Trailer routing problem 5 1.81 3.45 0.00 4.55 0.00 5.56 0.00 0.00 0.00 4.55
Generalized VRP 5 1.81 0.00 0.00 4.55 0.00 2.78 3.23 4.88 0.00 0.00
Multi Trip VRP 5 1.81 0.00 0.00 0.00 0.00 2.78 9.68 0.00 0.00 4.55
Multi-compartment VRP 4 1.45 0.00 3.57 0.00 0.00 0.00 0.00 4.88 0.00 4.55
Fuzzy VRP 3 1.09 0.00 3.57 0.00 0.00 0.00 3.23 0.00 0.00 4.55
Site Dependent VRP 3 1.09 0.00 0.00 0.00 3.57 2.78 0.00 2.44 0.00 0.00

corresponding references in Tables 11–14. GA and MA, PR, SS, DE,

CoEA, EMA and ES, ACO and its variants, PSO, ABC, BBMO, SFLA, BBO,
98.9
Attribute Presence (%)

GSO, CS, IWD and FA are shown in Tables 11–14, respectively. The
tables are compiled in Table 15 in which the frequent usage of each
37.3

algorithm is shown. The table shows that the EC and SI represent 57.1
16.3

13.4

and 42.9% respectively. The results of relative presence of EC algo-

9.4

7.9

5.4
5.4

5.4

4.7

3.9

3.6

3.6

3.2

1.8

1.8

1.8

1.4

1.1

1.1

rithms are illustrated in Fig. 5, while the relative presences of SI algo-

rithms are shown in Fig. 6. In addition, Table 15 gives a general
overview of population-based metaheuristics and percentages per
publication year.
It is clear from the results that, for EC algorithms, the GA is used
Fig. 3. Overall percentage of VRP attributes in the reviewed articles. most often; MA is applied less often; PR, SS, DE, CoEA, EMA and ES are
rarely used; and EP, GP, EDAs, CA are not used. Regarding SI algo-
rithms, ACO and PSO are used most often; ABC, BBMO, SFLA, BBO,
considered (less than 2%) as shown in Table 2. GSO, CS, IWD and FA are rarely used; and BFOA and AIS are not used.

5.2. Metaheuristics for VRP and its variants 6. Conclusion

By scanning the 299 articles, we found the total number of different As an extension to the VRP classification and survey of (Braekers
metaheuristic methods equals 386. From these use-cases, a total of 246 et al., 2016), this paper presents a taxonomic review of the metaheur-
(63.7%) were single-based and the rest were population-based. More istics used for solving the VRP problem and its variants in literature
details of these results are presented in the following sections. published between 2009 and 2017. From the application of our survey
methodology, we selected a total of 299 articles which are further
5.2.1. The single solution-based metaheuristics classified. We found 386 use-cases of different metaheuristic algorithms
The results of the single solution-based metaheuristics, TS, VNS, in the reviewed articles. The single solution- and population-based al-
LNS, SA, ILS, GRASP and GLS algorithms, are shown in Tables 3–9 gorithms represent 63.7 and 36.3% respectively.
respectively. Each table shows the algorithm (or its variant) used, the The resulting classification tables show that the algorithms are very
considered VRP variant(s), and the corresponding reference. The seven diverse and have moved into the spotlight in the recent years as viable
tables are compiled in Table 10 to show the trends of single solution- approaches for solving many types of VRP problems. The result analysis
based metaheuristics over all reviewed articles and also the relative indicates that the trends of single solution-based metaheuristics are as
presence per publication year. The results indicate that the TS and VNS follows: the TS and VNS are used most often; LNS, SA, ILS and GRASP
are used most often (more than 20%); LNS, SA, ILS and GRASP are are applied less often; and GLS are rarely used. Also, the research trends
applied less often (16–8%); and GLS is rarely used (1.2%). The relative in the population-based metaheuristics are as follows: for EC, the GA is
presences of single solution-based metaheuristics are shown in Fig. 4. used most often; MA are applied less often; PR, SS, DE, CoEA, EMA and
ES are rarely used; and EP, GP, EDAs, CA are not used, and for SI, ACO
5.2.2. Population-based metaheuristics and PSO are used most often; ABC, BBMO, SFLA, BBO, GSO, CS, IWD
From the 386 different use-cases of metaheuristic methods, we and FA are rarely used; and BFOA and AIS are not used.
found 140 of them utilize population-based metaheuristics. They are We see that future research could therefore be focus on applying the
classified based on the algorithm used, the VRP variant and the rarely used algorithms to other problem variants to explore their

4
R. Elshaer and H. Awad Computers & Industrial Engineering 140 (2020) 106242

Table 3
TS algorithms for solving VRP variants in the reviewed articles.
VRP variant Reference

Basic TS VRPSPD (Zachariadis et al., 2009)

CVRP (Cordeau & Maischberger, 2012; Ehmke et al., 2016; Janssens et al., 2015; Jin et al., 2012; Jin
et al., 2014; Lin, Lee, Ying, & Lee, 2009; Seyyedhasani & Dvorak, 2017)
Fleet size and mix VRP (FSMVRP) (Jose, 2009)
VRP with pickups and deliveries (VRPPD) (Hoff et al., 2009)
TDVRP (Jabali et al., 2012; Kuo et al., 2009)
VRP for end-of-life goods (Kim et al., 2009)
DVRP (Liao & Hu, 2011; Moretti Branchini et al., 2009)
VRPTW (Cordeau & Maischberger, 2012; Maden et al., 2010; Schneider et al., 2013; Yassen et al.,
2017; Yu, Yang, & Yao, 2011)
VRPTW, driver rest period and multiple disposal facilities (Benjamin & Beasley, 2010)
SDVRP with Production and Demand Calendars (SDVRPPDC) (Bolduc et al., 2010)
VRPSD and duration constraints (VRPSD-DC) (Erera et al., 2010)
VRPTW and stochastic travel and service times (VRPTW-STS) (Li et al., 2010)
Multi-shift VRP with overtime (Ren et al., 2010)
Dynamic multi-period VRP (DMPVRP) (Wen et al., 2010)
Selective MDVRP with pricing (SMDVRPP) (Aras et al., 2011)
Heterogeneous fixed fleet VRP (HFFVRP) (Brandão, 2011)
SDVRP and time windows (SDVRPTW) (Archetti et al., 2011)
OVRP (Yu et al., 2011)
MDVRP, SD-VRP, Period VRPTW (PVRPTW), Multi Depot VRPTW (Cordeau & Maischberger, 2012)
(MDVRPTW), Site-dependent VRPTW (SD-VRPTW)
PVRP (Cordeau & Maischberger, 2012; Dayarian et al., 2015)
Consistent VRP (ConVRP) (Tarantilis et al., 2012)
VRPTW and link capacity constraints (VRPTWLC) (Ma et al., 2012)
VRPTW and multiple deliverymen (VRPTWMD) (Pureza et al., 2012)
Dynamic VRPSTW (DVRPSTW) (Ferrucci et al., 2013)
Stochastic VRPSTW under travel and service time uncertainties (Zhang, Lam, & Chen, 2013)
(SVRPSTW-STS)
VRPSPD with time windows (VRPSPDTW) (Liu et al., 2013)
Heterogeneous fixed fleet vehicle routing considering carbon (Kwon et al., 2013)
emission (C-HFFVRP)
VRPSTW and stochastic travel times (VRPSTW-ST) (Taş et al., 2013)
Two interconnected VRP (2-VRP) (Kergosien et al., 2013)
Time-dependent Multi-zone Multi-trip VRPTW (TMZT-VRPTW) (Nguyen et al., 2013)
VRP with multiple time windows (VRPMTW) (Belhaiza et al., 2014; Rancourt et al., 2013)
VRPSD (Gauvin et al., 2014)
Distance-constrained CVRP (DCVRP) (Krichen et al., 2014)
Time-dependent VRPSTW-ST (TDVRPSTW-ST) (Taş, Dellaert, van Woensel, & de Kok, 2014)
VRP with a heterogeneous fleet and time windows (HVRPTW) (Jiang et al., 2014)
VRP with Flexible Time Windows (VRPFlexTW) (Taş, Jabali, et al., 2014)
VRP with multiple overlapped batches (VRPMOB) (Yu & Qi, 2014)
Electric VRPTW and recharging stations (E-VRPTW) (Schneider et al., 2014)
Site-Dependent VRPSTW (SD-VRPSTW) (Zare-Reisabadi & Hamid Mirmohammadi, 2015)
VRP with Fuel Consumption and Carbon Emission (Zhang et al., 2015)
VRPDDP (Nagy et al., 2015)
VRPB with time windows (VRPBTW) (Küçükoğlu & Öztürk, 2015)
Heterogeneous multi-type fleet VRPTW and an incompatible loading (Wang, Li, & Hu, 2015)
constraint (HVRPTW-ILC)
Multi-period VRPTW and limited visiting quota (MVRPTW-LVQ) (Luo et al., 2015)
Discrete time window assignment vehicle routing problem (Spliet & Desaulniers, 2015)
(DTWAVRP)
VRP with time-varying speeds (Qian & Eglese, 2016)
VRP with Occasional Drivers (VRPOD) (Archetti et al., 2016)
VRPTW and driver specific times (VRPTWDST) (Schneider, 2016)
Heterogeneous VRP on a multigraph (HVRP-MG) (Lai et al., 2016)
Heterogeneous VRP with simultaneous pickup and delivery (Avci & Topaloglu, 2016)
(HVRPSPD)
Pollution-Routing Problem (PRP) (Suzuki, 2016)
VRPTW with stochastic demand (VRPTWSD) (Nguyen et al., 2016)
VRPTW with stochastic travel times (VRPTWST) (Nguyen et al., 2016)
Rich VRP (Sicilia et al., 2016)
MC-VRP (Silvestrin & Ritt, 2017)
VRPTW and pallet loading constraints (VRPTWP) (Zhang et al., 2017)
Multi-Depot Open Vehicle Routing Problem (MDOVRP) (Soto et al., 2017)
Multi vehicle selective pickup and delivery problem (MVSPDP) (Ting et al., 2017)
Selective Assessment Routing Problem (SARP) (Balcik, 2017)
An unpaired pickup and delivery VRP (UPDPVRP) (Xu et al., 2017)

AM* VRPSPD (Zachariadis et al., 2010)

Fleet Size and Mix VRPTW (FSMVRPTW) (Repoussis & Tarantilis, 2010)
HFFVRP (Li et al., 2010)
Heterogeneous fixed fleet OVRP (HFFOVRP) (Li et al., 2012)

* AM: TS with Adaptive Memory.

5
R. Elshaer and H. Awad Computers & Industrial Engineering 140 (2020) 106242

Table 4
VNS algorithms for solving VRP variants in the reviewed articles.
VRP variant Reference

VNS HFVRP (Imran et al., 2009)

OVRP (Fleszar et al., 2009; Şevkli & Güler, 2017)
PVRP (Hemmelmayr et al., 2009)
VRPTW, driver rest period and multiple disposal facilities (Benjamin & Beasley, 2010)
DMPVRP (Wen et al., 2010)
TTRP (Villegas et al., 2011)
VRP with precedence and loading constraints (Felipe et al., 2011)
MDVRP with loading cost (MDVRPLC) (Kuo & Wang, 2012)
DVRP (Khouadjia et al., 2012)
MDVRP with Private fleet and Common carriers (MDVRPPC) (Stenger et al., 2013)
Dynamic Multiperiod VRP with Probabilistic Information (DVRPP) (Albareda-Sambola et al., 2014)
Unpaired Pickup and Delivery VRP with Split Loads (UPDVRPSL) (Chen et al., 2014)
MDVRP with heterogeneous vehicle fleet (MDHVRP) (Salhi et al., 2014)
VRPMTW (Belhaiza et al., 2014)
E-VRPTW (Schneider et al., 2014)
Dynamic closed-loop VRP with uncertain pickup and Deterministic delivery (VRPUPDD) (Hu et al., 2015)
CVRP with two-dimensional loading constraints (2L-CVRP) (Wei et al., 2015)
Multi-compartment VRP with flexible compartment sizes (MCVRP-FCS) (Henke et al., 2015)
VRPSPD with time limit (VRPSPDTL) (Polat et al., 2015)
Dynamic Rich VRPTW (DRVRPTW) (de Armas & Melián-Batista, 2015)
Close–Open VRPTW (COVRPTW) (Brito et al., 2015)
CVRP (Bouzid et al., 2017; Janssens et al., 2015; Sze et al., 2016)
VRPSPD (Kalayci & Kaya, 2016; Marinakis & Marinaki, 2015)
VRPOD (Archetti et al., 2016)
Customer-centric, Multi-commodity VRP with Split Delivery (CMVRPSD) (Moshref-Javadi & Lee, 2016)
prize-collecting VRP (PCVRP) (Li & Tian, 2016)
Rich VRP (Sicilia et al., 2016)
Multiple Trip VRPB (MT-VRPB) (Wassan et al., 2017)
Swap-Body VRP (SBVRP) (Huber & Geiger, 2017; Todosijević et al., 2017)
Vehicle routing with private fleet, multiple common carriers offering volume discounts, and rental options (Gahm et al., 2017)
(VRPPCdR)
HFVRP of hazardous materials transportation (HFVRP-HazMat) (Bula et al., 2017)
Clustered CVRP (CluVRP) (Defryn & Sörensen, 2017)
A resource allocation supply chain scheduling and VRP (Hassanzadeh & Rasti-Barzoki, 2017)
Cumulative CVRP (CCVRP) (Sze et al., 2017)
VRPDDP (Polat, 2017)
A manpower allocation and VRP (MAVRP) (Zhang et al., 2017)
A multi-depot green VRP (MDGVRP) (Jabir et al., 2017)

VND* CVRP (Chen et al., 2010; Sörensen & Schittekat, 2013)

VRPSPD (Avci & Topaloglu, 2015; Goksal et al., 2013)
VRPMB (Avci & Topaloglu, 2015)
SDVRP with minimum delivery amounts (SDVRP-MDA) (Han & Chu, 2016)
Rich VRP (Sicilia et al., 2016)
Risk constrained Cash-in-Transit VRP (Rctvrp) (Talarico et al., 2017)
Electric VRP (E-VRP) (Montoya et al., 2017)

RVND* VRPSPD (Subramanian et al., 2010; Subramanian et al., 2013)

HFVRP (Penna et al., 2013; Subramanian et al., 2012)
CVRP, Asymmetric CVRP (ACVRP), OVRP, VRPMB, MDVRP, MDVRP with Mixed Pickup and Delivery (Subramanian et al., 2013)
(MDVRPMB)
SDVRP (Silva et al., 2015)
VRPPCdR (Gahm et al., 2017)

* VND: variable neighborhood descent; RVND: variable neighborhood descent procedure with a random neighborhood ordering.

6
R. Elshaer and H. Awad Computers & Industrial Engineering 140 (2020) 106242

Table 5
LNS algorithms for solving VRP variants in the reviewed articles.
VRP variant Reference

LNS VRPTW (Goel, 2009; Hong, 2012; Prescott-Gagnon et al., 2009)

VRPTW and driver regulations (VRPTWDR) (Prescott-Gagnon et al., 2010)
GVRP (Bektas et al., 2011)
Rollon–rolloff VRP (RRVRP) (Derigs, Pullmann, & Vogel, 2013a; Wy & Kim, 2013)
TTRP with Time Windows (TTRPTW) (Derigs, Pullmann, & Vogel, 2013b)
Rollon–Rolloff VRPTW (RR-VRPTW) (Wy et al., 2013)
Generalized consistent VRP (GenConVRP) (Kovacs et al., 2015)
VRP with Pickup and Delivery and Three-dimensional Loading Constraint (3L-PDP) (Männel & Bortfeldt, 2016)
CVRP (Akpinar, 2016; Sze et al., 2016)
The two-dimensional loading VRPB (2L-VRPB) (Dominguez et al., 2016)
Rctvrp (Talarico et al., 2017)
VRPTWMD (Alvarez & Munari, 2017)
G-VRP (Mancini, 2017)
VRP with uncertain travel time (VRPSTT) (Wu et al., 2017)
Time window assignment VRP (TWAVRP) (Bruck et al., 2017)
CCVRP (Sze et al., 2017)
Time-Dependent VRPTW (TDVRPTW) (Ma et al., 2017)

ALNS CVRP with stochastic demands and time windows (CVRPSDTW) (Lei et al., 2011)
PRP (Demir, Bektaş, & Laporte, 2012, 2014)
CCVRP (Mattos Ribeiro & Laporte, 2012)
TDVRPSTW-ST (Taş, Dellaert, et al., 2014)
VRPMTW (Azi et al., 2014)
Heterogeneous Fleet VRPTW (HFVRPTW) (Koç et al., 2015)
Multi Depot Multi Period VRP with a Heterogeneous Fleet (MDMPVRPHF) (Mancini, 2016)
Electric Fleet Size and Mix VRPTW and Recharging Stations (E-FSMFTW) (Hiermann et al., 2016)
Electric VRPTW and Partial Recharges (EVRPTW-PR) (Keskin & Çatay, 2016)
VRPSD and weight related cost (VRPSDW) (Luo et al., 2016)
MPVRP with Seasonal Fluctuations (MPVRPSF) (Dayarian et al., 2016)
Time-Dependent Pollution-Routing Problem (TDPRP) (Franceschetti et al., 2017)
CVRP (Erdoğan, 2017)
TTRPTW (Parragh & Cordeau, 2017)
VRPTW-ST (Braaten et al., 2017)

VLSN VRPSTW (Mouthuy et al., 2015)

Table 6
SA algorithms for solving VRP variants in the reviewed articles.
VRP variant Reference

SA CVRP (Fleming et al., 2013; Lin, Lee, et al., 2009)

TTRP (Lin, Yu, & Chou, 2009)
TDVRP (Kuo, 2010)
VRPSD (Goodson et al., 2012)
VRPTW with overtime and outsourcing vehicles (VRPTWOV) (Moon et al., 2012)
HFVRP with two-dimensional loading constraints (2L-HFVRP) (Leung et al., 2013)
VRPTW (Baños et al., 2016; Baños, Ortega, Gil, Fernández, & De Toro, 2013; Baños, Ortega, Gil, Márquez, &
De Toro, 2013; Yassen et al., 2017)
Green VRP with Multiple Technologies and Partial Recharges (Felipe et al., 2014)
(G-VRP-MTPR)
VRPSPDTW (Wang et al., 2015)
Multi-Depot Covering Tour VRP (MDCTVRP) (Allahyari et al., 2015)
VRPBTW (Küçükoğlu & Öztürk, 2015)
CMVRPSD (Moshref-Javadi & Lee, 2016)
G-VRP (Koç & Karaoglan, 2016; Yu et al., 2017)
PRP (Suzuki, 2016)
MDVRP (Du et al., 2017)

SA-TA FSMVRPTW (Bräysy et al., 2009)

VRPSPD (Avci & Topaloglu, 2015)
HVRPSPD (Avci & Topaloglu, 2016)

BVDH* MDVRP (Tu et al., 2014)

RRT-SA* ConVRP (Groër et al., 2009)

SDVRP-MDA (Gulczynski et al., 2010)
PVRP (Gulczynski et al., 2011b)
Multi-Depot SDVRP (MDSDVRP) (Gulczynski, Golden, & Wasil, 2011a)
CluVRP (Expósito-Izquierdo et al., 2016)
VRPTW (Yassen et al., 2017)

* BVDH: Bi-Level Voronoi Diagram-based SA; RRT-SA: Record-to-Record travel SA.

7
R. Elshaer and H. Awad Computers & Industrial Engineering 140 (2020) 106242

Table 7
ILS algorithms for solving VRP variants in the reviewed articles.
VRP variants Reference

ILS VRPSPD (Subramanian et al., 2010; Subramanian et al., 2013)

CVRP (Chen et al., 2010; Cordeau & Maischberger, 2012; Subramanian et al., 2013; Uchoa et al., 2017)
HFVRP (Penna et al., 2013; Subramanian et al., 2012)
SD-VRP (Cordeau & Maischberger, 2012)
MDVRP (Cordeau & Maischberger, 2012; Subramanian et al., 2013)
PVRP (Cacchiani et al., 2014; Cordeau & Maischberger, 2012)
PVRPTW, MDVRPTW, SD-VRPTW (Cordeau & Maischberger, 2012)
ACVRP, OVRP, VRPMB, MDVRPMB (Subramanian et al., 2013)
TTRP (Villegas et al., 2013)
VRPB (Palhazi Cuervo et al., 2014)
PVRP with time spread constraints on services (PVRPTS) (Michallet et al., 2014)
Multi-Commodity Multi-Trip VRPTW (MMTVRPTW) (Cattaruzza et al., 2014)
Multi-Depot Vehicle Fleet Mix Problem (MDVFMP) (Vidal, Crainic, Gendreau, & Prins, 2014)
MDVRP with simultaneous deliveries and pickups (MDVRPSPD) (Li et al., 2015)
RVRP (Solano-Charris et al., 2015)
MDCTVRP (Allahyari et al., 2015)
SDVRP (Silva et al., 2015)
CluVRP (Vidal et al., 2015)
PRP (Kramer et al., 2015)
VRPHTW and Stochastic Travel and Service time (VRPHTW-STS) (Miranda & Conceição, 2016)
VRPTW-SP (Ait Haddadene et al., 2016)
MC-VRP (Silvestrin & Ritt, 2017)
VRPTWMD (Alvarez & Munari, 2017)
Electric VRP (E-VRP) (Montoya et al., 2017)

Table 8
GRASP algorithms for solving VRP variants in the reviewed articles.
VRP variant Reference

GRASP VRPB, VRPMB (Yazgi Tütüncü et al., 2009)

CVRP (Marinakis, 2012; Marinakis & Marinaki, 2010; Marinakis et al., 2010; Sörensen & Schittekat,
2013)
Heterogeneous fixed fleet VRPB (HFFVRPB) (Tütüncü, 2010)
Selective VRP (SVRP) (Valle et al., 2011)
HFVRP (Duhamel et al., 2012)
TTRP (Villegas et al., 2011, 2013)
GVRP with flexible fleet size (Hà et al., 2014)
Robust VRP (RVRP) (Solano-Charris et al., 2015)
MDCTVRP (Allahyari et al., 2015)
COVRPTW (Brito et al., 2015)
VRPTW, synchronization and precedence constraints (VRPTW-SP) (Ait Haddadene et al., 2016)
selective pickup and delivery problem (SPDP) (Ho & Szeto, 2016)

MPNS-GRASP* CVRP (Marinakis, 2012; Marinakis & Marinaki, 2010; Marinakis et al., 2010)

ENS* CVRP (Marinakis & Marinaki, 2010; Marinakis et al., 2010)

* MPNS-GRASP: Multiple Phase Neighborhood Search—GRASP; ENS: Expanding Neighborhood Search.

Table 9
GLS algorithms for solving VRP variants in the reviewed articles.
VRP variant Reference

GLS VRPSPD (Zachariadis et al., 2009)

FSMVRPTW (Bräysy et al., 2009)
MC-VRP (Muyldermans & Pang, 2010)

Table 10
Relative presences of single solution-based metaheuristics in the study period.
Single-solution based metaheuristics Number of models Relative presence (%)

Overall 2009 2010 2011 2012 2013 2014 2015 2016 2017

TS 74 30.1 36.8 37.0 42.9 35.0 33.3 34.6 25.7 25.0 19.0
VNS 56 22.8 15.8 15.0 14.3 15.0 18.5 19.2 28.6 22.2 38.0
LNS 38 15.4 10.5 3.70 14.3 15.0 14.8 11.5 8.57 25.0 26.0
SA 30 12.2 21.1 7.40 14.3 10.0 14.8 11.5 11.4 16.7 7.10
ILS 24 9.76 0.00 7.40 0.00 10.0 11.1 19.2 17.1 5.56 9.50
GRASP 21 8.54 5.26 26.0 14.3 15.0 7.41 3.85 8.57 5.56 0.00
GLS 3 1.22 10.5 3.70 0.00 0.00 0.00 0.00 0.00 0.00 0.00

8
R. Elshaer and H. Awad Computers & Industrial Engineering 140 (2020) 106242

35
30.1

Presentage of occurance (%)

30
25 22.8

20 15.4
15 12.2
9.8 8.5
10
5 1.2
0
TS VNS LNS SA ILS GRASP GLS

Fig. 4. Overall percentage of single solution-based metaheuristics in the reviewed articles.

Table 11
GA and MA algorithms for solving VRP variants in the reviewed articles.
VRP variant Reference

GA CVRP (Marinakis & Marinaki, 2010; Nazif & Lee, 2012; Osaba et al., 2013; Uchoa et al., 2017; Wang & Lu,
2009)
VRPTW (Baños, Ortega, Gil, Márquez, et al., 2013; Cheng & Wang, 2009; Chiang & Hsu, 2014; Garcia-
Najera & Bullinaria, 2011; Ghoseiri & Ghannadpour, 2010; Pierre & Zakaria, 2017; Qi et al., 2012)
FSMVRP (Liu et al., 2009)
VRPSPDTW (Karlaftis et al., 2009; Liu et al., 2013)
VRP with route balancing (VRPRB) (Jozefowiez et al., 2009)
MDVRP (Du et al., 2017; Vidal et al., 2012; Yücenur & Demirel, 2011)
OVRP (Yu et al., 2011)
VRPSPD (Tasan & Gen, 2012)
pickup and delivery VRPSTW (PDVRPSTW) (Lu & Yu, 2012)
VRP with forced backhauls (VRPFB) (Anbuudayasankar et al., 2012)
stochastic travel-time VRPSPD (STT-VRPSPD) (Zhang et al., 2012)
VRPTWOV (Moon et al., 2012)
PVRP, Multi-Depot periodic VRP (MDPVRP) (Vidal et al., 2012)
GVRP (Pop et al., 2013)
Dynamic VRPTW (DVRPTW) (Barkaoui et al., 2015; Barkaoui & Gendreau, 2013)
2-VRP (Kergosien et al., 2013)
MDVRPTW, PVRPTW, SD-VRPTW (Vidal et al., 2013)
Fuzzy selective VRPTW (FSVRPTW), Reliable selective VRP (RSVRP), (Allahviranloo et al., 2014)
Robust (mean–variance) selective VRP (MVSVRP)
MDVFMP (Vidal et al., 2014)
VRPTW with Perishability (VRPTW-P) (Amorim & Almada-Lobo, 2014)
VRP with Multiple Prioritized Time Windows (VRPMPTW) (Beheshti et al., 2015)
CluVRP (Vidal et al., 2015)
HFVRPTW (Koç et al., 2015)
VRPB (García-Nájera et al., 2015)
MDVRPTW with Delivery and Installation Vehicles (Bae & Moon, 2016)
2L-CVRP, CVRP with three-dimensional loading constraints (3L- (Hokama et al., 2016)
CVRP)
VRPTW and Fuzzy Demand (VRPTWFD) (Shi et al., 2017)
DVRP (AbdAllah et al., 2017)
Time-dependent vehicle routing&scheduling problem with (Xiao & Konak, 2017)
Co2 emissions optimization (TD-VRSP-CO2 )
A resource allocation supply chain scheduling and VRP (Hassanzadeh & Rasti-Barzoki, 2017)
MVSPDP (Ting et al., 2017)
Multi-vehicle multi-covering tour problem (mm-CTP) (Pham et al., 2017)

MA HFVRP (Liu, 2013; Prins, 2009)

DCVRP (Mendoza et al., 2009)
Multi-compartment VRPSD (MC-VRPSD) (Mendoza et al., 2010)
VRPTW (Nagata et al., 2010; Qi et al., 2015)
CCVRP (Ngueveu et al., 2010)
Close–Open Mixed VRP (COMVRP) (Liu & Jiang, 2012)
VRPSD (Chen et al., 2012)
multi-period VRP with profit (mVRPP) (Zhang et al., 2013)
VRP with Arc Time Windows (VRP_ATWs) (Çetinkaya et al., 2013)
Multi Trip VRP (MTVRP) (Cattaruzza et al., 2014)
VRP with Dynamic Requests (VRPDR) (Mańdziuk & Żychowski, 2016)

9
R. Elshaer and H. Awad Computers & Industrial Engineering 140 (2020) 106242

Table 12
PR, SS, DE, CoEA, EMA and ES algorithms for solving VRP variants in the reviewed articles.
VRP variants Reference

PR CVRP (Marinakis et al., 2010; Sörensen & Schittekat, 2013)

HFFVRP (Li et al., 2010)
TTRP (Villegas et al., 2011)
VRPSD (Marinakis et al., 2013)
VRP with clustered backhauls and time windows (VRPCBTW), VRP with mixed backhauls and time windows (Tarantilis et al., 2013)
(VRPMBTW)
SPDP (Ho & Szeto, 2016)

SS HFVRPTW and split deliveries (HFVRPTWSD) (Belfiore & Yoshida Yoshizaki, 2009)
VRP with loading cost (VRPLC) (Tang et al., 2010)
STT-VRPSPD (Zhang et al., 2012)
FSMVRPTW and Split Deliveries (FSMVRPTWSD) (Belfiore & Yoshizaki, 2013)
VRPBTW (Pradenas et al., 2013)
MVSPDP (Ting et al., 2017)

DE OVRP with fuzzy demands (OVRPFD) (Cao & Lai, 2010)

Robust OVRP (ROVRP) (Cao et al., 2014)

CoEA MDVRP (Bernardes de Oliveira et al., 2016; de Oliveira et al.,

2016)

EMA CVRP (Yurtkuran & Emel, 2010)

VRP with general soft time window (VRPGSTW) (Kourank Beheshti & Hejazi, 2015)

ES OVRP (Repoussis et al., 2010)

Table 13
ACO algorithms for solving VRP variants in the reviewed articles.
VRP variant Reference

ACO CVRP (Akpinar, 2016; Fleming et al., 2013; Yu et al., 2009)

VRPSPD (Çatay, 2010)
VRPTW (Yu et al., 2011)
TDVRPTW (Balseiro et al., 2011; Ma et al., 2017)
PVRPTW (Yu & Yang, 2011)
vehicle routing using Google Maps (Santos et al., 2011)
MDVRP (Du et al., 2017; Venkata Narasimha et al., 2013; Yu, Yang, & Xie, 2011)
VRPTWMD (Pureza et al., 2012)
SD-VRPSTW (Zare-Reisabadi & Hamid Mirmohammadi, 2015)
MC-VRP (Abdulkader et al., 2015)
COVRPTW (Brito et al., 2015)
DVRP (Euchi et al., 2015)
RCTVRP (Talarico et al., 2017)
A rich VRP with mixed fleet, mixed demand (Yakıcı, 2017)
MDGVRP (Jabir et al., 2017)

MMAS* split-delivery weighted VRP (SDWVRP) (Tang et al., 2013)

SDVRPTW (McNabb et al., 2015)

ACS* VRPB (Gajpal & Abad, 2009b)

VRPSPD (Gajpal & Abad, 2009a; Kalayci & Kaya, 2016)
VRP with heterogeneous fleet, mixed backhauls, and time windows (HVRPMBTW) (Wu et al., 2016)
DVRP (Kuo et al., 2016)
A bi-objective time, load and path-dependent VRPTW (BTL-VRPTW) (Androutsopoulos & Zografos, 2017)

* MMAS: Max-Min Ant System; ACS: Ant Colony System.

10
R. Elshaer and H. Awad Computers & Industrial Engineering 140 (2020) 106242

Table 14
PSO, ABC, BBMO, SFLA, BBO, GSO, CS, IWD and FA algorithms for solving VRP variants in the reviewed articles.
VRP variant Reference

PSO VRPSPD (Ai & Kachitvichyanukul, 2009a; Goksal et al., 2013)

CVRP (Ai & Kachitvichyanukul, 2009b; Marinakis &
Marinaki, 2010; Marinakis et al., 2010)
OVRP (Mirhassani & Abolghasemi, 2011)
VRPSTW (Xu et al., 2011)
VRPSD (Marinakis et al., 2013; Moghaddam et al., 2012)
DVRP (Khouadjia et al., 2012; Okulewicz & Mańdziuk,
2017)
OVRP with competitive time windows (OVRPCTW) (Norouzi et al., 2012)
Generalized multi-depot VRP with multiple pickup (Kachitvichyanukul et al., 2015)
and delivery requests (GVRP-MDMPDR)
VRPTW (Xu et al., 2015)
PVRPTW (Norouzi et al., 2015)
production and pollution routing problems with (Kumar et al., 2016)
time window (PPRP-TW)
Open TDVRP (OTDVRP) (Naderipour & Alinaghian, 2016)
MDVRP (Du et al., 2017)

ABC* CVRP (Szeto et al., 2011)

Environmental VRP (EVRP) (Zhang et al., 2014)
VRPSTW (Iqbal et al., 2015)
VRPTWP (Zhang et al., 2017)
Online VRP (O-VRP) (Ng et al., 2017)

BBMO* OVRP (Marinakis & Marinaki, 2014)

VRPSD (Marinakis & Marinaki, 2015)

SFLA MDVRP, MDVRPTW (Luo & Chen, 2014)

VRPTW (Luo, Li, Chen, & Liu, 2015)

BBO HVRPMBTW (Berghida & Boukra, 2015)

GSO VRPSD (Marinaki & Marinakis, 2016)

CS CVRP (Teymourian et al., 2016)

IWD CVRP (Teymourian et al., 2016)

FA TDVRP (Alinaghian & Naderipour, 2016)

* ABC: Artificial Bee Colony algorithm; BBMO: Bumble Bees Mating Optimization algorithm.

Table 15
Relative presences of population-based metaheuristics in the reviewed articles.
Population-based metaheuristics Number of models Relative presence (%)

Overall 2009 2010 2011 2012 2013 2014 2015 2016 2017

Evolutionary computation (58.1%) GA 46 58.0 62.5 18.0 75.0 73.0 46.7 66.7 66.7 33.3 90.0
MA 13 16.0 25.0 27.0 0.00 18.0 20.0 16.7 11.1 16.7 0.00
PR 8 10.0 0.00 18.0 25.0 0.00 20.0 0.00 11.1 16.7 0.00
SS 6 7.50 12.5 9.10 0.00 9.10 13.3 0.00 0.00 0.00 10.0
DE 2 2.50 0.00 9.10 0.00 0.00 0.00 16.7 0.00 0.00 0.00
CoEA 2 2.50 0.00 0.00 0.00 0.00 0.00 0.00 0.00 33.3 0.00
EMA 2 2.50 0.00 9.10 0.00 0.00 0.00 0.00 11.1 0.00 0.00
ES 1 1.30 0.00 9.10 0.00 0.00 0.00 0.00 0.00 0.00 0.00
EP 0 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
EA 0 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
GP 0 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
EDAs 0 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00

Swarm intelligence (41.9%) ACO 28 46.7 60.0 33.3 62.5 25.0 60.0 0.00 42.0 40.0 60.0
PSO 18 30.0 40.0 66.7 25.0 75.0 40.0 0.00 25.0 20.0 20.0
ABC 5 8.33 0.00 0.00 12.5 0.00 0.00 33.3 8.30 0.00 20.0
BBMO 2 3.33 0.00 0.00 0.00 0.00 0.00 33.3 8.30 0.00 0.00
SFLA 2 3.33 0.00 0.00 0.00 0.00 0.00 33.3 8.30 0.00 0.00
BBO 1 1.67 0.00 0.00 0.00 0.00 0.00 0.00 8.30 0.00 0.00
GSO 1 1.67 0.00 0.00 0.00 0.00 0.00 0.00 0.00 10.0 0.00
CS 1 1.67 0.00 0.00 0.00 0.00 0.00 0.00 0.00 10.0 0.00
IIWD 1 1.67 0.00 0.00 0.00 0.00 0.00 0.00 0.00 10.0 0.00
GFA 1 1.67 0.00 0.00 0.00 0.00 0.00 0.00 0.00 10.0 0.00
BFOA 0 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
AIS 0 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00

11
R. Elshaer and H. Awad Computers & Industrial Engineering 140 (2020) 106242

70

Percentage of occurance (%)

57.5
60

50

40

30

20 16.25
10
7.5
10 2.5 2.5 2.5 1.25
0 0 0 0 0
0
GA MA PR SS DE CoEA EMA ES EP EA GP EDAs CA

Fig. 5. Overall percentage of Evolutionary Computation & Swarm Intelligence algorithms in reviewed articles.

50 46.7
45
Percentage of occurance (%)

40
35 30
30
25
20
15
8.3
10
3.3 3.3 1.7 1.7 1.7 1.7 1.7
5 0 0
0
ACO PSO ABC BBMO SFLA BBO GSO CS IIWD GFA BFOA AIS

Fig. 6. Overall percentage of Evolutionary Computation & Swarm Intelligence algorithms in reviewed articles.

performance. The not-used algorithms are also good opportunities for Acknowledgement
future research. Finally, the resulting classification tables are very in-
formative for discovering opportunities for further research in both of This work has been done in the department of Industrial
metaheuristics and VRP problems. Work is on progress to consider the Engineering, Zagazig University and has no support fund from other
performance of used metaheuristics as a classification characteristic. organization.

Appendix A. . Overview of classified literature per year

Year of References Number Of articles

Publication per year

2017 (AbdAllah, Essam, & Sarker, 2017; Alvarez & Munari, 2017; Androutsopoulos & Zografos, 2017; Balcik, 2017; Bouzid et al., 2017; Braaten, 44
Gjønnes, Hvattum, & Tirado, 2017; Bruck, Cordeau, & Iori, 2017; Bula, Prodhon, Gonzalez, Afsar, & Velasco, 2017; Defryn & Sörensen, 2017;
Du, Li, Yu, Dan, & Zhou, 2017; Erdoğan, 2017; Franceschetti et al., 2017; Gahm, Brabänder, & Tuma, 2017; Hassanzadeh & Rasti-Barzoki,
2017; Huber & Geiger, 2017; Jabir, Panicker, & Sridharan, 2017; Ma, Wu, & Dai, 2017; Mancini, 2017; Montoya, Guéret, Mendoza, & Villegas,
2017; Ng, Lee, Zhang, Wu, & Ho, 2017; Okulewicz & Mańdziuk, 2017; Parragh & Cordeau, 2017; Pham, Hoàng Hà, & Nguyen, 2017; Pierre &
Zakaria, 2017; Polat, 2017; Şevkli & Güler, 2017; Seyyedhasani & Dvorak, 2017; Shi, Boudouh, & Grunder, 2017; Silvestrin & Ritt, 2017; Soto,
Sevaux, Rossi, & Reinholz, 2017; Sze, Salhi, & Wassan, 2017; Talarico, Springael, Sörensen, & Talarico, 2017; Ting, Liao, Huang, & Liaw,
2017; Todosijević, Hanafi, Urošević, Jarboui, & Gendron, 2017; Uchoa et al., 2017; Wassan et al., 2017; Wu, Hifi, & Bederina, 2017; Xiao &
Konak, 2017; Xu, Li, Zou, & Liu, 2017; Yakıcı, 2017; Yassen, Ayob, Nazri, & Sabar, 2017; Yu, Redi, Hidayat, & Wibowo, 2017; Zhang, Qin,
Wang, He, & Liu, 2017; Zhang et al., 2017)
2016 (Ait Haddadene, Labadie, & Prodhon, 2016; Akpinar, 2016; Alinaghian & Naderipour, 2016; Archetti, Savelsbergh, & Speranza, 2016; Avci & 40
Topaloglu, 2016; Bae & Moon, 2016; Baños, Ortega, Gil, De Toro, & Montoya, 2016; Bernardes de Oliveira et al., 2016; Dayarian, Crainic,
Gendreau, & Rei, 2016; de Oliveira et al., 2016; Dominguez et al., 2016; Ehmke, Campbell, & Thomas, 2016; Expósito-Izquierdo, Rossi, &
Sevaux, 2016; François, Arda, Crama, & Laporte, 2016; Han & Chu, 2016; Hiermann, Puchinger, Ropke, & Hartl, 2016; Ho & Szeto, 2016;
Hokama, Miyazawa, & Xavier, 2016; Kalayci & Kaya, 2016; Keskin & Çatay, 2016; Koç & Karaoglan, 2016; Kumar et al., 2016; Kuo, Wibowo,
& Zulvia, 2016; Lai et al., 2016; Li & Tian, 2016; Luo, Qin, Zhang, & Lim, 2016; Mancini, 2016; Mańdziuk & Żychowski, 2016; Marinaki &
Marinakis, 2016; Miranda & Conceição, 2016; Moshref-Javadi & Lee, 2016; Nguyen, Jiang, Ng, & Teo, 2016; Qian & Eglese, 2016; Schneider,
2016; Sicilia, Quemada, Royo, & Escuín, 2016; Suzuki, 2016; Sze, Salhi, & Wassan, 2016; Teymourian, Kayvanfar, Komaki, & Zandieh, 2016;
Wu et al., 2016)
2015 (Abdulkader, Gajpal, & ElMekkawy, 2015; Allahyari, Salari, & Vigo, 2015; Avci & Topaloglu, 2015; Barkaoui, Berger, & Boukhtouta, 2015; 41
Beheshti, Hejazi, & Alinaghian, 2015; Berghida & Boukra, 2015; Brito, Martínez, Moreno, & Verdegay, 2015; Dayarian, Crainic, Gendreau, &
Rei, 2015; de Armas & Melián-Batista, 2015; Euchi, Yassine, & Chabchoub, 2015; García-Nájera, Bullinaria, & Gutiérrez-Andrade, 2015;
Henke, Speranza, & Wäscher, 2015; Hu, Sheu, Zhao, & Lu, 2015; Iqbal et al., 2015; Janssens, Van den Bergh, Sörensen, & Cattrysse, 2015;
Kachitvichyanukul, Sombuntham, & Kunnapapdeelert, 2015; Koç, Bektaş, Jabali, & Laporte, 2015; Kourank Beheshti & Hejazi, 2015; Kovacs,
Parragh, & Hartl, 2015; Kramer, Subramanian, Vidal, & Cabral, 2015; Küçükoğlu & Öztürk, 2015; Li, Pardalos, Sun, Pei, & Zhang, 2015; Luo,
Qin, Che, & Lim, 2015; Luo et al., 2015; Marinakis & Marinaki, 2015; McNabb, Weir, Hill, & Hall, 2015; Mouthuy et al., 2015; Nagy et al.,
2015; Norouzi, Sadegh-Amalnick, & Alinaghiyan, 2015; Polat, Kalayci, Kulak, & Günther, 2015; Qi, Hou, Li, Huang, & Li, 2015; Silva et al.,
2015; Solano-Charris, Prins, & Santos, 2015; Spliet & Desaulniers, 2015; Vidal, Battarra, Subramanian, & Erdogˇan, 2015; Wang, Mu, Zhao, &
Sutherland, 2015; Wang et al., 2015; Wei, Zhang, Zhang, & Lim, 2015; Xu, Liu, Zhang, Wang, & Sun, 2015; Zare-Reisabadi & Hamid
Mirmohammadi, 2015; Zhang, Zhao, Xue, & Li, 2015)

12
R. Elshaer and H. Awad Computers & Industrial Engineering 140 (2020) 106242

2014 (Albareda-Sambola, Fernández, & Laporte, 2014; Allahviranloo, Chow, & Recker, 2014; Amorim & Almada-Lobo, 2014; Azi, Gendreau, & 31
Potvin, 2014; Belhaiza, Hansen, & Laporte, 2014; Cacchiani, Hemmelmayr, & Tricoire, 2014; Cao, Lai, & Yang, 2014; Cattaruzza, Absi, Feillet,
& Vidal, 2014; Cattaruzza, Absi, Feillet, & Vigo, 2014; Chen, Li, & Liu, 2014; Chiang & Hsu, 2014; Ćirović, Pamučar, & Božanić, 2014; Demir,
Bektaş, & Laporte, 2014; Felipe, Ortuño, Righini, & Tirado, 2014; Gauvin, Desaulniers, & Gendreau, 2014; Hà, Bostel, Langevin, & Rousseau,
2014; Jiang, Ng, Poh, & Teo, 2014; Jin, Crainic, & Løkketangen, 2014; Krichen, Faiz, Tlili, & Tej, 2014; Luo & Chen, 2014; Marinakis &
Marinaki, 2014; Michallet, Prins, Amodeo, Yalaoui, & Vitry, 2014; Palhazi Cuervo, Goos, Sörensen, & Arráiz, 2014; Salhi, Imran, & Wassan,
2014; Schneider, Stenger, & Goeke, 2014; Taş, Dellaert, et al., 2014; Taş, Jabali, et al., 2014; Tu, Fang, Li, Shaw, & Chen, 2014; Vidal et al.,
2015; Yu & Qi, 2014; Zhang, Lee, Choy, Ho, & Ip, 2014)
2013 (Baños, Ortega, Gil, Fernández, et al., 2013; Baños, Ortega, Gil, Márquez, et al., 2013; Barkaoui & Gendreau, 2013; Belfiore & Yoshizaki, 2013; 36
Çetinkaya, Karaoglan, & Gökçen, 2013; Derigs et al., 2013a, 2013b; Ferrucci, Bock, & Gendreau, 2013; Fleming, Griffis, & Bell, 2013; Goksal,
Karaoglan, & Altiparmak, 2013; Kergosien, Lenté, Billaut, & Perrin, 2013; Kwon, Choi, & Lee, 2013; Leung, Zhang, Zhang, Hua, & Lim, 2013;
Liu, Xie, Augusto, & Rodriguez, 2013; Liu, 2013; Marinakis, Iordanidou, & Marinaki, 2013; Nguyen, Crainic, & Toulouse, 2013; Osaba,
Carballedo, Diaz, & Perallos, 2013; Penna, Subramanian, & Ochi, 2013; Pop, Matei, & Sitar, 2013; Pradenas, Oportus, & Parada, 2013;
Rancourt, Cordeau, & Laporte, 2013; Schneider, Sand, & Stenger, 2013; Sörensen & Schittekat, 2013; Stenger, Vigo, Enz, & Schwind, 2013;
Subramanian, Uchoa, & Ochi, 2013; Tang, Ma, Guan, & Yan, 2013; Tarantilis et al., 2013; Taş, Dellaert, van Woensel, & de Kok, 2013; Venkata
Narasimha, Kivelevitch, Sharma, & Kumar, 2013; Vidal, Crainic, Gendreau, & Prins, 2013; Villegas, Prins, Prodhon, Medaglia, & Velasco,
2013; Wy & Kim, 2013; Wy, Kim, & Kim, 2013; Zhang, Che, Cheang, Lim, & Qin, 2013; Zhang et al., 2013)
2012 (Anbuudayasankar, Ganesh, Lenny Koh, & Ducq, 2012; Chen, Feng, & Soon Ong, 2012; Cordeau & Maischberger, 2012; Demir, Bektaş, & 28
Laporte, 2012; Duhamel, Lacomme, & Prodhon, 2012; Goodson, Ohlmann, & Thomas, 2012; Hong, 2012; Jabali, Van Woensel, & De Kok,
2012; Jin, Crainic, & Lokketangen, 2012; Khouadjia, Sarasola, Alba, Jourdan, & Talbi, 2012; Kuo & Wang, 2012; Li, Leung, & Tian, 2012; Liu
& Jiang, 2012; Lu & Yu, 2012; Ma, Cheang, Lim, Zhang, & Zhu, 2012; Marinakis, 2012; Mattos Ribeiro & Laporte, 2012; Moghaddam, Ruiz, &
Sadjadi, 2012; Moon, Lee, & Seong, 2012; Nazif & Lee, 2012; Norouzi et al., 2012; Pureza, Morabito, & Reimann, 2012; Qi, Lin, Li, & Miao,
2012; Subramanian, Penna, Uchoa, & Ochi, 2012; Tarantilis, Stavropoulou, & Repoussis, 2012; Tasan & Gen, 2012; Vidal, Crainic, Gendreau,
Lahnrichi, & Rei, 2012; Zhang, Chaovalitwongse, & Zhang, 2012)
2011 (Aras, Aksen, & Tuǧrul Tekin, 2011; Archetti, Bouchard, & Desaulniers, 2011; Balseiro, Loiseau, & Ramonet, 2011; Bektas, Erdogan, & Ropke, 22
2011; Brandão, 2011; Felipe, Teresa Ortuño, & Tirado, 2011; Garcia-Najera & Bullinaria, 2011; Gulczynski et al., 2011b, 2011a; Lei, Laporte,
& Guo, 2011; Liao & Hu, 2011; Mirhassani & Abolghasemi, 2011; Santos, Coutinho-Rodrigues, & Antunes, 2011; Szeto, Wu, & Ho, 2011; Valle,
Martinez, da Cunha, & Mateus, 2011; Villegas, Prins, Prodhon, Medaglia, & Velasco, 2011; Xu, Yan, & Li, 2011; Yu, Ding, & Zhu, 2011; Yu
et al., 2011; Yu & Yang, 2011; Yu et al., 2011; Yücenur & Demirel, 2011)
2010 (Benjamin & Beasley, 2010; Bolduc, Laporte, Renaud, & Boctor, 2010; Cao & Lai, 2010; Çatay, 2010; Chen, Huang, & Dong, 2010; Erera, 28
Morales, & Savelsbergh, 2010; Ghoseiri & Ghannadpour, 2010; Gulczynski, Golden, & Wasil, 2010; Kuo, 2010; Li, Tian, & Aneja, 2010; Li,
Tian, & Leung, 2010; Maden, Eglese, & Black, 2010; Marinakis & Marinaki, 2010; Marinakis, Marinaki, & Dounias, 2010; Mendoza, Castanier,
Guéret, Medaglia, & Velasco, 2010; Muyldermans & Pang, 2010; Nagata, Bräysy, & Dullaert, 2010; Ngueveu, Prins, & Wolfler Calvo, 2010;
Prescott-Gagnon, Desaulniers, Drexl, & Rousseau, 2010; Ren, Dessouky, & Ordóñez, 2010; Repoussis & Tarantilis, 2010; Repoussis, Tarantilis,
Bräysy, & Ioannou, 2010; Subramanian, Drummond, Bentes, Ochi, & Farias, 2010; Tang, Zhang, & Pan, 2010; Tütüncü, 2010; Wen, Cordeau,
Laporte, & Larsen, 2010; Yurtkuran & Emel, 2010; Zachariadis, Tarantilis, & Kiranoudis, 2010)
2009 (Ai & Kachitvichyanukul, 2009b, 2009a; Belfiore & Yoshida Yoshizaki, 2009; Bräysy, Porkka, Dullaert, Repoussis, & Tarantilis, 2009; Cheng & 29
Wang, 2009; Fleszar, Osman, & Hindi, 2009; Gajpal & Abad, 2009b, 2009a; Goel, 2009; Groër, Golden, & Wasil, 2009; Hemmelmayr, Doerner,
& Hartl, 2009; Hoff, Gribkovskaia, Laporte, & Løkketangen, 2009; Imran, Salhi, & Wassan, 2009; Jose, 2009; Jozefowiez, Semet, & Talbi,
2009; Karlaftis, Kepaptsoglou, & Sambracos, 2009; Kim, Yang, & Lee, 2009; Kuo, Wang, & Chuang, 2009; Lin, Lee, et al., 2009; Lin, Yu, et al.,
2009; Liu, Huang, & Ma, 2009; Mendoza, Medaglia, & Velasco, 2009; Moretti Branchini, Amaral Armentano, & Løkketangen, 2009; Prescott-
Gagnon, Desaulniers, & Rousseau, 2009; Prins, 2009; Wang & Lu, 2009; Yazgi Tütüncü, Carreto, & Baker, 2009; Yu, Yang, & Yao, 2009;
Zachariadis, Tarantilis, & Kiranoudis, 2009)

References
AbdAllah, A. M. F. M., Essam, D. L., & Sarker, R. A. (2017). On solving periodic re-
optimization dynamic vehicle routing problems. Applied Soft Computing, 55, 1–12.
https://doi.org/10.1016/j.asoc.2017.01.047.
Abdulkader, M. M. S., Gajpal, Y., & ElMekkawy, T. Y. (2015). Hybridized ant colony
algorithm for the Multi Compartment Vehicle Routing Problem. Applied Soft
Computing, 37, 196–203. https://doi.org/10.1016/j.asoc.2015.08.020.
Ai, T. J., & Kachitvichyanukul, V. (2009a). A particle swarm optimization for the vehicle
routing problem with simultaneous pickup and delivery. Computers & Operations
Research, 36(5), 1693–1702. https://doi.org/10.1016/j.cor.2008.04.003.
Ai, T. J., & Kachitvichyanukul, V. (2009b). Particle swarm optimization and two solution
representations for solving the capacitated vehicle routing problem. Computers &
Industrial Engineering, 56(1), 380–387. https://doi.org/10.1016/j.cie.2008.06.012.
Ait Haddadene, S. R., Labadie, N., & Prodhon, C. (2016). A GRASP × ILS for the vehicle
routing problem with time windows, synchronization and precedence constraints.
Expert Systems with Applications, 66, 274–294. https://doi.org/10.1016/j.eswa.2016.
09.002.
Akpinar, S. (2016). Hybrid large neighbourhood search algorithm for capacitated vehicle
routing problem. Expert Systems with Applications, 61, 28–38. https://doi.org/10.
1016/j.eswa.2016.05.023.
Albareda-Sambola, M., Fernández, E., & Laporte, G. (2014). The dynamic multiperiod
vehicle routing problem with probabilistic information. Computers & Operations
Research, 48, 31–39. https://doi.org/10.1016/j.cor.2014.02.010.
Alinaghian, M., & Naderipour, M. (2016). A novel comprehensive macroscopic model for
time-dependent vehicle routing problem with multi-alternative graph to reduce fuel
consumption: A case study. Computers & Industrial Engineering, 99, 210–222. https://
doi.org/10.1016/j.cie.2016.07.029.
Allahviranloo, M., Chow, J. Y. J., & Recker, W. W. (2014). Selective vehicle routing
problems under uncertainty without recourse. Transportation Research Part E: Logistics
and Transportation Review, 62, 68–88. https://doi.org/10.1016/j.tre.2013.12.004.
Allahyari, S., Salari, M., & Vigo, D. (2015). A hybrid metaheuristic algorithm for the
multi-depot covering tour vehicle routing problem. European Journal of Operational
Research, 242(3), 756–768. https://doi.org/10.1016/j.ejor.2014.10.048.
Alvarez, A., & Munari, P. (2017). An exact hybrid method for the vehicle routing problem
with time windows and multiple deliverymen. Computers & Operations Research, 83,
1–12. https://doi.org/10.1016/j.cor.2017.02.001.
Amorim, P., & Almada-Lobo, B. (2014). The impact of food perishability issues in the
vehicle routing problem. Computers and Industrial Engineering, 67(1), 223–233.
https://doi.org/10.1016/j.cie.2013.11.006.
Anbuudayasankar, S. P., Ganesh, K., Lenny Koh, S. C., & Ducq, Y. (2012). Modified
savings heuristics and genetic algorithm for bi-objective vehicle routing problem with
forced backhauls. Expert Systems with Applications, 39(3), 2296–2305. https://doi.
org/10.1016/j.eswa.2011.08.009.
Androutsopoulos, K. N., & Zografos, K. G. (2017). An integrated modelling approach for
the bicriterion vehicle routing and scheduling problem with environmental con-
siderations. Transportation Research Part C: Emerging Technologies, 82, 180–209.
https://doi.org/10.1016/j.trc.2017.06.013.
Aras, N., Aksen, D., & Tuǧrul Tekin, M. (2011). Selective multi-depot vehicle routing
problem with pricing. Transportation Research Part C: Emerging Technologies, 19(5),
866–884. https://doi.org/10.1016/j.trc.2010.08.003.
Archetti, C., Bouchard, M., & Desaulniers, G. (2011). Enhanced branch and price and cut
for vehicle routing with split deliveries and time windows. Transportation Science,
45(3), 285–298. https://doi.org/10.1287/trsc.1100.0363.
Archetti, C., Savelsbergh, M., & Speranza, M. G. (2016). The vehicle routing problem with
occasional drivers. European Journal of Operational Research, 254(2), 472–480.
https://doi.org/10.1016/j.ejor.2016.03.049.
Avci, M., & Topaloglu, S. (2015). An adaptive local search algorithm for vehicle routing
problem with simultaneous and mixed pickups and deliveries. Computers & Industrial
Engineering, 83, 15–29. https://doi.org/10.1016/j.cie.2015.02.002.
Avci, M., & Topaloglu, S. (2016). A hybrid metaheuristic algorithm for heterogeneous
vehicle routing problem with simultaneous pickup and delivery. Expert Systems with
Applications, 53, 160–171. https://doi.org/10.1016/j.eswa.2016.01.038.
Azi, N., Gendreau, M., & Potvin, J.-Y. (2014). An adaptive large neighborhood search for
a vehicle routing problem with multiple routes. Computers & Operations Research,
41(1), 167–173. https://doi.org/10.1016/j.cor.2013.08.016.
Bae, H., & Moon, I. (2016). Multi-depot vehicle routing problem with time windows
considering delivery and installation vehicles. Applied Mathematical Modelling,
40(13–14), 6536–6549. https://doi.org/10.1016/j.apm.2016.01.059.
Balcik, B. (2017). Site selection and vehicle routing for post-disaster rapid needs assess-
ment. Transportation Research Part E: Logistics and Transportation Review, 101, 30–58.

13
R. Elshaer and H. Awad
https://doi.org/10.1016/j.tre.2017.01.002.
Balseiro, S. R., Loiseau, I., & Ramonet, J. (2011). An Ant Colony algorithm hybridized
with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time
Windows. Computers and Operations Research, 38(6), 954–966. https://doi.org/10.
1016/j.cor.2010.10.011.
Baños, R., Ortega, J., Gil, C., De Toro, F., & Montoya, M. G. (2016). Analysis of OpenMP
and MPI implementations of meta-heuristics for vehicle routing problems. Applied
Soft Computing Journal, 43, 262–275. https://doi.org/10.1016/j.asoc.2016.02.035.
Baños, R., Ortega, J., Gil, C., Fernández, A., & De Toro, F. (2013). A Simulated Annealing-
based parallel multi-objective approach to vehicle routing problems with time win-
dows. Expert Systems with Applications, 40(5), 1696–1707. https://doi.org/10.1016/j.
eswa.2012.09.012.
Baños, R., Ortega, J., Gil, C., Márquez, A. L., & De Toro, F. (2013). A hybrid meta-heuristic
for multi-objective Vehicle Routing Problems with Time Windows. Computers and
Industrial Engineering, 65(2), 286–296. https://doi.org/10.1016/j.cie.2013.01.007.
Barkaoui, M., Berger, J., & Boukhtouta, A. (2015). Customer satisfaction in dynamic
vehicle routing problem with time windows. Applied Soft Computing Journal, 35,
423–432. https://doi.org/10.1016/j.asoc.2015.06.035.
Barkaoui, M., & Gendreau, M. (2013). An adaptive evolutionary approach for real-time
vehicle routing and dispatching. Computers and Operations Research, 40(7),
1766–1776. https://doi.org/10.1016/j.cor.2013.01.022.
Beheshti, A. K., Hejazi, S. R., & Alinaghian, M. (2015). The vehicle routing problem with
multiple prioritized time windows: A case study. Computers & Industrial Engineering,
90, 402–413. https://doi.org/10.1016/j.cie.2015.10.005.
Bektas, T., Erdogan, G., & Ropke, S. (2011). Formulations and branch-and-cut algorithms
for the generalized vehicle routing problem. Transportation Science, 45(3), 299–316.
https://doi.org/10.1287/trsc.1100.0352.
Belfiore, P., & Yoshida Yoshizaki, H. T. (2009). Scatter search for a real-life heterogeneous
fleet vehicle routing problem with time windows and split deliveries in Brazil.
European Journal of Operational Research, 199(3), 750–758. https://doi.org/10.1016/
j.ejor.2008.08.003.
Belfiore, P., & Yoshizaki, H. T. Y. (2013). Heuristic methods for the fleet size and mix
vehicle routing problem with time windows and split deliveries. Computers &
Industrial Engineering, 64(2), 589–601. https://doi.org/10.1016/j.cie.2012.11.007.
Belhaiza, S., Hansen, P., & Laporte, G. (2014). A hybrid variable neighborhood tabu
search heuristic for the vehicle routing problem with multiple time windows.
Computers & Operations Research, 52, 269–281. https://doi.org/10.1016/j.cor.2013.
08.010.
Benjamin, A. M., & Beasley, J. E. (2010). Metaheuristics for the waste collection vehicle
routing problem with time windows, driver rest period and multiple disposal facil-
ities. Computers and Operations Research, 37(12), 2270–2280. https://doi.org/10.
1016/j.cor.2010.03.019.
Berghida, M., & Boukra, A. (2015). EBBO: An enhanced biogeography-based optimization
algorithm for a vehicle routing problem with heterogeneous fleet, mixed backhauls,
and time windows. International Journal of Advanced Manufacturing Technology,
77(9–12), 1711–1725. https://doi.org/10.1007/s00170-014-6512-1.
Bernardes de Oliveira, F., Enayatifar, R., Sadaei, H. J., Guimarães, F. G., & Potvin, J.
(2016). Erratum to “A cooperative coevolutionary algorithm for the Multi-Depot
Vehicle Routing Problem [Expert Systems with Applications 43 (2015) 117–130]”.
Expert Systems with Applications, 54, 398–402. https://doi.org/10.1016/j.eswa.2016.
02.037.
Binitha, S., & Sathya, S. S. (2012). A survey of bio inspired optimization algorithms.
International Journal of Soft Computing and Engineering, 2(2), 137–151.
Birbil, Ş. I., & Fang, S. C. (2003). An electromagnetism-like mechanism for global opti-
mization. Journal of Global Optimization, 25(3), 263–282. https://doi.org/10.1023/
A:1022452626305.
Blum, C., & Roli, A. (2003). Metaheuristics in combinatorial optimization: Overview and
conceptual comparison. ACM Computing Surveys, 35(3), 268–308. https://doi.org/10.
1145/937503.937505.
Bodin, L. D. (1975). A taxonomic structure for vehicle routing and scheduling problems.
Computers & Urban Society, 1(1), 11–29. https://doi.org/10.1016/0305-7097(75)
90003-4.
Bodin, L., & Golden, B. (1981). Classification in vehicle routing and scheduling. Networks,
11(2), 97–108. https://doi.org/10.1002/net.3230110204.
Bolduc, M. C., Laporte, G., Renaud, J., & Boctor, F. F. (2010). A tabu search heuristic for
the split delivery vehicle routing problem with production and demand calendars.
European Journal of Operational Research, 202(1), 122–130. https://doi.org/10.1016/
j.ejor.2009.05.008.
Boussaïd, I., Lepagnot, J., & Siarry, P. (2013). A survey on optimization metaheuristics.
Information Sciences, 237, 82–117. https://doi.org/10.1016/j.ins.2013.02.041.
Bouzid, M. C., Aït Haddadene, H., & Salhi, S. (2017). An integration of Lagrangian split
and VNS: The case of the capacitated vehicle routing problem. Computers & Operations
Research, 78, 513–525. https://doi.org/10.1016/j.cor.2016.02.009.
Braaten, S., Gjønnes, O., Hvattum, L. M., & Tirado, G. (2017). Heuristics for the robust
vehicle routing problem with time windows. Expert Systems with Applications, 77,
136–147. https://doi.org/10.1016/j.eswa.2017.01.038.
Braekers, K., Ramaekers, K., & Van Nieuwenhuyse, I. (2016). The vehicle routing pro-
blem: State of the art classification and review. Computers & Industrial Engineering, 99,
300–313. https://doi.org/10.1016/j.cie.2015.12.007.
Brandão, J. (2011). A tabu search algorithm for the heterogeneous fixed fleet vehicle
routing problem. Computers & Operations Research, 38(1), 140–151. https://doi.org/
10.1016/j.cor.2010.04.008.
Bräysy, O., Porkka, P. P., Dullaert, W., Repoussis, P. P., & Tarantilis, C. D. (2009). A well-
scalable metaheuristic for the fleet size and mix vehicle routing problem with time
windows. Expert Systems with Applications, 36(4), 8460–8475. https://doi.org/10.
1016/j.eswa.2008.10.040.
14
Computers & Industrial Engineering 140 (2020) 106242
Brito, J., Martínez, F. J., Moreno, J. A., & Verdegay, J. L. (2015). An ACO hybrid meta-
heuristic for close–open vehicle routing problems with time windows and fuzzy
constraints. Applied Soft Computing, 32, 154–163. https://doi.org/10.1016/j.asoc.
2015.03.026.
Bruck, B. P., Cordeau, J. F., & Iori, M. (2017). A practical time slot management and
routing problem for attended home services. Omega (United Kingdom), 1–12. https://
doi.org/10.1016/j.omega.2017.11.003.
Bula, G. A., Prodhon, C., Gonzalez, F. A., Afsar, H. M., & Velasco, N. (2017). Variable
neighborhood search to solve the vehicle routing problem for hazardous materials
transportation. Journal of Hazardous Materials, 324, 472–480. https://doi.org/10.
1016/j.jhazmat.2016.11.015.
Cacchiani, V., Hemmelmayr, V. C., & Tricoire, F. (2014). A set-covering based heuristic
algorithm for the periodic vehicle routing problem. Discrete Applied Mathematics,
163(PART 1), 53–64. https://doi.org/10.1016/j.dam.2012.08.032.
Campbell, A. M., & Wilson, J. H. (2014). Forty years of periodic vehicle routing. Networks,
63(1), 2–15. https://doi.org/10.1002/net.21527.
Cao, E., & Lai, M. (2010). The open vehicle routing problem with fuzzy demands. Expert
Systems with Applications, 37(3), 2405–2411. https://doi.org/10.1016/j.eswa.2009.
07.021.
Cao, E., Lai, M., & Yang, H. (2014). Open vehicle routing problem with demand un-
certainty and its robust strategies. Expert Systems with Applications, 41(7), 3569–3575.
https://doi.org/10.1016/j.eswa.2013.11.004.
Çatay, B. (2010). A new saving-based ant algorithm for the Vehicle Routing Problem with
simultaneous Pickup and Delivery. Expert Systems with Applications, 37(10),
6809–6817. https://doi.org/10.1016/j.eswa.2010.03.045.
Cattaruzza, D., Absi, N., Feillet, D., & Vidal, T. (2014). A memetic algorithm for the Multi
Trip Vehicle Routing Problem. European Journal of Operational Research, 236(3),
833–848. https://doi.org/10.1016/j.ejor.2013.06.012.
Cattaruzza, D., Absi, N., Feillet, D., & Vigo, D. (2014). An iterated local search for the
multi-commodity multi-trip vehicle routing problem with time windows. Computers &
Operations Research, 51, 257–267. https://doi.org/10.1016/j.cor.2014.06.006.
Çetinkaya, C., Karaoglan, I., & Gökçen, H. (2013). Two-stage vehicle routing problem
with arc time windows: A mixed integer programming formulation and a heuristic
approach. European Journal of Operational Research, 230(3), 539–550. https://doi.
org/10.1016/j.ejor.2013.05.001.
Chen, P., Huang, H. K., & Dong, X. Y. (2010). Iterated variable neighborhood descent
algorithm for the capacitated vehicle routing problem. Expert Systems with
Applications, 37(2), 1620–1627. https://doi.org/10.1016/j.eswa.2009.06.047.
Chen, Q., Li, K., & Liu, Z. (2014). Model and algorithm for an unpaired pickup and de-
livery vehicle routing problem with split loads. Transportation Research Part E:
Logistics and Transportation Review, 69, 218–235. https://doi.org/10.1016/j.tre.2014.
06.010.
Chen, X., Feng, L., & Soon Ong, Y. (2012). A self-adaptive memeplexes robust search
scheme for solving stochastic demands vehicle routing problem. International Journal
of Systems Science, 43(7), 1347–1366. https://doi.org/10.1080/00207721.2011.
618646.
Cheng, C.-B., & Wang, K.-P. (2009). Solving a vehicle routing problem with time windows
by a decomposition technique and a genetic algorithm. Expert Systems with
Applications, 36(4), 7758–7763. https://doi.org/10.1016/j.eswa.2008.09.001.
Chiang, T.-C., & Hsu, W.-H. (2014). A knowledge-based evolutionary algorithm for the
multiobjective vehicle routing problem with time windows. Computers & Operations
Research, 45, 25–37. https://doi.org/10.1016/j.cor.2013.11.014.
Ćirović, G., Pamučar, D., & Božanić, D. (2014). Green logistic vehicle routing problem:
Routing light delivery vehicles in urban areas using a neuro-fuzzy model. Expert
Systems with Applications, 41(9), 4245–4258. https://doi.org/10.1016/j.eswa.2014.
01.005.
Cordeau, J.-F., Laporte, G., Savelsbergh, M. W. P., & Vigo, D. (2007). Chapter 6 vehicle
routing. Handbooks in Operations Research and Management Science, 367–428. https://
doi.org/10.1016/s0927-0507(06)14006-2.
Cordeau, J.-F., & Maischberger, M. (2012). A parallel iterated tabu search heuristic for
vehicle routing problems. Computers & Operations Research, 39(9), 2033–2050.
https://doi.org/10.1016/j.cor.2011.09.021.
Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management
Science, 6(1), 80–91. https://doi.org/10.1287/mnsc.6.1.80.
Dayarian, I., Crainic, T. G., Gendreau, M., & Rei, W. (2015). A branch-and-price approach
for a multi-period vehicle routing problem. Computers and Operations Research, 55,
167–184. https://doi.org/10.1016/j.cor.2014.06.004.
Dayarian, I., Crainic, T. G., Gendreau, M., & Rei, W. (2016). An adaptive large-neigh-
borhood search heuristic for a multi-period vehicle routing problem. Transportation
Research Part E: Logistics and Transportation Review, 95, 95–123. https://doi.org/10.
1016/j.tre.2016.09.004.
de Armas, J., & Melián-Batista, B. (2015). Variable neighborhood search for a dynamic
rich vehicle routing problem with time windows. Computers & Industrial Engineering,
85, 120–131. https://doi.org/10.1016/j.cie.2015.03.006.
de Oliveira, F. B., Enayatifar, R., Sadaei, H. J., Guimarães, F. G., & Potvin, J.-Y. (2016). A
cooperative coevolutionary algorithm for the Multi-Depot Vehicle Routing Problem.
Expert Systems with Applications, 43, 117–130. https://doi.org/10.1016/j.eswa.2015.
08.030.
Defryn, C., & Sörensen, K. (2017). A fast two-level variable neighborhood search for the
clustered vehicle routing problem. Computers & Operations Research, 83, 78–94.
https://doi.org/10.1016/j.cor.2017.02.007.
Demir, E., Bektaş, T., & Laporte, G. (2012). An adaptive large neighborhood search
heuristic for the Pollution-Routing Problem. European Journal of Operational Research,
223(2), 346–359. https://doi.org/10.1016/j.ejor.2012.06.044.
Demir, E., Bektaş, T., & Laporte, G. (2014). The bi-objective Pollution-Routing Problem.
European Journal of Operational Research, 232(3), 464–478. https://doi.org/10.1016/
R. Elshaer and H. Awad
j.ejor.2013.08.002.
Derigs, U., Pullmann, M., & Vogel, U. (2013a). A short note on applying a simple LS/LNS-
based metaheuristic to the rollon–rolloff vehicle routing problem. Computers &
Operations Research, 40(3), 867–872. https://doi.org/10.1016/j.cor.2012.09.008.
Derigs, U., Pullmann, M., & Vogel, U. (2013b). Truck and trailer routing - Problems,
heuristics and computational experience. Computers and Operations Research, 40(2),
536–546. https://doi.org/10.1016/j.cor.2012.08.007.
Desrochers, M., Lenstra, J. K., & Savelsbergh, M. W. P. (1990). A classification scheme for
vehicle routing and scheduling problems. European Journal of Operational Research,
46(3), 322–332. https://doi.org/10.1016/0377-2217(90)90007-X.
Dominguez, O., Guimarans, D., Juan, A. A., & de la Nuez, I. (2016). A biased-randomised
large neighbourhood search for the two-dimensional vehicle routing problem with
Backhauls. European Journal of Operational Research, 255(2), 442–462. https://doi.
org/10.1016/j.ejor.2016.05.002.
Du, J., Li, X., Yu, L., Dan, R., & Zhou, J. (2017). Multi-depot vehicle routing problem for
hazardous materials transportation: A fuzzy bilevel programming. Information
Sciences, 399, 201–218. https://doi.org/10.1016/j.ins.2017.02.011.
Duhamel, C., Lacomme, P., & Prodhon, C. (2012). A hybrid evolutionary local search with
depth first search split procedure for the heterogeneous vehicle routing problems.
Engineering Applications of Artificial Intelligence, 25(2), 345–358. https://doi.org/10.
1016/j.engappai.2011.10.002.
Ehmke, J. F., Campbell, A. M., & Thomas, B. W. (2016). Vehicle routing to minimize time-
dependent emissions in urban areas. European Journal of Operational Research, 251(2),
478–494. https://doi.org/10.1016/j.ejor.2015.11.034.
Eksioglu, B., Vural, A. V., & Reisman, A. (2009). The vehicle routing problem: A taxo-
nomic review. Computers & Industrial Engineering, 57(4), 1472–1483. https://doi.org/
10.1016/j.cie.2009.05.009.
Erdoğan, G. (2017). An open source spreadsheet solver for vehicle routing problems.
Computers & Operations Research. https://doi.org/10.1016/j.cor.2017.02.022.
Erera, A. L., Morales, J. C., & Savelsbergh, M. (2010). The vehicle routing problem with
stochastic demand and duration constraints. Transportation Science, 44(4), 474–492.
https://doi.org/10.1287/trsc.1100.0324.
Euchi, J., Yassine, A., & Chabchoub, H. (2015). The dynamic vehicle routing problem:
Solution with hybrid metaheuristic approach. Swarm and Evolutionary Computation,
21, 41–53. https://doi.org/10.1016/j.swevo.2014.12.003.
Expósito-Izquierdo, C., Rossi, A., & Sevaux, M. (2016). A Two-Level solution approach to
solve the Clustered Capacitated Vehicle Routing Problem. Computers & Industrial
Engineering, 91, 274–289. https://doi.org/10.1016/j.cie.2015.11.022.
Felipe, Á., Ortuño, M. T., Righini, G., & Tirado, G. (2014). A heuristic approach for the
green vehicle routing problem with multiple technologies and partial recharges.
Transportation Research Part E: Logistics and Transportation Review, 71, 111–128.
https://doi.org/10.1016/j.tre.2014.09.003.
Felipe, A., Teresa Ortuño, M., & Tirado, G. (2011). Using intermediate infeasible solutions
to approach vehicle routing problems with precedence and loading constraints.
European Journal of Operational Research, 211(1), 66–75. https://doi.org/10.1016/j.
ejor.2010.11.011.
Ferrucci, F., Bock, S., & Gendreau, M. (2013). A pro-active real-time control approach for
dynamic vehicle routing problems dealing with the delivery of urgent goods.
European Journal of Operational Research, 225(1), 130–141. https://doi.org/10.1016/
j.ejor.2012.09.016.
Fleming, C. L., Griffis, S. E., & Bell, J. E. (2013). The effects of triangle inequality on the
vehicle routing problem. European Journal of Operational Research, 224(1), 1–7.
https://doi.org/10.1016/j.ejor.2012.07.005.
Fleszar, K., Osman, I. H., & Hindi, K. S. (2009). A variable neighbourhood search algo-
rithm for the open vehicle routing problem. European Journal of Operational Research,
195(3), 803–809. https://doi.org/10.1016/j.ejor.2007.06.064.
Franceschetti, A., Demir, E., Honhon, D., Van Woensel, T., Laporte, G., & Stobbe, M.
(2017). A metaheuristic for the time-dependent pollution-routing problem. European
Journal of Operational Research, 259(3), 972–991. https://doi.org/10.1016/j.ejor.
2016.11.026.
François, V., Arda, Y., Crama, Y., & Laporte, G. (2016). Large neighborhood search for
multi-trip vehicle routing. European Journal of Operational Research, 255(2), 422–441.
https://doi.org/10.1016/j.ejor.2016.04.065.
Gahm, C., Brabänder, C., & Tuma, A. (2017). Vehicle routing with private fleet, multiple
common carriers offering volume discounts, and rental options. Transportation
Research Part E: Logistics and Transportation Review, 97, 192–216. https://doi.org/10.
1016/j.tre.2016.10.010.
Gajpal, Y., & Abad, P. (2009a). An ant colony system (ACS) for vehicle routing problem
with simultaneous delivery and pickup. Computers and Operations Research, 36(12),
3215–3223. https://doi.org/10.1016/j.cor.2009.02.017.
Gajpal, Y., & Abad, P. L. (2009b). Multi-ant colony system (MACS) for a vehicle routing
problem with backhauls. European Journal of Operational Research, 196(1), 102–117.
https://doi.org/10.1016/j.ejor.2008.02.025.
Garcia-Najera, A., & Bullinaria, J. A. (2011). An improved multi-objective evolutionary
algorithm for the vehicle routing problem with time windows. Computers and
Operations Research, 38(1), 287–300. https://doi.org/10.1016/j.cor.2010.05.004.
García-Nájera, A., Bullinaria, J. A., & Gutiérrez-Andrade, M. A. (2015). An evolutionary
approach for multi-objective vehicle routing problems with backhauls. Computers &
Industrial Engineering, 81, 90–108. https://doi.org/10.1016/j.cie.2014.12.029.
Gauvin, C., Desaulniers, G., & Gendreau, M. (2014). A branch-cut-and-price algorithm for
the vehicle routing problem with stochastic demands. Computers & Operations
Research, 50, 141–153. https://doi.org/10.1016/j.cor.2014.03.028.
Gendreau, M., & Potvin, J.-Y. (2005). Metaheuristics in combinatorial optimization.
Annals of Operations Research, 140(1), 189–213. https://doi.org/10.1007/s10479-
005-3971-7.
Gendreau, M., & Potvin, J.-Y. (Eds.). (2010). International series in operations research &
15
Computers & Industrial Engineering 140 (2020) 106242
management science. https://doi.org/10.1007/978-1-4419-1665-5.
Gendreau, M., Potvin, J. Y., Bräysy, O., Hasle, G., & Løkketangen, A. (2008).
Metaheuristics for the vehicle routing problem and its extensions: A categorized
bibliography. Operations Research/ Computer Science Interfaces Series, 43(August),
143–169. https://doi.org/10.1007/978-0-387-77778-8_7.
Ghoseiri, K., & Ghannadpour, S. F. (2010). Multi-objective vehicle routing problem with
time windows using goal programming and genetic algorithm. Applied Soft Computing,
30(2), 286–296. https://doi.org/10.1016/j.jmsy.2011.04.005.
Glover, F., & Kochenberger, G. A. (Eds.). (2003). International series in operations research
& management science. https://doi.org/10.1007/b101874.
Goel, A. (2009). Vehicle scheduling and routing with drivers’ working hours.
Transportation Science, 43(1), 17–26. https://doi.org/10.1287/trsc.1070.0226.
Goksal, F. P., Karaoglan, I., & Altiparmak, F. (2013). A hybrid discrete particle swarm
optimization for vehicle routing problem with simultaneous pickup and delivery.
Computers & Industrial Engineering, 65(1), 39–53. https://doi.org/10.1016/j.cie.2012.
01.005.
Golden, B., Raghavan, S., & Wasil, E. (Eds.). (2008). Operations research/computer science
interfaces. https://doi.org/10.1007/978-0-387-77778-8.
Goodson, J. C., Ohlmann, J. W., & Thomas, B. W. (2012). Cyclic-order neighborhoods
with application to the vehicle routing problem with stochastic demand. European
Journal of Operational Research, 217(2), 312–323. https://doi.org/10.1016/j.ejor.
2011.09.023.
Groër, C., Golden, B., & Wasil, E. (2009). The consistent vehicle routing problem.
Manufacturing & Service Operations Management, 11(4), 630–643. https://doi.org/10.
1287/msom.1080.0243.
Gulczynski, D., Golden, B., & Wasil, E. (2010). The split delivery vehicle routing problem
with minimum delivery amounts. Transportation Research Part E: Logistics and
Transportation Review, 46(5), 612–626. https://doi.org/10.1016/j.tre.2009.12.007.
Gulczynski, D., Golden, B., & Wasil, E. (2011a). The multi-depot split delivery vehicle
routing problem: An integer programming-based heuristic, new test problems, and
computational results. Computers & Industrial Engineering, 61(3), 794–804. https://
doi.org/10.1016/j.cie.2011.05.012.
Gulczynski, D., Golden, B., & Wasil, E. (2011b). The period vehicle routing problem: New
heuristics and real-world variants. Transportation Research Part E: Logistics and
Transportation Review, 47(5), 648–668. https://doi.org/10.1016/j.tre.2011.02.002.
Hà, M. H., Bostel, N., Langevin, A., & Rousseau, L.-M. (2014). An exact algorithm and a
metaheuristic for the generalized vehicle routing problem with flexible fleet size.
Computers & Operations Research, 43(1), 9–19. https://doi.org/10.1016/j.cor.2013.
08.017.
Han, A. F. W., & Chu, Y. C. (2016). A multi-start heuristic approach for the split-delivery
vehicle routing problem with minimum delivery amounts. Transportation Research
Part E: Logistics and Transportation Review, 88, 11–31. https://doi.org/10.1016/j.tre.
2016.01.014.
Hassanzadeh, A., & Rasti-Barzoki, M. (2017). Minimizing total resource consumption and
total tardiness penalty in a resource allocation supply chain scheduling and vehicle
routing problem. Applied Soft Computing Journal, 58, 307–323. https://doi.org/10.
1016/j.asoc.2017.05.010.
Hemmelmayr, V. C., Doerner, K. F., & Hartl, R. F. (2009). A variable neighborhood search
heuristic for periodic routing problems. European Journal of Operational Research,
195(3), 791–802. https://doi.org/10.1016/j.ejor.2007.08.048.
Henke, T., Speranza, M. G., & Wäscher, G. (2015). The multi-compartment vehicle
routing problem with flexible compartment sizes. European Journal of Operational
Research, 246(3), 730–743. https://doi.org/10.1016/j.ejor.2015.05.020.
Hiermann, G., Puchinger, J., Ropke, S., & Hartl, R. F. (2016). The electric fleet size and
mix vehicle routing problem with time windows and recharging stations. European
Journal of Operational Research, 252(3), 995–1018. https://doi.org/10.1016/j.ejor.
2016.01.038.
Ho, S. C., & Szeto, W. Y. (2016). GRASP with path relinking for the selective pickup and
delivery problem. Expert Systems with Applications, 51, 14–25. https://doi.org/10.
1016/j.eswa.2015.12.015.
Hoff, A., Gribkovskaia, I., Laporte, G., & Løkketangen, A. (2009). Lasso solution strategies
for the vehicle routing problem with pickups and deliveries. European Journal of
Operational Research, 192(3), 755–766. https://doi.org/10.1016/j.ejor.2007.10.021.
Hokama, P., Miyazawa, F. K., & Xavier, E. C. (2016). A branch-and-cut approach for the
vehicle routing problem with loading constraints. Expert Systems with Applications, 47,
1–13. https://doi.org/10.1016/j.eswa.2015.10.013.
Hong, L. (2012). An improved LNS algorithm for real-time vehicle routing problem with
time windows. Computers & Operations Research, 39(2), 151–163. https://doi.org/10.
1016/j.cor.2011.03.006.
Hu, Z. H., Sheu, J. B., Zhao, L., & Lu, C. C. (2015). A dynamic closed-loop vehicle routing
problem with uncertainty and incompatible goods. Transportation Research Part C:
Emerging Technologies, 55, 273–297. https://doi.org/10.1016/j.trc.2015.01.010.
Huber, S., & Geiger, M. J. (2017). Order matters – A variable neighborhood search for the
Swap-body vehicle routing problem. European Journal of Operational Research, 263(2),
419–445. https://doi.org/10.1016/j.ejor.2017.04.046.
Imran, A., Salhi, S., & Wassan, N. A. (2009). A variable neighborhood-based heuristic for
the heterogeneous fleet vehicle routing problem. European Journal of Operational
Research, 197(2), 509–518. https://doi.org/10.1016/j.ejor.2008.07.022.
Iqbal, S., Kaykobad, M., & Rahman, M. S. (2015). Solving the multi-objective Vehicle
Routing Problem with Soft Time Windows with the help of bees. Swarm and
Evolutionary Computation, 24, 50–64. https://doi.org/10.1016/j.swevo.2015.06.001.
Jabali, O., Van Woensel, T., & De Kok, A. G. (2012). Analysis of travel times and CO2
emissions in time-dependent vehicle routing. Production and Operations Management,
21(6), 1060–1074. https://doi.org/10.1111/j.1937-5956.2012.01338.x.
Jabir, E., Panicker, V. V., & Sridharan, R. (2017). Design and development of a hybrid ant
colony-variable neighbourhood search algorithm for a multi-depot green vehicle
R. Elshaer and H. Awad
routing problem. Transportation Research Part D: Transport and Environment, 57,
422–457. https://doi.org/10.1016/j.trd.2017.09.003.
Janssens, J., Van den Bergh, J., Sörensen, K., & Cattrysse, D. (2015). Multi-objective
microzone-based vehicle routing for courier companies: From tactical to operational
planning. European Journal of Operational Research, 242(1), 222–231. https://doi.org/
10.1016/j.ejor.2014.09.026.
Jiang, J., Ng, K. M., Poh, K. L., & Teo, K. M. (2014). Vehicle routing problem with a
heterogeneous fleet and time windows. Expert Systems with Applications, 41(8),
3748–3760. https://doi.org/10.1016/j.eswa.2013.11.029.
Jin, J., Crainic, T. G., & Lokketangen, A. (2012). A parallel multi-neighborhood co-
operative tabu search for capacitated vehicle routing problems. European Journal of
Operational Research, 222(3), 441–451. https://doi.org/10.1016/j.ejor.2012.05.025.
Jin, J., Crainic, T. G., & Løkketangen, A. (2014). A cooperative parallel metaheuristic for
the capacitated vehicle routing problem. Computers & Operations Research, 44, 33–41.
https://doi.org/10.1016/j.cor.2013.10.004.
Jose, B. (2009). A deterministic tabu search algorithm for the fleet size and mix vehicle
routing problem. European Journal Of Operational Research, 195, 716–728. https://
doi.org/10.1016/j.ejor.2007.05.059.
Jozefowiez, N., Semet, F., & Talbi, E.-G. (2009). An evolutionary algorithm for the vehicle
routing problem with route balancing. European Journal of Operational Research,
195(3), 761–769. https://doi.org/10.1016/j.ejor.2007.06.065.
Kachitvichyanukul, V., Sombuntham, P., & Kunnapapdeelert, S. (2015). Two solution
representations for solving multi-depot vehicle routing problem with multiple pickup
and delivery requests via PSO. Computers & Industrial Engineering, 89, 125–136.
https://doi.org/10.1016/j.cie.2015.04.011.
Kalayci, C. B., & Kaya, C. (2016). An ant colony system empowered variable neighbor-
hood search algorithm for the vehicle routing problem with simultaneous pickup and
delivery. Expert Systems with Applications, 66, 163–175. https://doi.org/10.1016/j.
eswa.2016.09.017.
Karlaftis, M. G., Kepaptsoglou, K., & Sambracos, E. (2009). Containership routing with
time deadlines and simultaneous deliveries and pick-ups. Transportation Research Part
E: Logistics and Transportation Review, 45(1), 210–221. https://doi.org/10.1016/j.tre.
2008.05.001.
Kergosien, Y., Lenté, C., Billaut, J.-C., & Perrin, S. (2013). Metaheuristic algorithms for
solving two interconnected vehicle routing problems in a hospital complex.
Computers & Operations Research, 40(10), 2508–2518. https://doi.org/10.1016/j.cor.
2013.01.009.
Keskin, M., & Çatay, B. (2016). Partial recharge strategies for the electric vehicle routing
problem with time windows. Transportation Research Part C: Emerging Technologies,
65, 111–127. https://doi.org/10.1016/j.trc.2016.01.013.
Khouadjia, M. R., Sarasola, B., Alba, E., Jourdan, L., & Talbi, E. G. (2012). A comparative
study between dynamic adapted PSO and VNS for the vehicle routing problem with
dynamic requests. Applied Soft Computing Journal, 12(4), 1426–1439. https://doi.org/
10.1016/j.asoc.2011.10.023.
Kim, H., Yang, J., & Lee, K. D. (2009). Vehicle routing in reverse logistics for recycling
end-of-life consumer electronic goods in South Korea. Transportation Research Part D:
Transport and Environment, 14(5), 291–299. https://doi.org/10.1016/j.trd.2009.03.
001.
Koç, Ç., Bektaş, T., Jabali, O., & Laporte, G. (2015). A hybrid evolutionary algorithm for
heterogeneous fleet vehicle routing problems with time windows. Computers &
Operations Research, 64, 11–27. https://doi.org/10.1016/j.cor.2015.05.004.
Koç, Ç., & Karaoglan, I. (2016). The green vehicle routing problem: A heuristic based
exact solution approach. Applied Soft Computing, 39, 154–164. https://doi.org/10.
1016/j.asoc.2015.10.064.
Kourank Beheshti, A., & Hejazi, S. R. (2015). A novel hybrid column generation-meta-
heuristic approach for the vehicle routing problem with general soft time window.
Information Sciences, 316, 598–615. https://doi.org/10.1016/j.ins.2014.11.037.
Kovacs, A. A., Parragh, S. N., & Hartl, R. F. (2015). The multi-objective generalized
consistent vehicle routing problem. European Journal of Operational Research, 247(2),
441–458. https://doi.org/10.1016/j.ejor.2015.06.030.
Kramer, R., Subramanian, A., Vidal, T., & Cabral, L. D. A. F. (2015). A matheuristic ap-
proach for the Pollution-Routing Problem. European Journal of Operational Research,
243(2), 523–539. https://doi.org/10.1016/j.ejor.2014.12.009.
Krichen, S., Faiz, S., Tlili, T., & Tej, K. (2014). Tabu-based GIS for solving the vehicle
routing problem. Expert Systems with Applications, 41(14), 6483–6493. https://doi.
org/10.1016/j.eswa.2014.03.028.
Küçükoğlu, İ., & Öztürk, N. (2015). An advanced hybrid meta-heuristic algorithm for the
vehicle routing problem with backhauls and time windows. Computers & Industrial
Engineering, 86, 60–68. https://doi.org/10.1016/j.cie.2014.10.014.
Kumar, R. S., Kondapaneni, K., Dixit, V., Goswami, A., Thakur, L. S., & Tiwari, M. K.
(2016). Multi-objective modeling of production and pollution routing problem with
time window: A self-learning particle swarm optimization approach. Computers &
Industrial Engineering, 99, 29–40. https://doi.org/10.1016/j.cie.2015.07.003.
Kuo, R. J., Wibowo, B. S., & Zulvia, F. E. (2016). Application of a fuzzy ant colony system
to solve the dynamic vehicle routing problem with uncertain service time. Applied
Mathematical Modelling, 1–12. https://doi.org/10.1016/j.apm.2016.06.025.
Kuo, Y. (2010). Using simulated annealing to minimize fuel consumption for the time-
dependent vehicle routing problem. Computers and Industrial Engineering, 59(1),
157–165. https://doi.org/10.1016/j.cie.2010.03.012.
Kuo, Y., & Wang, C. C. (2012). A variable neighborhood search for the multi-depot vehicle
routing problem with loading cost. Expert Systems with Applications, 39(8),
6949–6954. https://doi.org/10.1016/j.eswa.2012.01.024.
Kuo, Y., Wang, C. C., & Chuang, P. Y. (2009). Optimizing goods assignment and the
vehicle routing problem with time-dependent travel speeds. Computers and Industrial
Engineering, 57(4), 1385–1392. https://doi.org/10.1016/j.cie.2009.07.006.
Kwon, Y. J., Choi, Y. J., & Lee, D. H. (2013). Heterogeneous fixed fleet vehicle routing
16
Computers & Industrial Engineering 140 (2020) 106242
considering carbon emission. Transportation Research Part D: Transport and
Environment, 23, 81–89. https://doi.org/10.1016/j.trd.2013.04.001.
Lai, D. S. W., Caliskan Demirag, O., & Leung, J. M. Y. (2016). A tabu search heuristic for
the heterogeneous vehicle routing problem on a multigraph. Transportation Research
Part E: Logistics and Transportation Review, 86, 32–52. https://doi.org/10.1016/j.tre.
2015.12.001.
Lei, H., Laporte, G., & Guo, B. (2011). The capacitated vehicle routing problem with
stochastic demands and time windows. Computers and Operations Research, 38(12),
1775–1783. https://doi.org/10.1016/j.cor.2011.02.007.
Leung, S. C. H., Zhang, Z., Zhang, D., Hua, X., & Lim, M. K. (2013). A meta-heuristic
algorithm for heterogeneous fleet vehicle routing problems with two-dimensional
loading constraints. European Journal of Operational Research, 225(2), 199–210.
https://doi.org/10.1016/j.ejor.2012.09.023.
Li, J., Pardalos, P. M., Sun, H., Pei, J., & Zhang, Y. (2015). Iterated local search embedded
adaptive neighborhood selection approach for the multi-depot vehicle routing pro-
blem with simultaneous deliveries and pickups. Expert Systems with Applications,
42(7), 3551–3561. https://doi.org/10.1016/j.eswa.2014.12.004.
Li, K., & Tian, H. (2016). A two-level self-adaptive variable neighborhood search algo-
rithm for the prize-collecting vehicle routing problem. Applied Soft Computing, 43,
469–479. https://doi.org/10.1016/j.asoc.2016.02.040.
Li, X., Leung, S. C. H., & Tian, P. (2012). A multistart adaptive memory-based tabu search
algorithm for the heterogeneous fixed fleet open vehicle routing problem. Expert
Systems with Applications, 39(1), 365–374. https://doi.org/10.1016/j.eswa.2011.07.
025.
Li, X., Tian, P., & Aneja, Y. P. (2010). An adaptive memory programming metaheuristic
for the heterogeneous fixed fleet vehicle routing problem. Transportation Research
Part E: Logistics and Transportation Review, 46(6), 1111–1127. https://doi.org/10.
1016/j.tre.2010.02.004.
Li, X., Tian, P., & Leung, S. C. H. (2010). Vehicle routing problems with time windows and
stochastic travel and service times: Models and algorithm. International Journal of
Production Economics, 125(1), 137–145. https://doi.org/10.1016/j.ijpe.2010.01.013.
Liao, T.-Y., & Hu, T.-Y. (2011). An object-oriented evaluation framework for dynamic
vehicle routing problems under real-time information. Expert Systems with
Applications, 38(10), 12548–12558. https://doi.org/10.1016/j.eswa.2011.04.041.
Lin, C., Choy, K. L., Ho, G. T. S., Chung, S. H., & Lam, H. Y. (2014). Survey of green
vehicle routing problem: Past and future trends. Expert Systems with Applications,
41(4), 1118–1138. https://doi.org/10.1016/j.eswa.2013.07.107.
Lin, J.-L., Wu, C.-H., & Chung, H.-Y. (2012). Performance comparison of electro-
magnetism-like algorithms for global optimization. Applied Mathematics, 3(10),
1265–1275. https://doi.org/10.4236/am.2012.330183.
Lin, S. W., Lee, Z. J., Ying, K. C., & Lee, C. Y. (2009). Applying hybrid meta-heuristics for
capacitated vehicle routing problem. Expert Systems with Applications, 36(2 PART 1),
1505–1512. https://doi.org/10.1016/j.eswa.2007.11.060.
Lin, S. W., Yu, V. F., & Chou, S. Y. (2009). Solving the truck and trailer routing problem
based on a simulated annealing heuristic. Computers and Operations Research, 36(5),
1683–1692. https://doi.org/10.1016/j.cor.2008.04.005.
Liu, R., & Jiang, Z. (2012). The close-open mixed vehicle routing problem. European
Journal of Operational Research, 220(2), 349–360. https://doi.org/10.1016/j.ejor.
2012.01.061.
Liu, R., Xie, X., Augusto, V., & Rodriguez, C. (2013). Heuristic algorithms for a vehicle
routing problem with simultaneous delivery and pickup and time windows in home
health care. European Journal of Operational Research, 230(3), 475–486. https://doi.
org/10.1016/j.ejor.2013.04.044.
Liu, S. (2013). A hybrid population heuristic for the heterogeneous vehicle routing pro-
blems. Transportation Research Part E: Logistics and Transportation Review, 54, 67–78.
https://doi.org/10.1016/j.tre.2013.03.010.
Liu, S., Huang, W., & Ma, H. (2009). An effective genetic algorithm for the fleet size and
mix vehicle routing problems. Transportation Research Part E: Logistics and
Transportation Review, 45(3), 434–445. https://doi.org/10.1016/j.tre.2008.10.003.
Lu, C.-C., & Yu, V. F. (2012). Data envelopment analysis for evaluating the efficiency of
genetic algorithms on solving the vehicle routing problem with soft time windows.
Computers & Industrial Engineering, 63(2), 520–529. https://doi.org/10.1016/j.cie.
2012.04.005.
Luo, J., & Chen, M. R. (2014). Improved Shuffled Frog Leaping Algorithm and its multi-
phase model for multi-depot vehicle routing problem. Expert Systems with
Applications, 41(5), 2535–2545. https://doi.org/10.1016/j.eswa.2013.10.001.
Luo, J., Li, X., Chen, M.-R., & Liu, H. (2015). A novel hybrid shuffled frog leaping algo-
rithm for vehicle routing problem with time windows. Information Sciences,
316(April), 266–292. https://doi.org/10.1016/j.ins.2015.04.001.
Luo, Z., Qin, H., Che, C., & Lim, A. (2015). On service consistency in multi-period vehicle
routing. European Journal of Operational Research, 243(3), 731–744. https://doi.org/
10.1016/j.ejor.2014.12.019.
Luo, Z., Qin, H., Zhang, D., & Lim, A. (2016). Adaptive large neighborhood search
heuristics for the vehicle routing problem with stochastic demands and weight-re-
lated cost. Transportation Research Part E: Logistics and Transportation Review, 85,
69–89. https://doi.org/10.1016/j.tre.2015.11.004.
Ma, H., Cheang, B., Lim, A., Zhang, L., & Zhu, Y. (2012). An investigation into the vehicle
routing problem with time windows and link capacity constraints. Omega, 40(3),
336–347. https://doi.org/10.1016/j.omega.2011.08.003.
Ma, Z. J., Wu, Y., & Dai, Y. (2017). A combined order selection and time-dependent
vehicle routing problem with time widows for perishable product delivery. Computers
and Industrial Engineering, 114(October), 101–113. https://doi.org/10.1016/j.cie.
2017.10.010.
Maden, W., Eglese, R., & Black, D. (2010). Vehicle routing and scheduling with time-
varying data: A case study. Journal of the Operational Research Society, 61(S3),
515–522. https://doi.org/10.1057/jors.2009.116.
R. Elshaer and H. Awad
Mancini, S. (2016). A real-life multi depot multi period vehicle routing problem with a
heterogeneous fleet: Formulation and adaptive large neighborhood search based
matheuristic. Transportation Research Part C: Emerging Technologies, 70, 100–112.
https://doi.org/10.1016/j.trc.2015.06.016.
Mancini, S. (2017). The hybrid vehicle routing problem. Transportation Research Part C:
Emerging Technologies, 78, 1–12. https://doi.org/10.1016/j.trc.2017.02.004.
Mańdziuk, J., & Żychowski, A. (2016). A memetic approach to vehicle routing problem
with dynamic requests. Applied Soft Computing, 48, 522–534. https://doi.org/10.
1016/j.asoc.2016.06.032.
Männel, D., & Bortfeldt, A. (2016). A hybrid algorithm for the vehicle routing problem
with pickup and delivery and three-dimensional loading constraints. European
Journal of Operational Research, 254(3), 840–858. https://doi.org/10.1016/j.ejor.
2016.04.016.
Marinaki, M., & Marinakis, Y. (2016). A Glowworm swarm optimization algorithm for the
vehicle routing problem with stochastic demands. Expert Systems with Applications,
46, 145–163. https://doi.org/10.1016/j.eswa.2015.10.012.
Marinakis, Y. (2012). Multiple phase neighborhood search-GRASP for the capacitated
vehicle routing problem. Expert Systems with Applications, 39(8), 6807–6815. https://
doi.org/10.1016/j.eswa.2012.01.015.
Marinakis, Y., Iordanidou, G.-R., & Marinaki, M. (2013). Particle swarm optimization for
the vehicle routing problem with stochastic demands. Applied Soft Computing Journal,
13(4), 1693–1704. https://doi.org/10.1016/j.asoc.2013.01.007.
Marinakis, Y., & Marinaki, M. (2010). A hybrid genetic – Particle Swarm Optimization
Algorithm for the vehicle routing problem. Expert Systems with Applications, 37(2),
1446–1455. https://doi.org/10.1016/j.eswa.2009.06.085.
Marinakis, Y., & Marinaki, M. (2014). A bumble bees mating optimization algorithm for
the open vehicle routing problem. Swarm and Evolutionary Computation, 15, 80–94.
https://doi.org/10.1016/j.swevo.2013.12.003.
Marinakis, Y., & Marinaki, M. (2015). Combinatorial neighborhood topology bumble bees
mating optimization for the vehicle routing problem with stochastic demands. Soft
Computing, 19(2), 353–373. https://doi.org/10.1007/s00500-014-1257-1.
Marinakis, Y., Marinaki, M., & Dounias, G. (2010). A hybrid particle swarm optimization
algorithm for the vehicle routing problem. Engineering Applications of Artificial
Intelligence, 23(4), 463–472. https://doi.org/10.1016/j.engappai.2010.02.002.
Mattos Ribeiro, G., & Laporte, G. (2012). An adaptive large neighborhood search heuristic
for the cumulative capacitated vehicle routing problem. Computers and Operations
Research, 39(3), 728–735. https://doi.org/10.1016/j.cor.2011.05.005.
McNabb, M. E., Weir, J. D., Hill, R. R., & Hall, S. N. (2015). Testing local search move
operators on the vehicle routing problem with split deliveries and time windows.
Computers and Operations Research, 56, 93–109. https://doi.org/10.1016/j.cor.2014.
11.007.
Mendoza, J. E., Castanier, B., Guéret, C., Medaglia, A. L., & Velasco, N. (2010). A memetic
algorithm for the multi-compartment vehicle routing problem with stochastic de-
mands. Computers & Operations Research, 37(11), 1886–1898. https://doi.org/10.
1016/j.cor.2009.06.015.
Mendoza, J. E., Medaglia, A. L., & Velasco, N. (2009). An evolutionary-based decision
support system for vehicle routing: The case of a public utility. Decision Support
Systems, 46(3), 730–742. https://doi.org/10.1016/j.dss.2008.11.019.
Michallet, J., Prins, C., Amodeo, L., Yalaoui, F., & Vitry, G. (2014). Multi-start iterated
local search for the periodic vehicle routing problem with time windows and time
spread constraints on services. Computers and Operations Research, 41(1), 196–207.
https://doi.org/10.1016/j.cor.2013.07.025.
Miranda, D. M., & Conceição, S. V. (2016). The vehicle routing problem with hard time
windows and stochastic travel and service time. Expert Systems with Applications, 64,
104–116. https://doi.org/10.1016/j.eswa.2016.07.022.
Mirhassani, S. A., & Abolghasemi, N. (2011). A particle swarm optimization algorithm for
open vehicle routing problem. Expert Systems with Applications, 38(9), 11547–11551.
https://doi.org/10.1016/j.eswa.2011.03.032.
Moghaddam, B. F., Ruiz, R., & Sadjadi, S. J. (2012). Vehicle routing problem with un-
certain demands: An advanced particle swarm algorithm. Computers and Industrial
Engineering, 62(1), 306–317. https://doi.org/10.1016/j.cie.2011.10.001.
Montoya-Torres, J. R., López Franco, J., Nieto Isaza, S., Felizzola Jiménez, H., & Herazo-
Padilla, N. (2015). A literature review on the vehicle routing problem with multiple
depots. Computers & Industrial Engineering, 79, 115–129. https://doi.org/10.1016/j.
cie.2014.10.029.
Montoya, A., Guéret, C., Mendoza, J. E., & Villegas, J. G. (2017). The electric vehicle
routing problem with nonlinear charging function. Transportation Research Part B:
Methodological, 1–10. https://doi.org/10.1016/j.trb.2017.02.004.
Moon, I., Lee, J. H., & Seong, J. (2012). Vehicle routing problem with time windows
considering overtime and outsourcing vehicles. Expert Systems with Applications,
39(18), 13202–13213. https://doi.org/10.1016/j.eswa.2012.05.081.
Moretti Branchini, R., Amaral Armentano, V., & Løkketangen, A. (2009). Adaptive
granular local search heuristic for a dynamic vehicle routing problem. Computers and
Operations Research, 36(11), 2955–2968. https://doi.org/10.1016/j.cor.2009.01.014.
Moshref-Javadi, M., & Lee, S. (2016). The customer-centric, multi-commodity vehicle
routing problem with split delivery. Expert Systems with Applications, 56, 335–348.
https://doi.org/10.1016/j.eswa.2016.03.030.
Mouthuy, S., Massen, F., Deville, Y., & Van Hentenryck, P. (2015). A multistage very
large-scale neighborhood search for the vehicle routing problem with soft time
windows. Transportation Science, 49(2), 223–238. https://doi.org/10.1287/trsc.2014.
0558.
Muyldermans, L., & Pang, G. (2010). On the benefits of co-collection: Experiments with a
multi-compartment vehicle routing algorithm. European Journal of Operational
Research, 206(1), 93–103. https://doi.org/10.1016/j.ejor.2010.02.020.
Naderipour, M., & Alinaghian, M. (2016). Measurement, evaluation and minimization of
CO2, NOx, and CO emissions in the open time dependent vehicle routing problem.
17
Computers & Industrial Engineering 140 (2020) 106242
Measurement: Journal of the International Measurement Confederation, 90(x), 443–452.
https://doi.org/10.1016/j.measurement.2016.04.043.
Nagata, Y., Bräysy, O., & Dullaert, W. (2010). A penalty-based edge assembly memetic
algorithm for the vehicle routing problem with time windows. Computers and
Operations Research, 37(4), 724–737. https://doi.org/10.1016/j.cor.2009.06.022.
Nagy, G., Wassan, N. A., Speranza, M. G., & Archetti, C. (2015). The vehicle routing
problem with divisible deliveries and pickups. Transportation Science, 49(2), 271–294.
https://doi.org/10.1287/trsc.2013.0501.
Nazif, H., & Lee, L. S. (2012). Optimised crossover genetic algorithm for capacitated
vehicle routing problem. Applied Mathematical Modelling, 36(5), 2110–2117. https://
doi.org/10.1016/j.apm.2011.08.010.
Ng, K. K. H., Lee, C. K. M., Zhang, S. Z., Wu, K., & Ho, W. (2017). A multiple colonies
artificial bee colony algorithm for a capacitated vehicle routing problem and re-
routing strategies under time-dependent traffic congestion. Computers & Industrial
Engineering, 109, 151–168. https://doi.org/10.1016/j.cie.2017.05.004.
Ngueveu, S. U., Prins, C., & Wolfler Calvo, R. (2010). An effective memetic algorithm for
the cumulative capacitated vehicle routing problem. Computers and Operations
Research, 37(11), 1877–1885. https://doi.org/10.1016/j.cor.2009.06.014.
Nguyen, P. K., Crainic, T. G., & Toulouse, M. (2013). A tabu search for time-dependent
multi-zone multi-trip vehicle routing problem with time windows. European Journal
of Operational Research, 231(1), 43–56. https://doi.org/10.1016/j.ejor.2013.05.026.
Nguyen, V. A., Jiang, J., Ng, K. M., & Teo, K. M. (2016). Satisficing measure approach for
vehicle routing problem with time windows under uncertainty. European Journal of
Operational Research, 248(2), 404–414. https://doi.org/10.1016/j.ejor.2015.07.041.
Norouzi, N., Tavakkoli-Moghaddam, R., Ghazanfari, M., Alinaghian, M., &
Salamatbakhsh, A. (2012). A new multi-objective competitive open vehicle routing
problem solved by particle swarm optimization. Networks and Spatial Economics,
12(4), 609–633. https://doi.org/10.1007/s11067-011-9169-4.
Norouzi, N., Sadegh-Amalnick, M., & Alinaghiyan, M. (2015). Evaluating of the particle
swarm optimization in a periodic vehicle routing problem. Measurement, 62,
162–169. https://doi.org/10.1016/j.measurement.2014.10.024.
Okulewicz, M., & Mańdziuk, J. (2017). The impact of particular components of the PSO-
based algorithm solving the Dynamic Vehicle Routing Problem. Applied Soft
Computing Journal, 58, 586–604. https://doi.org/10.1016/j.asoc.2017.04.070.
Osaba, E., Carballedo, R., Diaz, F., & Perallos, A. (2013). Discussion related to “Wang, C.-
H., & Lu, J.-Z. (2009). A hybrid genetic algorithm that optimizes capacitated vehicle
routing problem. Expert Systems with Applications, 36(2), 2921–2936. Expert Systems
with Applications, 40(14), 5425–5426. https://doi.org/10.1016/j.eswa.2013.04.008.
Osman, I. H., & Laporte, G. (1996). Metaheuristics: A bibliography. Annals of Operations
Research, 63(5), 511–623. https://doi.org/10.1007/BF02125421.
Palhazi Cuervo, D., Goos, P., Sörensen, K., & Arráiz, E. (2014). An iterated local search
algorithm for the vehicle routing problem with backhauls. European Journal of
Operational Research, 237(2), 454–464. https://doi.org/10.1016/j.ejor.2014.02.011.
Parragh, S. N., & Cordeau, J.-F. (2017). Branch-and-price and adaptive large neighbor-
hood search for the truck and trailer routing problem with time windows. Computers
& Operations Research, 83, 28–44. https://doi.org/10.1016/j.cor.2017.01.020.
Parragh, S. N., Doerner, K. F., & Hartl, R. F. (2008a). A survey on pickup and delivery
problems Part I: Transportation between customers and depot. Journal Für
Betriebswirtschaft, 58(1), 21–51. https://doi.org/10.1007/s11301-008-0033-7.
Parragh, S. N., Doerner, K. F., & Hartl, R. F. (2008b). A survey on pickup and delivery
problems Part II: Transportation between pickup and delivery locations. Journal Für
Betriebswirtschaft, 58(2), 81–117. https://doi.org/10.1007/s11301-008-0036-4.
Penna, P. H. V., Subramanian, A., & Ochi, L. S. (2013). An iterated local search heuristic
for the heterogeneous fleet vehicle routing problem. Journal of Heuristics, 19(2),
201–232. https://doi.org/10.1007/s10732-011-9186-y.
Pham, T. A., Hoàng Hà, M., & Nguyen, X. H. (2017). Solving the multi-vehicle multi-
covering tour problem. Computers and Operations Research, 88, 258–278. https://doi.
org/10.1016/j.cor.2017.07.009.
Pierre, D. M., & Zakaria, N. (2017). Stochastic partially optimized cyclic shift crossover
for multi-objective genetic algorithms for the vehicle routing problem with time-
windows. Applied Soft Computing Journal, 52, 863–876. https://doi.org/10.1016/j.
asoc.2016.09.039.
Pisinger, D., & Ropke, S. (2010). Large neighborhood search. International Series in
Operations Research & Management Science, 399–419. https://doi.org/10.1007/978-1-
4419-1665-5_13.
Polat, O. (2017). A parallel variable neighborhood search for the vehicle routing problem
with divisible deliveries and pickups. Computers and Operations Research, 85, 71–86.
https://doi.org/10.1016/j.cor.2017.03.009.
Polat, O., Kalayci, C. B., Kulak, O., & Günther, H.-O. (2015). A perturbation based vari-
able neighborhood search heuristic for solving the Vehicle Routing Problem with
Simultaneous Pickup and Delivery with Time Limit. European Journal of Operational
Research, 242(2), 369–382. https://doi.org/10.1016/j.ejor.2014.10.010.
Pop, P. C., Matei, O., & Sitar, C. P. (2013). An improved hybrid algorithm for solving the
generalized vehicle routing problem. Neurocomputing, 109, 76–83. https://doi.org/
10.1016/j.neucom.2012.03.032.
Pradenas, L., Oportus, B., & Parada, V. (2013). Mitigation of greenhouse gas emissions in
vehicle routing problems with backhauling. Expert Systems with Applications, 40(8),
2985–2991. https://doi.org/10.1016/j.eswa.2012.12.014.
Prescott-Gagnon, E., Desaulniers, G., Drexl, M., & Rousseau, L.-M. (2010). European
driver rules in vehicle routing with time windows. Transportation Science, 44(4),
455–473. https://doi.org/10.1287/trsc.1100.0328.
Prescott-Gagnon, Eric, Desaulniers, G., & Rousseau, L.-M. (2009). A branch-and-price-
based large neighborhood search algorithm for the vehicle routing problem with time
windows. Networks, 54(4), 190–204. https://doi.org/10.1002/net.20332.
Prins, C. (2009). Two memetic algorithms for heterogeneous fleet vehicle routing pro-
blems. Engineering Applications of Artificial Intelligence, 22(6), 916–928. https://doi.
R. Elshaer and H. Awad
org/10.1016/j.engappai.2008.10.006.
Pureza, V., Morabito, R., & Reimann, M. (2012). Vehicle routing with multiple deli-
verymen: Modeling and heuristic approaches for the VRPTW. European Journal of
Operational Research, 218(3), 636–647. https://doi.org/10.1016/j.ejor.2011.12.005.
Qi, M., Lin, W.-H., Li, N., & Miao, L. (2012). A spatiotemporal partitioning approach for
large-scale vehicle routing problems with time windows. Transportation Research Part
E: Logistics and Transportation Review, 48(1), 248–257. https://doi.org/10.1016/j.tre.
2011.07.001.
Qi, Y., Hou, Z., Li, H., Huang, J., & Li, X. (2015). A decomposition based memetic al-
gorithm for multi-objective vehicle routing problem with time windows. Computers &
Operations Research, 62(3), 61–77. https://doi.org/10.1016/j.cor.2015.04.009.
Qian, J., & Eglese, R. (2016). Fuel emissions optimization in vehicle routing problems
with time-varying speeds. European Journal of Operational Research, 248(3), 840–848.
https://doi.org/10.1016/j.ejor.2015.09.009.
Rancourt, M.-E., Cordeau, J.-F., & Laporte, G. (2013). Long-Haul vehicle routing and
scheduling with working hour rules. Transportation Science, 47(1), 81–107. https://
doi.org/10.1287/trsc.1120.0417.
Ren, Y., Dessouky, M., & Ordóñez, F. (2010). The multi-shift vehicle routing problem with
overtime. Computers & Operations Research, 37(11), 1987–1998. https://doi.org/10.
1016/j.cor.2010.01.016.
Repoussis, P. P., & Tarantilis, C. D. (2010). Solving the fleet size and mix vehicle routing
problem with time windows via adaptive memory programming. Transportation
Research Part C: Emerging Technologies, 18(5), 695–712. https://doi.org/10.1016/j.
trc.2009.08.004.
Repoussis, P. P., Tarantilis, C. D., Bräysy, O., & Ioannou, G. (2010). A hybrid evolution
strategy for the open vehicle routing problem. Computers and Operations Research,
37(3), 443–455. https://doi.org/10.1016/j.cor.2008.11.003.
Salhi, S., Imran, A., & Wassan, N. A. (2014). The multi-depot vehicle routing problem
with heterogeneous vehicle fleet: Formulation and a variable neighborhood search
implementation. Computers & Operations Research, 52, 315–325. https://doi.org/10.
1016/j.cor.2013.05.011.
Santos, L., Coutinho-Rodrigues, J., & Antunes, C. H. (2011). A web spatial decision
support system for vehicle routing using Google Maps. Decision Support Systems,
51(1), 1–9. https://doi.org/10.1016/j.dss.2010.11.008.
Schneider, M. (2016). The vehicle-routing problem with time windows and driver-specific
times. European Journal of Operational Research, 250(1), 101–119. https://doi.org/10.
1016/j.ejor.2015.09.015.
Schneider, M., Sand, B., & Stenger, A. (2013). A note on the time travel approach for
handling time windows in vehicle routing problems. Computers and Operations
Research, 40(10), 2564–2568. https://doi.org/10.1016/j.cor.2013.02.002.
Schneider, M., Stenger, A., & Goeke, D. (2014). The electric vehicle-routing problem with
time windows and recharging stations. Transportation Science. https://doi.org/10.
1287/trsc.2013.0490.
Şevkli, A. Z., & Güler, B. (2017). A multi-phase oscillated variable neighbourhood search
algorithm for a real-world open vehicle routing problem. Applied Soft Computing
Journal, 58, 128–144. https://doi.org/10.1016/j.asoc.2017.04.045.
Seyyedhasani, H., & Dvorak, J. S. (2017). Using the Vehicle Routing Problem to reduce
field completion times with multiple machines. Computers and Electronics in
Agriculture, 134, 142–150. https://doi.org/10.1016/j.compag.2016.11.010.
Shi, Y., Boudouh, T., & Grunder, O. (2017). A hybrid genetic algorithm for a home health
care routing problem with time window and fuzzy demand. Expert Systems with
Applications, 72, 160–176. https://doi.org/10.1016/j.eswa.2016.12.013.
Sicilia, J. A., Quemada, C., Royo, B., & Escuín, D. (2016). An optimization algorithm for
solving the rich vehicle routing problem based on Variable Neighborhood Search and
Tabu Search metaheuristics. Journal of Computational and Applied Mathematics, 291,
468–477. https://doi.org/10.1016/j.cam.2015.03.050.
Silva, M. M., Subramanian, A., & Ochi, L. S. (2015). An iterated local search heuristic for
the split delivery vehicle routing problem. Computers & Operations Research, 53,
234–249. https://doi.org/10.1016/j.cor.2014.08.005.
Silvestrin, P. V., & Ritt, M. (2017). An iterated tabu search for the multi-compartment
vehicle routing problem. Computers & Operations Research, 81, 192–202. https://doi.
org/10.1016/j.cor.2016.12.023.
Solano-Charris, E., Prins, C., & Santos, A. C. (2015). Local search based metaheuristics for
the robust vehicle routing problem with discrete scenarios. Applied Soft Computing
Journal, 32, 518–531. https://doi.org/10.1016/j.asoc.2015.03.058.
Sörensen, K., & Schittekat, P. (2013). Statistical analysis of distance-based path relinking
for the capacitated vehicle routing problem. Computers and Operations Research,
40(12), 3197–3205. https://doi.org/10.1016/j.cor.2013.02.005.
Soto, M., Sevaux, M., Rossi, A., & Reinholz, A. (2017). Multiple neighborhood search,
tabu search and ejection chains for the multi-depot open vehicle routing problem.
Computers and Industrial Engineering, 107, 211–222. https://doi.org/10.1016/j.cie.
2017.03.022.
Spliet, R., & Desaulniers, G. (2015). The discrete time window assignment vehicle routing
problem. European Journal of Operational Research, 244(2), 379–391. https://doi.org/
10.1016/j.ejor.2015.01.020.
Stenger, A., Vigo, D., Enz, S., & Schwind, M. (2013). An adaptive variable neighborhood
search algorithm for a vehicle routing problem arising in small package shipping.
Transportation Science, 47(1), 64–80. https://doi.org/10.1287/trsc.1110.0396.
Subramanian, A., Drummond, L. M. A., Bentes, C., Ochi, L. S., & Farias, R. (2010). A
parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and
Delivery. Computers and Operations Research, 37(11), 1899–1911. https://doi.org/10.
1016/j.cor.2009.10.011.
Subramanian, A., Penna, P. H. V., Uchoa, E., & Ochi, L. S. (2012). A hybrid algorithm for
the Heterogeneous Fleet Vehicle Routing Problem. European Journal of Operational
Research, 221(2), 285–295. https://doi.org/10.1016/j.ejor.2012.03.016.
Subramanian, A., Uchoa, E., & Ochi, L. S. (2013). A hybrid algorithm for a class of vehicle
18
Computers & Industrial Engineering 140 (2020) 106242
routing problems. Computers & Operations Research, 40(10), 2519–2531. https://doi.
org/10.1016/j.cor.2013.01.013.
Suzuki, Y. (2016). A dual-objective metaheuristic approach to solve practical pollution
routing problem. International Journal of Production Economics, 176, 143–153. https://
doi.org/10.1016/j.ijpe.2016.03.008.
Sze, J. F., Salhi, S., & Wassan, N. (2017). The cumulative capacitated vehicle routing
problem with min-sum and min-max objectives: An effective hybridisation of adap-
tive variable neighbourhood search and large neighbourhood search. Transportation
Research Part B: Methodological, 101, 162–184. https://doi.org/10.1016/j.trb.2017.
04.003.
Sze, J., Salhi, S., & Wassan, N. (2016). A hybridisation of adaptive variable neighbour-
hood search and large neighbourhood search: Application to the vehicle routing
problem. Expert Systems With Applications, 65, 383–397. https://doi.org/10.1016/j.
eswa.2016.08.060.
Szeto, W. Y., Wu, Y., & Ho, S. C. (2011). An artificial bee colony algorithm for the ca-
pacitated vehicle routing problem. European Journal of Operational Research, 215(1),
126–135. https://doi.org/10.1016/j.ejor.2011.06.006.
Talarico, L., Springael, J., Sörensen, K., & Talarico, F. (2017). A large neighbourhood
metaheuristic for the risk-constrained cash-in-transit vehicle routing problem.
Computers & Operations Research, 78, 547–556. https://doi.org/10.1016/j.cor.2016.
04.003.
Tang, J., Ma, Y., Guan, J., & Yan, C. (2013). A Max-Min Ant System for the split delivery
weighted vehicle routing problem. Expert Systems with Applications, 40(18),
7468–7477. https://doi.org/10.1016/j.eswa.2013.06.068.
Tang, J., Zhang, J., & Pan, Z. (2010). A scatter search algorithm for solving vehicle
routing problem with loading cost. Expert Systems with Applications, 37(6),
4073–4083. https://doi.org/10.1016/j.eswa.2009.11.027.
Tarantilis, C. D., Stavropoulou, F., & Repoussis, P. P. (2012). A template-based Tabu
Search algorithm for the Consistent Vehicle Routing Problem. Expert Systems with
Applications, 39(4), 4233–4239. https://doi.org/10.1016/j.eswa.2011.09.111.
Tarantilis, Christos D., Anagnostopoulou, A. K., & Repoussis, P. P. (2013). Adaptive path
relinking for vehicle routing and scheduling problems with product returns.
Transportation Science, 47(April 2016), 356–379. https://doi.org/10.1287/trsc.1120.
0439.
Taş, D., Dellaert, N., van Woensel, T., & de Kok, T. (2013). Vehicle routing problem with
stochastic travel times including soft time windows and service costs. Computers &
Operations Research, 40(1), 214–224. https://doi.org/10.1016/j.cor.2012.06.008.
Taş, D., Dellaert, N., van Woensel, T., & de Kok, T. (2014). The time-dependent vehicle
routing problem with soft time windows and stochastic travel times. Transportation
Research Part C: Emerging Technologies, 48, 66–83. https://doi.org/10.1016/j.trc.
2014.08.007.
Taş, D., Jabali, O., & Van Woensel, T. (2014). A vehicle routing problem with flexible time
windows. Computers and. Operations Research, 52(PART A), 39–54. https://doi.org/
10.1016/j.cor.2014.07.005.
Tasan, A. S., & Gen, M. (2012). A genetic algorithm based approach to vehicle routing
problem with simultaneous pick-up and deliveries. Computers & Industrial Engineering,
62(3), 755–761. https://doi.org/10.1016/j.cie.2011.11.025.
Teymourian, E., Kayvanfar, V., Komaki, G. M., & Zandieh, M. (2016). Enhanced in-
telligent water drops and cuckoo search algorithms for solving the capacitated ve-
hicle routing problem. Information Sciences, 334–335, 354–378. https://doi.org/10.
1016/j.ins.2015.11.036.
Ting, C. K., Liao, X. L., Huang, Y. H., & Liaw, R. T. (2017). Multi-vehicle selective pickup
and delivery using metaheuristic algorithms. Information Sciences, 406–407, 146–169.
https://doi.org/10.1016/j.ins.2017.04.001.
Todosijević, R., Hanafi, S., Urošević, D., Jarboui, B., & Gendron, B. (2017). A general
variable neighborhood search for the swap-body vehicle routing problem. Computers
& Operations Research, 78, 468–479. https://doi.org/10.1016/j.cor.2016.01.016.
Tu, W., Fang, Z., Li, Q., Shaw, S.-L., & Chen, B. (2014). A bi-level Voronoi diagram-based
metaheuristic for a large-scale multi-depot vehicle routing problem. Transportation
Research Part E: Logistics and Transportation Review, 61, 84–97. https://doi.org/10.
1016/j.tre.2013.11.003.
Tütüncü, G. Y. (2010). An interactive GRAMPS algorithm for the heterogeneous fixed
fleet vehicle routing problem with and without backhauls. European Journal of
Operational Research, 201(2), 593–600. https://doi.org/10.1016/j.ejor.2009.03.044.
Uchoa, E., Pecin, D., Pessoa, A., Poggi, M., Vidal, T., & Subramanian, A. (2017). New
benchmark instances for the Capacitated Vehicle Routing Problem. European Journal
of Operational Research, 257(3), 845–858. https://doi.org/10.1016/j.ejor.2016.08.
012.
Valle, C. A., Martinez, L. C., da Cunha, A. S., & Mateus, G. R. (2011). Heuristic and exact
algorithms for a min–max selective vehicle routing problem. Computers & Operations
Research, 38(7), 1054–1065. https://doi.org/10.1016/j.cor.2010.10.010.
Venkata Narasimha, K., Kivelevitch, E., Sharma, B., & Kumar, M. (2013). An ant colony
optimization technique for solving min–max Multi-Depot Vehicle Routing Problem.
Swarm and Evolutionary Computation, 13, 63–73. https://doi.org/10.1016/j.swevo.
2013.05.005.
Vidal, T., Battarra, M., Subramanian, A., & Erdogˇan, G. (2015). Hybrid metaheuristics for
the Clustered Vehicle Routing Problem. Computers & Operations Research, 58, 87–99.
https://doi.org/10.1016/j.cor.2014.10.019.
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2013). A hybrid genetic algorithm with
adaptive diversity management for a large class of vehicle routing problems with
time-windows. Computers & Operations Research, 40(1), 475–489. https://doi.org/10.
1016/j.cor.2012.07.018.
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2014). Implicit depot assignments and
rotations in vehicle routing heuristics. European Journal of Operational Research,
237(1), 15–28. https://doi.org/10.1016/j.ejor.2013.12.044.
Vidal, T., Crainic, T., Gendreau, M., Lahnrichi, N., & Rei, W. (2012). A hybrid genetic
R. Elshaer and H. Awad
algorithm for multi-depot and periodic vehicle routing problems. Operations Research,
60(3), 611–624. https://doi.org/10.1287/opre.1120.1048.
Villegas, J. G., Prins, C., Prodhon, C., Medaglia, A. L., & Velasco, N. (2011). A GRASP with
evolutionary path relinking for the truck and trailer routing problem. Computers and
Operations Research, 38(9), 1319–1334. https://doi.org/10.1016/j.cor.2010.11.011.
Villegas, J. G., Prins, C., Prodhon, C., Medaglia, A. L., & Velasco, N. (2013). A math-
euristic for the truck and trailer routing problem. European Journal of Operational
Research, 230(2), 231–244. https://doi.org/10.1016/j.ejor.2013.04.026.
Wang, C.-H., & Lu, J.-Z. (2009). A hybrid genetic algorithm that optimizes capacitated
vehicle routing problems. Expert Systems with Applications, 36(2), 2921–2936. https://
doi.org/10.1016/j.eswa.2008.01.072.
Wang, C., Mu, D., Zhao, F., & Sutherland, J. W. (2015). A parallel simulated annealing
method for the vehicle routing problem with simultaneous pickup–delivery and time
windows. Computers & Industrial Engineering, 83, 111–122. https://doi.org/10.1016/j.
cie.2015.02.005.
Wang, Z., Li, Y., & Hu, X. (2015). A heuristic approach and a tabu search for the het-
erogeneous multi-type fleet vehicle routing problem with time windows and an in-
compatible loading constraint. Computers & Industrial Engineering, 89, 162–176.
https://doi.org/10.1016/j.cie.2014.11.004.
Wassan, N., Wassan, N., Nagy, G., & Salhi, S. (2017). The multiple trip vehicle routing
problem with backhauls: Formulation and a two-level variable neighbourhood
search. Computers & Operations Research, 78, 454–467. https://doi.org/10.1016/j.cor.
2015.12.017.
Wei, L., Zhang, Z., Zhang, D., & Lim, A. (2015). A variable neighborhood search for the
capacitated vehicle routing problem with two-dimensional loading constraints.
European Journal of Operational Research, 243(3), 798–814. https://doi.org/10.1016/
j.ejor.2014.12.048.
Wen, M., Cordeau, J. F., Laporte, G., & Larsen, J. (2010). The dynamic multi-period ve-
hicle routing problem. Computers and Operations Research, 37(9), 1615–1623. https://
doi.org/10.1016/j.cor.2009.12.002.
Wu, L., Hifi, M., & Bederina, H. (2017). A new robust criterion for the vehicle routing
problem with uncertain travel time. Computers & Industrial Engineering, 112, 607–615.
https://doi.org/10.1016/j.cie.2017.05.029.
Wu, W., Tian, Y., & Jin, T. (2016). A label based ant colony algorithm for heterogeneous
vehicle routing with mixed backhaul. Applied Soft Computing Journal, 47, 224–234.
https://doi.org/10.1016/j.asoc.2016.05.011.
Wy, J., & Kim, B. I. (2013). A hybrid metaheuristic approach for the rollon-rolloff vehicle
routing problem. Computers and Operations Research, 40(8), 1947–1952. https://doi.
org/10.1016/j.cor.2013.03.006.
Wy, J., Kim, B., & Kim, S. (2013). The rollon – rolloff waste collection vehicle routing
problem with time windows. European Journal of Operational Research, 224(3),
466–476. https://doi.org/10.1016/j.ejor.2012.09.001.
Xiao, Y., & Konak, A. (2017). A genetic algorithm with exact dynamic programming for
the green vehicle routing & scheduling problem. Journal of Cleaner Production, 167,
1450–1463. https://doi.org/10.1016/j.jclepro.2016.11.115.
Xu, D., Li, K., Zou, X., & Liu, L. (2017). An unpaired pickup and delivery vehicle routing
problem with multi-visit. Transportation Research Part E: Logistics and Transportation
Review, 103, 218–247. https://doi.org/10.1016/j.tre.2017.04.011.
Xu, J., Yan, F., & Li, S. (2011). Vehicle routing optimization with soft time windows in a
fuzzy random environment. Transportation Research Part E: Logistics and
Transportation Review, 47(6), 1075–1091. https://doi.org/10.1016/j.tre.2011.04.
002.
Xu, S.-H., Liu, J.-P., Zhang, F.-H., Wang, L., & Sun, L.-J. (2015). A combination of genetic
algorithm and particle swarm optimization for vehicle routing problem with time
windows. Sensors, 15(9), 21033–21053. https://doi.org/10.3390/s150921033.
Yakıcı, E. (2017). A heuristic approach for solving a rich min-max vehicle routing pro-
blem with mixed fleet and mixed demand. Computers and Industrial Engineering, 109,
288–294. https://doi.org/10.1016/j.cie.2017.05.001.
Yang, X.-S., & Karamanoglu, M. (2013). Swarm intelligence and bio-inspired computa-
tion. Swarm intelligence and bio-inspired. Computation, 3–23. https://doi.org/10.
1016/b978-0-12-405163-8.00001-6.
Yassen, E. T., Ayob, M., Nazri, M. Z. A., & Sabar, N. R. (2017). An adaptive hybrid al-
gorithm for vehicle routing problems with time windows. Computers and Industrial
Engineering, 113(September), 382–391. https://doi.org/10.1016/j.cie.2017.09.034.
Yazgi Tütüncü, G., Carreto, C. A. C., & Baker, B. M. (2009). A visual interactive approach
to classical and mixed vehicle routing problems with backhauls. Omega, 37(1),
138–154. https://doi.org/10.1016/j.omega.2006.11.001.
Yu, B., Yang, Z. Z., & Yao, B. Z. (2011). A hybrid algorithm for vehicle routing problem
with time windows. Expert Systems with Applications, 38(1), 435–441. https://doi.org/
10.1016/j.eswa.2010.06.082.
Yu, B., Yang, Z.-Z., & Xie, J.-X. (2011). A parallel improved ant colony optimization for
multi-depot vehicle routing problem. Journal of the Operational Research Society,
62(1), 183–188. https://doi.org/10.1057/jors.2009.161.
19
Computers & Industrial Engineering 140 (2020) 106242
Yu, B., & Yang, Z. Z. (2011). An ant colony optimization model: The period vehicle
routing problem with time windows. Transportation Research Part E: Logistics and
Transportation Review, 47(2), 166–181. https://doi.org/10.1016/j.tre.2010.09.010.
Yu, B., Yang, Z. Z., & Yao, B. (2009). An improved ant colony optimization for vehicle
routing problem. European Journal of Operational Research, 196(1), 171–176. https://
doi.org/10.1016/j.ejor.2008.02.028.
Yu, M., & Qi, X. (2014). A vehicle routing problem with multiple overlapped batches.
Transportation Research Part E: Logistics and Transportation Review, 61, 40–55. https://
doi.org/10.1016/j.tre.2013.10.004.
Yu, S., Ding, C., & Zhu, K. (2011). A hybrid GA-TS algorithm for open vehicle routing
optimization of coal mines material. Expert Systems with Applications, 38(8),
10568–10573. https://doi.org/10.1016/j.eswa.2011.02.108.
Yu, V. F., Redi, A. A. N. P., Hidayat, Y. A., & Wibowo, O. J. (2017). A simulated annealing
heuristic for the hybrid vehicle routing problem. Applied Soft Computing, 53, 119–132.
https://doi.org/10.1016/j.asoc.2016.12.027.
Yücenur, G. N., & Demirel, N.Ç. (2011). A new geometric shape-based genetic clustering
algorithm for the multi-depot vehicle routing problem. Expert Systems with
Applications, 38(9), 11859–11865. https://doi.org/10.1016/j.eswa.2011.03.077.
Yurtkuran, A., & Emel, E. (2010). A new Hybrid Electromagnetism-like Algorithm for
capacitated vehicle routing problems. Expert Systems with Applications, 37(4),
3427–3433. https://doi.org/10.1016/j.eswa.2009.10.005.
Zachariadis, E. E., Tarantilis, C. D., & Kiranoudis, C. T. (2009). A hybrid metaheuristic
algorithm for the vehicle routing problem with simultaneous delivery and pick-up
service. Expert Systems with Applications, 36(2 PART 1), 1070–1081. https://doi.org/
10.1016/j.eswa.2007.11.005.
Zachariadis, E. E., Tarantilis, C. D., & Kiranoudis, C. T. (2010). An adaptive memory
methodology for the vehicle routing problem with simultaneous pick-ups and de-
liveries. European Journal of Operational Research, 202(2), 401–411. https://doi.org/
10.1016/j.ejor.2009.05.015.
Zare-Reisabadi, E., & Hamid Mirmohammadi, S. (2015). Site dependent vehicle routing
problem with soft time window: Modeling and solution approach. Computers and
Industrial Engineering, 90, 177–185. https://doi.org/10.1016/j.cie.2015.09.002.
Zhang, D., Cai, S., Ye, F., Si, Y., & Nguyen, T. T. (2017). A hybrid algorithm for a vehicle
routing problem with realistic constraints. Information Sciences, 394–395, 167–182.
https://doi.org/10.1016/j.ins.2017.02.028.
Zhang, J., Zhao, Y., Xue, W., & Li, J. (2015). Vehicle routing problem with fuel con-
sumption and carbon emission. International Journal of Production Economics, 170,
234–242. https://doi.org/10.1016/j.ijpe.2015.09.031.
Zhang, J., Lam, W. H. K., & Chen, B. Y. (2013). A Stochastic vehicle routing problem with
travel time uncertainty: Trade-off between cost and customer service. Networks and
Spatial Economics, 13(4), 471–496. https://doi.org/10.1007/s11067-013-9190-x.
Zhang, S., Lee, C. K. M., Choy, K. L., Ho, W., & Ip, W. H. (2014). Design and development
of a hybrid artificial bee colony algorithm for the environmental vehicle routing
problem. Transportation Research Part D: Transport and Environment, 31, 85–99.
https://doi.org/10.1016/j.trd.2014.05.015.
Zhang, T., Chaovalitwongse, W. A., & Zhang, Y. (2012). Scatter search for the stochastic
travel-time vehicle routing problem with simultaneous pick-ups and deliveries.
Computers and Operations Research, 39(10), 2277–2290. https://doi.org/10.1016/j.
cor.2011.11.021.
Zhang, Z., Che, O., Cheang, B., Lim, A., & Qin, H. (2013). A memetic algorithm for the
multiperiod vehicle routing problem with profit. European Journal of Operational
Research, 229(3), 573–584. https://doi.org/10.1016/j.ejor.2012.11.059.
Zhang, Z., Qin, H., Wang, K., He, H., & Liu, T. (2017). Manpower allocation and vehicle
routing problem in non-emergency ambulance transfer service. Transportation
Research Part E: Logistics and Transportation Review, 106, 45–59. https://doi.org/10.
1016/j.tre.2017.08.002.
Raafat Elshaer is an Associate professor in Industrial Engineering Department, Faculty of
Engineering, Zagazig University; Zagazig, Sharkia, Egypt. He received his B.S. degree in
Production Engineering from Faculty of Engineering, Helwan University in 1996, M.Sc.
degree in Industrial Engineering from Faculty of Engineering, Zagazig University in 2004,
and Ph.D. in Industrial Engineering from Faculty of Engineering, Zagazig University in
2009 as a joint program between Zagazig University and Rutgers University, USA. He has
published journal and conference papers. His research interests include optimization,
scheduling, project management, earned value management and others.
Hadeer Awad is a teaching assistance in Industrial Engineering Department, Faculty of
Engineering, Zagazig University; Zagazig, Sharkia, Egypt. She received her B.S. degree in
Industrial Engineering from Faculty of Engineering, Zagazig University in 2014, M.Sc.
degree in Industrial Engineering from Faculty of Engineering, Zagazig University in 2018.
She is currently working in designing and developing genetic algorithms for solving
different variants of Vehicle Routing Problems.