More Web Proxy on the site http://driver.im/

research-article

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

Authors:

Raafat Elshaer,

Hadeer AwadAuthors Info & Claims

Volume 140, Issue C

https://doi.org/10.1016/j.cie.2019.106242

Published: 01 February 2020 Publication History

Highlights

•

Taxonomic review of metaheuristic algorithms used for VRP problems in 299 articles.

•

The VRP and its variants solved using metaheuristic algorithms are classified.

•

Investigating contributions of metaheuristic algorithms in solving the VRP problems.

•

Algorithms and VRP variants are most popular and are promising topics for future research are revealed.

Abstract

Recently, a taxonomic review of the Vehicle Routing Problem (VRP) literature published between 2009 and June 2015 stated that most of the surveyed articles use metaheuristics for solving the problem and its variants. As extension to that work, this paper serves two-fold objectives: first, classifying the VRP and its variants solved 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.

References

[1]

A.M.F.M. AbdAllah, D.L. Essam, R.A. Sarker, On solving periodic re-optimization dynamic vehicle routing problems, Applied Soft Computing 55 (2017) 1–12,.

Digital Library

[2]

M.M.S. Abdulkader, Y. Gajpal, T.Y. ElMekkawy, Hybridized ant colony algorithm for the Multi Compartment Vehicle Routing Problem, Applied Soft Computing 37 (2015) 196–203,.

Digital Library

[3]

T.J. Ai, V. Kachitvichyanukul, A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery, Computers & Operations Research 36 (5) (2009) 1693–1702,.

Digital Library

[4]

T.J. Ai, V. Kachitvichyanukul, Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem, Computers & Industrial Engineering 56 (1) (2009) 380–387,.

Digital Library

[5]

S.R. Ait Haddadene, N. Labadie, C. Prodhon, A GRASP × ILS for the vehicle routing problem with time windows, synchronization and precedence constraints, Expert Systems with Applications 66 (2016) 274–294,.

Digital Library

[6]

S. Akpinar, Hybrid large neighbourhood search algorithm for capacitated vehicle routing problem, Expert Systems with Applications 61 (2016) 28–38,.

Digital Library

[7]

M. Albareda-Sambola, E. Fernández, G. Laporte, The dynamic multiperiod vehicle routing problem with probabilistic information, Computers & Operations Research 48 (2014) 31–39,.

[8]

M. Alinaghian, M. Naderipour, 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 (2016) 210–222,.

Digital Library

[9]

M. Allahviranloo, J.Y.J. Chow, W.W. Recker, Selective vehicle routing problems under uncertainty without recourse, Transportation Research Part E: Logistics and Transportation Review 62 (2014) 68–88,.

[10]

S. Allahyari, M. Salari, D. Vigo, A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem, European Journal of Operational Research 242 (3) (2015) 756–768,.

[11]

A. Alvarez, P. Munari, An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen, Computers & Operations Research 83 (2017) 1–12,.

Digital Library

[12]

P. Amorim, B. Almada-Lobo, The impact of food perishability issues in the vehicle routing problem, Computers and Industrial Engineering 67 (1) (2014) 223–233,.

Digital Library

[13]

S.P. Anbuudayasankar, K. Ganesh, S.C. Lenny Koh, Y. Ducq, Modified savings heuristics and genetic algorithm for bi-objective vehicle routing problem with forced backhauls, Expert Systems with Applications 39 (3) (2012) 2296–2305,.

Digital Library

[14]

K.N. Androutsopoulos, K.G. Zografos, An integrated modelling approach for the bicriterion vehicle routing and scheduling problem with environmental considerations, Transportation Research Part C: Emerging Technologies 82 (2017) 180–209,.

[15]

N. Aras, D. Aksen, M. Tuǧrul Tekin, Selective multi-depot vehicle routing problem with pricing, Transportation Research Part C: Emerging Technologies 19 (5) (2011) 866–884,.

[16]

C. Archetti, M. Bouchard, G. Desaulniers, Enhanced branch and price and cut for vehicle routing with split deliveries and time windows, Transportation Science 45 (3) (2011) 285–298,.

Digital Library

[17]

C. Archetti, M. Savelsbergh, M.G. Speranza, The vehicle routing problem with occasional drivers, European Journal of Operational Research 254 (2) (2016) 472–480,.

[18]

M. Avci, S. Topaloglu, An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries, Computers & Industrial Engineering 83 (2015) 15–29,.

Digital Library

[19]

M. Avci, S. Topaloglu, A hybrid metaheuristic algorithm for heterogeneous vehicle routing problem with simultaneous pickup and delivery, Expert Systems with Applications 53 (2016) 160–171,.

Digital Library

[20]

N. Azi, M. Gendreau, J.-Y. Potvin, An adaptive large neighborhood search for a vehicle routing problem with multiple routes, Computers & Operations Research 41 (1) (2014) 167–173,.

Digital Library

[21]

H. Bae, I. Moon, Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles, Applied Mathematical Modelling 40 (13–14) (2016) 6536–6549,.

[22]

B. Balcik, Site selection and vehicle routing for post-disaster rapid needs assessment, Transportation Research Part E: Logistics and Transportation Review 101 (2017) 30–58,.

[23]

S.R. Balseiro, I. Loiseau, J. Ramonet, An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows, Computers and Operations Research 38 (6) (2011) 954–966,.

Digital Library

[24]

R. Baños, J. Ortega, C. Gil, F. De Toro, M.G. Montoya, Analysis of OpenMP and MPI implementations of meta-heuristics for vehicle routing problems, Applied Soft Computing Journal 43 (2016) 262–275,.

Digital Library

[25]

R. Baños, J. Ortega, C. Gil, A. Fernández, F. De Toro, A Simulated Annealing-based parallel multi-objective approach to vehicle routing problems with time windows, Expert Systems with Applications 40 (5) (2013) 1696–1707,.

Digital Library

[26]

R. Baños, J. Ortega, C. Gil, A.L. Márquez, F. De Toro, A hybrid meta-heuristic for multi-objective Vehicle Routing Problems with Time Windows, Computers and Industrial Engineering 65 (2) (2013) 286–296,.

Digital Library

[27]

M. Barkaoui, J. Berger, A. Boukhtouta, Customer satisfaction in dynamic vehicle routing problem with time windows, Applied Soft Computing Journal 35 (2015) 423–432,.

Digital Library

[28]

M. Barkaoui, M. Gendreau, An adaptive evolutionary approach for real-time vehicle routing and dispatching, Computers and Operations Research 40 (7) (2013) 1766–1776,.

Digital Library

[29]

A.K. Beheshti, S.R. Hejazi, M. Alinaghian, The vehicle routing problem with multiple prioritized time windows: A case study, Computers & Industrial Engineering 90 (2015) 402–413,.

Digital Library

[30]

T. Bektas, G. Erdogan, S. Ropke, Formulations and branch-and-cut algorithms for the generalized vehicle routing problem, Transportation Science 45 (3) (2011) 299–316,.

Digital Library

[31]

P. Belfiore, H.T. Yoshida Yoshizaki, 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) (2009) 750–758,.

[32]

P. Belfiore, H.T.Y. Yoshizaki, Heuristic methods for the fleet size and mix vehicle routing problem with time windows and split deliveries, Computers & Industrial Engineering 64 (2) (2013) 589–601,.

Digital Library

[33]

S. Belhaiza, P. Hansen, G. Laporte, A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows, Computers & Operations Research 52 (2014) 269–281,.

Digital Library

[34]

A.M. Benjamin, J.E. Beasley, Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities, Computers and Operations Research 37 (12) (2010) 2270–2280,.

Digital Library

[35]

M. Berghida, A. Boukra, 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) (2015) 1711–1725,.

[36]

F. Bernardes de Oliveira, R. Enayatifar, H.J. Sadaei, F.G. Guimarães, J. Potvin, 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 (2016) 398–402,.

Digital Library

[37]

S. Binitha, S.S. Sathya, A survey of bio inspired optimization algorithms, International Journal of Soft Computing and Engineering 2 (2) (2012) 137–151.

[38]

Ş.I. Birbil, S.C. Fang, An electromagnetism-like mechanism for global optimization, Journal of Global Optimization 25 (3) (2003) 263–282,.

Digital Library

[39]

C. Blum, A. Roli, Metaheuristics in combinatorial optimization: Overview and conceptual comparison, ACM Computing Surveys 35 (3) (2003) 268–308,.

Digital Library

[40]

L.D. Bodin, A taxonomic structure for vehicle routing and scheduling problems, Computers & Urban Society 1 (1) (1975) 11–29,.

[41]

L. Bodin, B. Golden, Classification in vehicle routing and scheduling, Networks 11 (2) (1981) 97–108,.

[42]

M.C. Bolduc, G. Laporte, J. Renaud, F.F. Boctor, A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars, European Journal of Operational Research 202 (1) (2010) 122–130,.

[43]

I. Boussaïd, J. Lepagnot, P. Siarry, A survey on optimization metaheuristics, Information Sciences 237 (2013) 82–117,.

Digital Library

[44]

M.C. Bouzid, H. Aït Haddadene, S. Salhi, An integration of Lagrangian split and VNS: The case of the capacitated vehicle routing problem, Computers & Operations Research 78 (2017) 513–525,.

Digital Library

[45]

S. Braaten, O. Gjønnes, L.M. Hvattum, G. Tirado, Heuristics for the robust vehicle routing problem with time windows, Expert Systems with Applications 77 (2017) 136–147,.

Digital Library

[46]

K. Braekers, K. Ramaekers, I. Van Nieuwenhuyse, The vehicle routing problem: State of the art classification and review, Computers & Industrial Engineering 99 (2016) 300–313,.

Digital Library

[47]

J. Brandão, A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem, Computers & Operations Research 38 (1) (2011) 140–151,.

Digital Library

[48]

O. Bräysy, P.P. Porkka, W. Dullaert, P.P. Repoussis, C.D. Tarantilis, A well-scalable metaheuristic for the fleet size and mix vehicle routing problem with time windows, Expert Systems with Applications 36 (4) (2009) 8460–8475,.

Digital Library

[49]

J. Brito, F.J. Martínez, J.A. Moreno, J.L. Verdegay, An ACO hybrid metaheuristic for close–open vehicle routing problems with time windows and fuzzy constraints, Applied Soft Computing 32 (2015) 154–163,.

Digital Library

[50]

B.P. Bruck, J.F. Cordeau, M. Iori, A practical time slot management and routing problem for attended home services, Omega (United Kingdom) (2017) 1–12,.

[51]

G.A. Bula, C. Prodhon, F.A. Gonzalez, H.M. Afsar, N. Velasco, Variable neighborhood search to solve the vehicle routing problem for hazardous materials transportation, Journal of Hazardous Materials 324 (2017) 472–480,.

[52]

V. Cacchiani, V.C. Hemmelmayr, F. Tricoire, A set-covering based heuristic algorithm for the periodic vehicle routing problem, Discrete Applied Mathematics 163 (PART 1) (2014) 53–64,.

[53]

A.M. Campbell, J.H. Wilson, Forty years of periodic vehicle routing, Networks 63 (1) (2014) 2–15,.

Digital Library

[54]

E. Cao, M. Lai, The open vehicle routing problem with fuzzy demands, Expert Systems with Applications 37 (3) (2010) 2405–2411,.

Digital Library

[55]

E. Cao, M. Lai, H. Yang, Open vehicle routing problem with demand uncertainty and its robust strategies, Expert Systems with Applications 41 (7) (2014) 3569–3575,.

Digital Library

[56]

B. Çatay, A new saving-based ant algorithm for the Vehicle Routing Problem with simultaneous Pickup and Delivery, Expert Systems with Applications 37 (10) (2010) 6809–6817,.

Digital Library

[57]

D. Cattaruzza, N. Absi, D. Feillet, T. Vidal, A memetic algorithm for the Multi Trip Vehicle Routing Problem, European Journal of Operational Research 236 (3) (2014) 833–848,.

[58]

D. Cattaruzza, N. Absi, D. Feillet, D. Vigo, An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows, Computers & Operations Research 51 (2014) 257–267,.

Digital Library

[59]

C. Çetinkaya, I. Karaoglan, H. Gökçen, 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) (2013) 539–550,.

[60]

P. Chen, H.K. Huang, X.Y. Dong, Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem, Expert Systems with Applications 37 (2) (2010) 1620–1627,.

Digital Library

[61]

Q. Chen, K. Li, Z. Liu, Model and algorithm for an unpaired pickup and delivery vehicle routing problem with split loads, Transportation Research Part E: Logistics and Transportation Review 69 (2014) 218–235,.

[62]

X. Chen, L. Feng, Y. Soon Ong, A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem, International Journal of Systems Science 43 (7) (2012) 1347–1366,.

Digital Library

[63]

C.-B. Cheng, K.-P. Wang, Solving a vehicle routing problem with time windows by a decomposition technique and a genetic algorithm, Expert Systems with Applications 36 (4) (2009) 7758–7763,.

Digital Library

[64]

T.-C. Chiang, W.-H. Hsu, A knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows, Computers & Operations Research 45 (2014) 25–37,.

Digital Library

[65]

G. Ćirović, D. Pamučar, D. Božanić, Green logistic vehicle routing problem: Routing light delivery vehicles in urban areas using a neuro-fuzzy model, Expert Systems with Applications 41 (9) (2014) 4245–4258,.

Digital Library

[66]

J.-F. Cordeau, G. Laporte, M.W.P. Savelsbergh, D. Vigo, Chapter 6 vehicle routing, Handbooks in Operations Research and Management Science (2007) 367–428,.

[67]

J.-F. Cordeau, M. Maischberger, A parallel iterated tabu search heuristic for vehicle routing problems, Computers & Operations Research 39 (9) (2012) 2033–2050,.

Digital Library

[68]

G.B. Dantzig, J.H. Ramser, The truck dispatching problem, Management Science 6 (1) (1959) 80–91,.

Digital Library

[69]

I. Dayarian, T.G. Crainic, M. Gendreau, W. Rei, A branch-and-price approach for a multi-period vehicle routing problem, Computers and Operations Research 55 (2015) 167–184,.

Digital Library

[70]

I. Dayarian, T.G. Crainic, M. Gendreau, W. Rei, An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem, Transportation Research Part E: Logistics and Transportation Review 95 (2016) 95–123,.

[71]

J. de Armas, B. Melián-Batista, Variable neighborhood search for a dynamic rich vehicle routing problem with time windows, Computers & Industrial Engineering 85 (2015) 120–131,.

Digital Library

[72]

F.B. de Oliveira, R. Enayatifar, H.J. Sadaei, F.G. Guimarães, J.-Y. Potvin, A cooperative coevolutionary algorithm for the Multi-Depot Vehicle Routing Problem, Expert Systems with Applications 43 (2016) 117–130,.

Digital Library

[73]

C. Defryn, K. Sörensen, A fast two-level variable neighborhood search for the clustered vehicle routing problem, Computers & Operations Research 83 (2017) 78–94,.

Digital Library

[74]

E. Demir, T. Bektaş, G. Laporte, An adaptive large neighborhood search heuristic for the Pollution-Routing Problem, European Journal of Operational Research 223 (2) (2012) 346–359,.

[75]

E. Demir, T. Bektaş, G. Laporte, The bi-objective Pollution-Routing Problem, European Journal of Operational Research 232 (3) (2014) 464–478,.

[76]

U. Derigs, M. Pullmann, U. Vogel, A short note on applying a simple LS/LNS-based metaheuristic to the rollon–rolloff vehicle routing problem, Computers & Operations Research 40 (3) (2013) 867–872,.

Digital Library

[77]

U. Derigs, M. Pullmann, U. Vogel, Truck and trailer routing - Problems, heuristics and computational experience, Computers and Operations Research 40 (2) (2013) 536–546,.

Digital Library

[78]

M. Desrochers, J.K. Lenstra, M.W.P. Savelsbergh, A classification scheme for vehicle routing and scheduling problems, European Journal of Operational Research 46 (3) (1990) 322–332,.

[79]

O. Dominguez, D. Guimarans, A.A. Juan, I. de la Nuez, A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with Backhauls, European Journal of Operational Research 255 (2) (2016) 442–462,.

[80]

J. Du, X. Li, L. Yu, R. Dan, J. Zhou, Multi-depot vehicle routing problem for hazardous materials transportation: A fuzzy bilevel programming, Information Sciences 399 (2017) 201–218,.

Digital Library

[81]

C. Duhamel, P. Lacomme, C. Prodhon, A hybrid evolutionary local search with depth first search split procedure for the heterogeneous vehicle routing problems, Engineering Applications of Artificial Intelligence 25 (2) (2012) 345–358,.

Digital Library

[82]

J.F. Ehmke, A.M. Campbell, B.W. Thomas, Vehicle routing to minimize time-dependent emissions in urban areas, European Journal of Operational Research 251 (2) (2016) 478–494,.

[83]

B. Eksioglu, A.V. Vural, A. Reisman, The vehicle routing problem: A taxonomic review, Computers & Industrial Engineering 57 (4) (2009) 1472–1483,.

Digital Library

[84]

G. Erdoğan, An open source spreadsheet solver for vehicle routing problems, Computers & Operations Research (2017),.

Digital Library

[85]

A.L. Erera, J.C. Morales, M. Savelsbergh, The vehicle routing problem with stochastic demand and duration constraints, Transportation Science 44 (4) (2010) 474–492,.

Digital Library

[86]

J. Euchi, A. Yassine, H. Chabchoub, The dynamic vehicle routing problem: Solution with hybrid metaheuristic approach, Swarm and Evolutionary Computation 21 (2015) 41–53,.

[87]

C. Expósito-Izquierdo, A. Rossi, M. Sevaux, A Two-Level solution approach to solve the Clustered Capacitated Vehicle Routing Problem, Computers & Industrial Engineering 91 (2016) 274–289,.

Digital Library

[88]

Á. Felipe, M.T. Ortuño, G. Righini, G. Tirado, A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges, Transportation Research Part E: Logistics and Transportation Review 71 (2014) 111–128,.

[89]

A. Felipe, M. Teresa Ortuño, G. Tirado, Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints, European Journal of Operational Research 211 (1) (2011) 66–75,.

[90]

F. Ferrucci, S. Bock, M. Gendreau, 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) (2013) 130–141,.

[91]

C.L. Fleming, S.E. Griffis, J.E. Bell, The effects of triangle inequality on the vehicle routing problem, European Journal of Operational Research 224 (1) (2013) 1–7,.

[92]

K. Fleszar, I.H. Osman, K.S. Hindi, A variable neighbourhood search algorithm for the open vehicle routing problem, European Journal of Operational Research 195 (3) (2009) 803–809,.

[93]

A. Franceschetti, E. Demir, D. Honhon, T. Van Woensel, G. Laporte, M. Stobbe, A metaheuristic for the time-dependent pollution-routing problem, European Journal of Operational Research 259 (3) (2017) 972–991,.

[94]

V. François, Y. Arda, Y. Crama, G. Laporte, Large neighborhood search for multi-trip vehicle routing, European Journal of Operational Research 255 (2) (2016) 422–441,.

[95]

C. Gahm, C. Brabänder, A. Tuma, Vehicle routing with private fleet, multiple common carriers offering volume discounts, and rental options, Transportation Research Part E: Logistics and Transportation Review 97 (2017) 192–216,.

[96]

Y. Gajpal, P. Abad, An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup, Computers and Operations Research 36 (12) (2009) 3215–3223,.

Digital Library

[97]

Y. Gajpal, P.L. Abad, Multi-ant colony system (MACS) for a vehicle routing problem with backhauls, European Journal of Operational Research 196 (1) (2009) 102–117,.

[98]

A. Garcia-Najera, J.A. Bullinaria, An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows, Computers and Operations Research 38 (1) (2011) 287–300,.

Digital Library

[99]

A. García-Nájera, J.A. Bullinaria, M.A. Gutiérrez-Andrade, An evolutionary approach for multi-objective vehicle routing problems with backhauls, Computers & Industrial Engineering 81 (2015) 90–108,.

Digital Library

[100]

C. Gauvin, G. Desaulniers, M. Gendreau, A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands, Computers & Operations Research 50 (2014) 141–153,.

[101]

M. Gendreau, J.-Y. Potvin, Metaheuristics in combinatorial optimization, Annals of Operations Research 140 (1) (2005) 189–213,.

[102]

M. Gendreau, J.-Y. Potvin (Eds.), Handbook of metaheuristics, in: International series in operations research & management science, 2010,.

[103]

M. Gendreau, J.Y. Potvin, O. Bräysy, G. Hasle, A. Løkketangen, Metaheuristics for the vehicle routing problem and its extensions: A categorized bibliography, Operations Research/ Computer Science Interfaces Series 43 (August) (2008) 143–169,.

[104]

K. Ghoseiri, S.F. Ghannadpour, Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm, Applied Soft Computing 30 (2) (2010) 286–296,.

[105]

F. Glover, G.A. Kochenberger (Eds.), Handbook of metaheuristics, in: International series in operations research & management science, 2003,.

[106]

A. Goel, Vehicle scheduling and routing with drivers’ working hours, Transportation Science 43 (1) (2009) 17–26,.

Digital Library

[107]

F.P. Goksal, I. Karaoglan, F. Altiparmak, A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery, Computers & Industrial Engineering 65 (1) (2013) 39–53,.

Digital Library

[108]

B. Golden, S. Raghavan, E. Wasil (Eds.), The vehicle routing problem: Latest advances and new challenges, in: Operations research/computer science interfaces, 2008,.

[109]

J.C. Goodson, J.W. Ohlmann, B.W. Thomas, Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand, European Journal of Operational Research 217 (2) (2012) 312–323,.

[110]

C. Groër, B. Golden, E. Wasil, The consistent vehicle routing problem, Manufacturing & Service Operations Management 11 (4) (2009) 630–643,.

Digital Library

[111]

D. Gulczynski, B. Golden, E. Wasil, The split delivery vehicle routing problem with minimum delivery amounts, Transportation Research Part E: Logistics and Transportation Review 46 (5) (2010) 612–626,.

[112]

D. Gulczynski, B. Golden, E. Wasil, The multi-depot split delivery vehicle routing problem: An integer programming-based heuristic, new test problems, and computational results, Computers & Industrial Engineering 61 (3) (2011) 794–804,.

Digital Library

[113]

D. Gulczynski, B. Golden, E. Wasil, The period vehicle routing problem: New heuristics and real-world variants, Transportation Research Part E: Logistics and Transportation Review 47 (5) (2011) 648–668,.

[114]

M.H. Hà, N. Bostel, A. Langevin, L.-M. Rousseau, An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size, Computers & Operations Research 43 (1) (2014) 9–19,.

Digital Library

[115]

A.F.W. Han, Y.C. Chu, 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 (2016) 11–31,.

[116]

A. Hassanzadeh, M. Rasti-Barzoki, Minimizing total resource consumption and total tardiness penalty in a resource allocation supply chain scheduling and vehicle routing problem, Applied Soft Computing Journal 58 (2017) 307–323,.

[117]

V.C. Hemmelmayr, K.F. Doerner, R.F. Hartl, A variable neighborhood search heuristic for periodic routing problems, European Journal of Operational Research 195 (3) (2009) 791–802,.

[118]

T. Henke, M.G. Speranza, G. Wäscher, The multi-compartment vehicle routing problem with flexible compartment sizes, European Journal of Operational Research 246 (3) (2015) 730–743,.

[119]

G. Hiermann, J. Puchinger, S. Ropke, R.F. Hartl, The electric fleet size and mix vehicle routing problem with time windows and recharging stations, European Journal of Operational Research 252 (3) (2016) 995–1018,.

[120]

S.C. Ho, W.Y. Szeto, GRASP with path relinking for the selective pickup and delivery problem, Expert Systems with Applications 51 (2016) 14–25,.

Digital Library

[121]

A. Hoff, I. Gribkovskaia, G. Laporte, A. Løkketangen, Lasso solution strategies for the vehicle routing problem with pickups and deliveries, European Journal of Operational Research 192 (3) (2009) 755–766,.

[122]

P. Hokama, F.K. Miyazawa, E.C. Xavier, A branch-and-cut approach for the vehicle routing problem with loading constraints, Expert Systems with Applications 47 (2016) 1–13,.

Digital Library

[123]

L. Hong, An improved LNS algorithm for real-time vehicle routing problem with time windows, Computers & Operations Research 39 (2) (2012) 151–163,.

Digital Library

[124]

Z.H. Hu, J.B. Sheu, L. Zhao, C.C. Lu, A dynamic closed-loop vehicle routing problem with uncertainty and incompatible goods, Transportation Research Part C: Emerging Technologies 55 (2015) 273–297,.

[125]

S. Huber, M.J. Geiger, Order matters – A variable neighborhood search for the Swap-body vehicle routing problem, European Journal of Operational Research 263 (2) (2017) 419–445,.

[126]

A. Imran, S. Salhi, N.A. Wassan, A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem, European Journal of Operational Research 197 (2) (2009) 509–518,.

[127]

S. Iqbal, M. Kaykobad, M.S. Rahman, Solving the multi-objective Vehicle Routing Problem with Soft Time Windows with the help of bees, Swarm and Evolutionary Computation 24 (2015) 50–64,.

[128]

O. Jabali, T. Van Woensel, A.G. De Kok, Analysis of travel times and CO2 emissions in time-dependent vehicle routing, Production and Operations Management 21 (6) (2012) 1060–1074,.

[129]

E. Jabir, V.V. Panicker, R. Sridharan, Design and development of a hybrid ant colony-variable neighbourhood search algorithm for a multi-depot green vehicle routing problem, Transportation Research Part D: Transport and Environment 57 (2017) 422–457,.

[130]

J. Janssens, J. Van den Bergh, K. Sörensen, D. Cattrysse, Multi-objective microzone-based vehicle routing for courier companies: From tactical to operational planning, European Journal of Operational Research 242 (1) (2015) 222–231,.

[131]

J. Jiang, K.M. Ng, K.L. Poh, K.M. Teo, Vehicle routing problem with a heterogeneous fleet and time windows, Expert Systems with Applications 41 (8) (2014) 3748–3760,.

Digital Library

[132]

J. Jin, T.G. Crainic, A. Lokketangen, A parallel multi-neighborhood cooperative tabu search for capacitated vehicle routing problems, European Journal of Operational Research 222 (3) (2012) 441–451,.

[133]

J. Jin, T.G. Crainic, A. Løkketangen, A cooperative parallel metaheuristic for the capacitated vehicle routing problem, Computers & Operations Research 44 (2014) 33–41,.

Digital Library

[134]

B. Jose, A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem, European Journal Of Operational Research 195 (2009) 716–728,.

[135]

N. Jozefowiez, F. Semet, E.-G. Talbi, An evolutionary algorithm for the vehicle routing problem with route balancing, European Journal of Operational Research 195 (3) (2009) 761–769,.

[136]

V. Kachitvichyanukul, P. Sombuntham, S. Kunnapapdeelert, Two solution representations for solving multi-depot vehicle routing problem with multiple pickup and delivery requests via PSO, Computers & Industrial Engineering 89 (2015) 125–136,.

Digital Library

[137]

C.B. Kalayci, C. Kaya, An ant colony system empowered variable neighborhood search algorithm for the vehicle routing problem with simultaneous pickup and delivery, Expert Systems with Applications 66 (2016) 163–175,.

Digital Library

[138]

M.G. Karlaftis, K. Kepaptsoglou, E. Sambracos, Containership routing with time deadlines and simultaneous deliveries and pick-ups, Transportation Research Part E: Logistics and Transportation Review 45 (1) (2009) 210–221,.

[139]

Y. Kergosien, C. Lenté, J.-C. Billaut, S. Perrin, Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex, Computers & Operations Research 40 (10) (2013) 2508–2518,.

[140]

M. Keskin, B. Çatay, Partial recharge strategies for the electric vehicle routing problem with time windows, Transportation Research Part C: Emerging Technologies 65 (2016) 111–127,.

[141]

M.R. Khouadjia, B. Sarasola, E. Alba, L. Jourdan, E.G. Talbi, A comparative study between dynamic adapted PSO and VNS for the vehicle routing problem with dynamic requests, Applied Soft Computing Journal 12 (4) (2012) 1426–1439,.

Digital Library

[142]

H. Kim, J. Yang, K.D. Lee, 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) (2009) 291–299,.

[143]

Ç. Koç, T. Bektaş, O. Jabali, G. Laporte, A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows, Computers & Operations Research 64 (2015) 11–27,.

Digital Library

[144]

Ç. Koç, I. Karaoglan, The green vehicle routing problem: A heuristic based exact solution approach, Applied Soft Computing 39 (2016) 154–164,.

Digital Library

[145]

A. Kourank Beheshti, S.R. Hejazi, A novel hybrid column generation-metaheuristic approach for the vehicle routing problem with general soft time window, Information Sciences 316 (2015) 598–615,.

Digital Library

[146]

A.A. Kovacs, S.N. Parragh, R.F. Hartl, The multi-objective generalized consistent vehicle routing problem, European Journal of Operational Research 247 (2) (2015) 441–458,.

[147]

R. Kramer, A. Subramanian, T. Vidal, L.D.A.F. Cabral, A matheuristic approach for the Pollution-Routing Problem, European Journal of Operational Research 243 (2) (2015) 523–539,.

[148]

S. Krichen, S. Faiz, T. Tlili, K. Tej, Tabu-based GIS for solving the vehicle routing problem, Expert Systems with Applications 41 (14) (2014) 6483–6493,.

[149]

İ. Küçükoğlu, N. Öztürk, An advanced hybrid meta-heuristic algorithm for the vehicle routing problem with backhauls and time windows, Computers & Industrial Engineering 86 (2015) 60–68,.

Digital Library

[150]

R.S. Kumar, K. Kondapaneni, V. Dixit, A. Goswami, L.S. Thakur, M.K. Tiwari, Multi-objective modeling of production and pollution routing problem with time window: A self-learning particle swarm optimization approach, Computers & Industrial Engineering 99 (2016) 29–40,.

Digital Library

[151]

R.J. Kuo, B.S. Wibowo, F.E. Zulvia, Application of a fuzzy ant colony system to solve the dynamic vehicle routing problem with uncertain service time, Applied Mathematical Modelling (2016) 1–12,.

[152]

Y. Kuo, Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem, Computers and Industrial Engineering 59 (1) (2010) 157–165,.

Digital Library

[153]

Y. Kuo, C.C. Wang, A variable neighborhood search for the multi-depot vehicle routing problem with loading cost, Expert Systems with Applications 39 (8) (2012) 6949–6954,.

Digital Library

[154]

Y. Kuo, C.C. Wang, P.Y. Chuang, Optimizing goods assignment and the vehicle routing problem with time-dependent travel speeds, Computers and Industrial Engineering 57 (4) (2009) 1385–1392,.

Digital Library

[155]

Y.J. Kwon, Y.J. Choi, D.H. Lee, Heterogeneous fixed fleet vehicle routing considering carbon emission, Transportation Research Part D: Transport and Environment 23 (2013) 81–89,.

[156]

D.S.W. Lai, O. Caliskan Demirag, J.M.Y. Leung, A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph, Transportation Research Part E: Logistics and Transportation Review 86 (2016) 32–52,.

[157]

H. Lei, G. Laporte, B. Guo, The capacitated vehicle routing problem with stochastic demands and time windows, Computers and Operations Research 38 (12) (2011) 1775–1783,.

Digital Library

[158]

S.C.H. Leung, Z. Zhang, D. Zhang, X. Hua, M.K. Lim, A meta-heuristic algorithm for heterogeneous fleet vehicle routing problems with two-dimensional loading constraints, European Journal of Operational Research 225 (2) (2013) 199–210,.

[159]

J. Li, P.M. Pardalos, H. Sun, J. Pei, Y. Zhang, Iterated local search embedded adaptive neighborhood selection approach for the multi-depot vehicle routing problem with simultaneous deliveries and pickups, Expert Systems with Applications 42 (7) (2015) 3551–3561,.

Digital Library

[160]

K. Li, H. Tian, A two-level self-adaptive variable neighborhood search algorithm for the prize-collecting vehicle routing problem, Applied Soft Computing 43 (2016) 469–479,.

Digital Library

[161]

X. Li, S.C.H. Leung, P. Tian, A multistart adaptive memory-based tabu search algorithm for the heterogeneous fixed fleet open vehicle routing problem, Expert Systems with Applications 39 (1) (2012) 365–374,.

Digital Library

[162]

X. Li, P. Tian, Y.P. Aneja, An adaptive memory programming metaheuristic for the heterogeneous fixed fleet vehicle routing problem, Transportation Research Part E: Logistics and Transportation Review 46 (6) (2010) 1111–1127,.

[163]

X. Li, P. Tian, S.C.H. Leung, Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm, International Journal of Production Economics 125 (1) (2010) 137–145,.

[164]

T.-Y. Liao, T.-Y. Hu, An object-oriented evaluation framework for dynamic vehicle routing problems under real-time information, Expert Systems with Applications 38 (10) (2011) 12548–12558,.

Digital Library

[165]

C. Lin, K.L. Choy, G.T.S. Ho, S.H. Chung, H.Y. Lam, Survey of green vehicle routing problem: Past and future trends, Expert Systems with Applications 41 (4) (2014) 1118–1138,.

Digital Library

[166]

J.-L. Lin, C.-H. Wu, H.-Y. Chung, Performance comparison of electromagnetism-like algorithms for global optimization, Applied Mathematics 3 (10) (2012) 1265–1275,.

[167]

S.W. Lin, Z.J. Lee, K.C. Ying, C.Y. Lee, Applying hybrid meta-heuristics for capacitated vehicle routing problem, Expert Systems with Applications 36 (2 PART 1) (2009) 1505–1512,.

Digital Library

[168]

S.W. Lin, V.F. Yu, S.Y. Chou, Solving the truck and trailer routing problem based on a simulated annealing heuristic, Computers and Operations Research 36 (5) (2009) 1683–1692,.

Digital Library

[169]

R. Liu, Z. Jiang, The close-open mixed vehicle routing problem, European Journal of Operational Research 220 (2) (2012) 349–360,.

[170]

R. Liu, X. Xie, V. Augusto, C. Rodriguez, 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) (2013) 475–486,.

[171]

S. Liu, A hybrid population heuristic for the heterogeneous vehicle routing problems, Transportation Research Part E: Logistics and Transportation Review 54 (2013) 67–78,.

[172]

S. Liu, W. Huang, H. Ma, An effective genetic algorithm for the fleet size and mix vehicle routing problems, Transportation Research Part E: Logistics and Transportation Review 45 (3) (2009) 434–445,.

[173]

C.-C. Lu, V.F. Yu, 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) (2012) 520–529,.

Digital Library

[174]

J. Luo, M.R. Chen, Improved Shuffled Frog Leaping Algorithm and its multi-phase model for multi-depot vehicle routing problem, Expert Systems with Applications 41 (5) (2014) 2535–2545,.

Digital Library

[175]

J. Luo, X. Li, M.-R. Chen, H. Liu, A novel hybrid shuffled frog leaping algorithm for vehicle routing problem with time windows, Information Sciences 316 (April) (2015) 266–292,.

Digital Library

[176]

Z. Luo, H. Qin, C. Che, A. Lim, On service consistency in multi-period vehicle routing, European Journal of Operational Research 243 (3) (2015) 731–744,.

[177]

Z. Luo, H. Qin, D. Zhang, A. Lim, Adaptive large neighborhood search heuristics for the vehicle routing problem with stochastic demands and weight-related cost, Transportation Research Part E: Logistics and Transportation Review 85 (2016) 69–89,.

[178]

H. Ma, B. Cheang, A. Lim, L. Zhang, Y. Zhu, An investigation into the vehicle routing problem with time windows and link capacity constraints, Omega 40 (3) (2012) 336–347,.

[179]

Z.J. Ma, Y. Wu, Y. Dai, A combined order selection and time-dependent vehicle routing problem with time widows for perishable product delivery, Computers and Industrial Engineering 114 (October) (2017) 101–113,.

Digital Library

[180]

W. Maden, R. Eglese, D. Black, Vehicle routing and scheduling with time-varying data: A case study, Journal of the Operational Research Society 61 (S3) (2010) 515–522,.

[181]

S. Mancini, 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 (2016) 100–112,.

[182]

S. Mancini, The hybrid vehicle routing problem, Transportation Research Part C: Emerging Technologies 78 (2017) 1–12,.

[183]

J. Mańdziuk, A. Żychowski, A memetic approach to vehicle routing problem with dynamic requests, Applied Soft Computing 48 (2016) 522–534,.

Digital Library

[184]

D. Männel, A. Bortfeldt, A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints, European Journal of Operational Research 254 (3) (2016) 840–858,.

[185]

M. Marinaki, Y. Marinakis, A Glowworm swarm optimization algorithm for the vehicle routing problem with stochastic demands, Expert Systems with Applications 46 (2016) 145–163,.

Digital Library

[186]

Y. Marinakis, Multiple phase neighborhood search-GRASP for the capacitated vehicle routing problem, Expert Systems with Applications 39 (8) (2012) 6807–6815,.

Digital Library

[187]

Y. Marinakis, G.-R. Iordanidou, M. Marinaki, Particle swarm optimization for the vehicle routing problem with stochastic demands, Applied Soft Computing Journal 13 (4) (2013) 1693–1704,.

Digital Library

[188]

Y. Marinakis, M. Marinaki, A hybrid genetic – Particle Swarm Optimization Algorithm for the vehicle routing problem, Expert Systems with Applications 37 (2) (2010) 1446–1455,.

Digital Library

[189]

Y. Marinakis, M. Marinaki, A bumble bees mating optimization algorithm for the open vehicle routing problem, Swarm and Evolutionary Computation 15 (2014) 80–94,.

[190]

Y. Marinakis, M. Marinaki, Combinatorial neighborhood topology bumble bees mating optimization for the vehicle routing problem with stochastic demands, Soft Computing 19 (2) (2015) 353–373,.

Digital Library

[191]

Y. Marinakis, M. Marinaki, G. Dounias, A hybrid particle swarm optimization algorithm for the vehicle routing problem, Engineering Applications of Artificial Intelligence 23 (4) (2010) 463–472,.

Digital Library

[192]

G. Mattos Ribeiro, G. Laporte, An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem, Computers and Operations Research 39 (3) (2012) 728–735,.

Digital Library

[193]

M.E. McNabb, J.D. Weir, R.R. Hill, S.N. Hall, Testing local search move operators on the vehicle routing problem with split deliveries and time windows, Computers and Operations Research 56 (2015) 93–109,.

Digital Library

[194]

J.E. Mendoza, B. Castanier, C. Guéret, A.L. Medaglia, N. Velasco, A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands, Computers & Operations Research 37 (11) (2010) 1886–1898,.

Digital Library

[195]

J.E. Mendoza, A.L. Medaglia, N. Velasco, An evolutionary-based decision support system for vehicle routing: The case of a public utility, Decision Support Systems 46 (3) (2009) 730–742,.

Digital Library

[196]

J. Michallet, C. Prins, L. Amodeo, F. Yalaoui, G. Vitry, 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) (2014) 196–207,.

Digital Library

[197]

D.M. Miranda, S.V. Conceição, The vehicle routing problem with hard time windows and stochastic travel and service time, Expert Systems with Applications 64 (2016) 104–116,.

Digital Library

[198]

S.A. Mirhassani, N. Abolghasemi, A particle swarm optimization algorithm for open vehicle routing problem, Expert Systems with Applications 38 (9) (2011) 11547–11551,.

Digital Library

[199]

B.F. Moghaddam, R. Ruiz, S.J. Sadjadi, Vehicle routing problem with uncertain demands: An advanced particle swarm algorithm, Computers and Industrial Engineering 62 (1) (2012) 306–317,.

Digital Library

[200]

J.R. Montoya-Torres, J. López Franco, S. Nieto Isaza, H. Felizzola Jiménez, N. Herazo-Padilla, A literature review on the vehicle routing problem with multiple depots, Computers & Industrial Engineering 79 (2015) 115–129,.

[201]

A. Montoya, C. Guéret, J.E. Mendoza, J.G. Villegas, The electric vehicle routing problem with nonlinear charging function, Transportation Research Part B: Methodological (2017) 1–10,.

[202]

I. Moon, J.H. Lee, J. Seong, Vehicle routing problem with time windows considering overtime and outsourcing vehicles, Expert Systems with Applications 39 (18) (2012) 13202–13213,.

Digital Library

[203]

R. Moretti Branchini, V. Amaral Armentano, A. Løkketangen, Adaptive granular local search heuristic for a dynamic vehicle routing problem, Computers and Operations Research 36 (11) (2009) 2955–2968,.

Digital Library

[204]

M. Moshref-Javadi, S. Lee, The customer-centric, multi-commodity vehicle routing problem with split delivery, Expert Systems with Applications 56 (2016) 335–348,.

Digital Library

[205]

S. Mouthuy, F. Massen, Y. Deville, P. Van Hentenryck, A multistage very large-scale neighborhood search for the vehicle routing problem with soft time windows, Transportation Science 49 (2) (2015) 223–238,.

Digital Library

[206]

L. Muyldermans, G. Pang, On the benefits of co-collection: Experiments with a multi-compartment vehicle routing algorithm, European Journal of Operational Research 206 (1) (2010) 93–103,.

[207]

M. Naderipour, M. Alinaghian, Measurement, evaluation and minimization of CO2, NOx, and CO emissions in the open time dependent vehicle routing problem, Measurement: Journal of the International Measurement Confederation 90 (x) (2016) 443–452,.

[208]

Y. Nagata, O. Bräysy, W. Dullaert, A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows, Computers and Operations Research 37 (4) (2010) 724–737,.

Digital Library

[209]

G. Nagy, N.A. Wassan, M.G. Speranza, C. Archetti, The vehicle routing problem with divisible deliveries and pickups, Transportation Science 49 (2) (2015) 271–294,.

Digital Library

[210]

H. Nazif, L.S. Lee, Optimised crossover genetic algorithm for capacitated vehicle routing problem, Applied Mathematical Modelling 36 (5) (2012) 2110–2117,.

[211]

K.K.H. Ng, C.K.M. Lee, S.Z. Zhang, K. Wu, W. Ho, 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 (2017) 151–168,.

[212]

S.U. Ngueveu, C. Prins, R. Wolfler Calvo, An effective memetic algorithm for the cumulative capacitated vehicle routing problem, Computers and Operations Research 37 (11) (2010) 1877–1885,.

Digital Library

[213]

P.K. Nguyen, T.G. Crainic, M. Toulouse, A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows, European Journal of Operational Research 231 (1) (2013) 43–56,.

[214]

V.A. Nguyen, J. Jiang, K.M. Ng, K.M. Teo, Satisficing measure approach for vehicle routing problem with time windows under uncertainty, European Journal of Operational Research 248 (2) (2016) 404–414,.

[215]

N. Norouzi, R. Tavakkoli-Moghaddam, M. Ghazanfari, M. Alinaghian, A. Salamatbakhsh, A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization, Networks and Spatial Economics 12 (4) (2012) 609–633,.

[216]

N. Norouzi, M. Sadegh-Amalnick, M. Alinaghiyan, Evaluating of the particle swarm optimization in a periodic vehicle routing problem, Measurement 62 (2015) 162–169,.

[217]

M. Okulewicz, J. Mańdziuk, The impact of particular components of the PSO-based algorithm solving the Dynamic Vehicle Routing Problem, Applied Soft Computing Journal 58 (2017) 586–604,.

[218]

E. Osaba, R. Carballedo, F. Diaz, A. Perallos, 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) (2013) 5425–5426,.

[219]

I.H. Osman, G. Laporte, Metaheuristics: A bibliography, Annals of Operations Research 63 (5) (1996) 511–623,.

[220]

D. Palhazi Cuervo, P. Goos, K. Sörensen, E. Arráiz, An iterated local search algorithm for the vehicle routing problem with backhauls, European Journal of Operational Research 237 (2) (2014) 454–464,.

[221]

S.N. Parragh, J.-F. Cordeau, Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows, Computers & Operations Research 83 (2017) 28–44,.

Digital Library

[222]

S.N. Parragh, K.F. Doerner, R.F. Hartl, A survey on pickup and delivery problems Part I: Transportation between customers and depot, Journal Für Betriebswirtschaft 58 (1) (2008) 21–51,.

[223]

S.N. Parragh, K.F. Doerner, R.F. Hartl, A survey on pickup and delivery problems Part II: Transportation between pickup and delivery locations, Journal Für Betriebswirtschaft 58 (2) (2008) 81–117,.

[224]

P.H.V. Penna, A. Subramanian, L.S. Ochi, An iterated local search heuristic for the heterogeneous fleet vehicle routing problem, Journal of Heuristics 19 (2) (2013) 201–232,.

Digital Library

[225]

T.A. Pham, M. Hoàng Hà, X.H. Nguyen, Solving the multi-vehicle multi-covering tour problem, Computers and Operations Research 88 (2017) 258–278,.

Digital Library

[226]

D.M. Pierre, N. Zakaria, Stochastic partially optimized cyclic shift crossover for multi-objective genetic algorithms for the vehicle routing problem with time-windows, Applied Soft Computing Journal 52 (2017) 863–876,.

Digital Library

[227]

D. Pisinger, S. Ropke, Large neighborhood search, International Series in Operations Research & Management Science (2010) 399–419,.

[228]

O. Polat, A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups, Computers and Operations Research 85 (2017) 71–86,.

Digital Library

[229]

O. Polat, C.B. Kalayci, O. Kulak, H.-O. Günther, A perturbation based variable neighborhood search heuristic for solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery with Time Limit, European Journal of Operational Research 242 (2) (2015) 369–382,.

[230]

P.C. Pop, O. Matei, C.P. Sitar, An improved hybrid algorithm for solving the generalized vehicle routing problem, Neurocomputing 109 (2013) 76–83,.

Digital Library

[231]

L. Pradenas, B. Oportus, V. Parada, Mitigation of greenhouse gas emissions in vehicle routing problems with backhauling, Expert Systems with Applications 40 (8) (2013) 2985–2991,.

Digital Library

[232]

E. Prescott-Gagnon, G. Desaulniers, M. Drexl, L.-M. Rousseau, European driver rules in vehicle routing with time windows, Transportation Science 44 (4) (2010) 455–473,.

Digital Library

[233]

Eric Prescott-Gagnon, G. Desaulniers, L.-M. Rousseau, A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows, Networks 54 (4) (2009) 190–204,.

[234]

C. Prins, Two memetic algorithms for heterogeneous fleet vehicle routing problems, Engineering Applications of Artificial Intelligence 22 (6) (2009) 916–928,.

Digital Library

[235]

V. Pureza, R. Morabito, M. Reimann, Vehicle routing with multiple deliverymen: Modeling and heuristic approaches for the VRPTW, European Journal of Operational Research 218 (3) (2012) 636–647,.

[236]

M. Qi, W.-H. Lin, N. Li, L. Miao, A spatiotemporal partitioning approach for large-scale vehicle routing problems with time windows, Transportation Research Part E: Logistics and Transportation Review 48 (1) (2012) 248–257,.

[237]

Y. Qi, Z. Hou, H. Li, J. Huang, X. Li, A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows, Computers & Operations Research 62 (3) (2015) 61–77,.

Digital Library

[238]

J. Qian, R. Eglese, Fuel emissions optimization in vehicle routing problems with time-varying speeds, European Journal of Operational Research 248 (3) (2016) 840–848,.

[239]

M.-E. Rancourt, J.-F. Cordeau, G. Laporte, Long-Haul vehicle routing and scheduling with working hour rules, Transportation Science 47 (1) (2013) 81–107,.

Digital Library

[240]

Y. Ren, M. Dessouky, F. Ordóñez, The multi-shift vehicle routing problem with overtime, Computers & Operations Research 37 (11) (2010) 1987–1998,.

Digital Library

[241]

P.P. Repoussis, C.D. Tarantilis, Solving the fleet size and mix vehicle routing problem with time windows via adaptive memory programming, Transportation Research Part C: Emerging Technologies 18 (5) (2010) 695–712,.

[242]

P.P. Repoussis, C.D. Tarantilis, O. Bräysy, G. Ioannou, A hybrid evolution strategy for the open vehicle routing problem, Computers and Operations Research 37 (3) (2010) 443–455,.

Digital Library

[243]

S. Salhi, A. Imran, N.A. Wassan, The multi-depot vehicle routing problem with heterogeneous vehicle fleet: Formulation and a variable neighborhood search implementation, Computers & Operations Research 52 (2014) 315–325,.

Digital Library

[244]

L. Santos, J. Coutinho-Rodrigues, C.H. Antunes, A web spatial decision support system for vehicle routing using Google Maps, Decision Support Systems 51 (1) (2011) 1–9,.

Digital Library

[245]

M. Schneider, The vehicle-routing problem with time windows and driver-specific times, European Journal of Operational Research 250 (1) (2016) 101–119,.

[246]

M. Schneider, B. Sand, A. Stenger, A note on the time travel approach for handling time windows in vehicle routing problems, Computers and Operations Research 40 (10) (2013) 2564–2568,.

[247]

M. Schneider, A. Stenger, D. Goeke, The electric vehicle-routing problem with time windows and recharging stations, Transportation Science (2014),.

Digital Library

[248]

A.Z. Şevkli, B. Güler, A multi-phase oscillated variable neighbourhood search algorithm for a real-world open vehicle routing problem, Applied Soft Computing Journal 58 (2017) 128–144,.

[249]

H. Seyyedhasani, J.S. Dvorak, Using the Vehicle Routing Problem to reduce field completion times with multiple machines, Computers and Electronics in Agriculture 134 (2017) 142–150,.

Digital Library

[250]

Y. Shi, T. Boudouh, O. Grunder, A hybrid genetic algorithm for a home health care routing problem with time window and fuzzy demand, Expert Systems with Applications 72 (2017) 160–176,.

Digital Library

[251]

J.A. Sicilia, C. Quemada, B. Royo, D. Escuín, 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 (2016) 468–477,.

Digital Library

[252]

M.M. Silva, A. Subramanian, L.S. Ochi, An iterated local search heuristic for the split delivery vehicle routing problem, Computers & Operations Research 53 (2015) 234–249,.

[253]

P.V. Silvestrin, M. Ritt, An iterated tabu search for the multi-compartment vehicle routing problem, Computers & Operations Research 81 (2017) 192–202,.

Digital Library

[254]

E. Solano-Charris, C. Prins, A.C. Santos, Local search based metaheuristics for the robust vehicle routing problem with discrete scenarios, Applied Soft Computing Journal 32 (2015) 518–531,.

Digital Library

[255]

K. Sörensen, P. Schittekat, Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem, Computers and Operations Research 40 (12) (2013) 3197–3205,.

Digital Library

[256]

M. Soto, M. Sevaux, A. Rossi, A. Reinholz, Multiple neighborhood search, tabu search and ejection chains for the multi-depot open vehicle routing problem, Computers and Industrial Engineering 107 (2017) 211–222,.

Digital Library

[257]

R. Spliet, G. Desaulniers, The discrete time window assignment vehicle routing problem, European Journal of Operational Research 244 (2) (2015) 379–391,.

[258]

A. Stenger, D. Vigo, S. Enz, M. Schwind, An adaptive variable neighborhood search algorithm for a vehicle routing problem arising in small package shipping, Transportation Science 47 (1) (2013) 64–80,.

Digital Library

[259]

A. Subramanian, L.M.A. Drummond, C. Bentes, L.S. Ochi, R. Farias, A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery, Computers and Operations Research 37 (11) (2010) 1899–1911,.

Digital Library

[260]

A. Subramanian, P.H.V. Penna, E. Uchoa, L.S. Ochi, A hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem, European Journal of Operational Research 221 (2) (2012) 285–295,.

[261]

A. Subramanian, E. Uchoa, L.S. Ochi, A hybrid algorithm for a class of vehicle routing problems, Computers & Operations Research 40 (10) (2013) 2519–2531,.

[262]

Y. Suzuki, A dual-objective metaheuristic approach to solve practical pollution routing problem, International Journal of Production Economics 176 (2016) 143–153,.

[263]

J.F. Sze, S. Salhi, N. Wassan, The cumulative capacitated vehicle routing problem with min-sum and min-max objectives: An effective hybridisation of adaptive variable neighbourhood search and large neighbourhood search, Transportation Research Part B: Methodological 101 (2017) 162–184,.

[264]

J. Sze, S. Salhi, N. Wassan, A hybridisation of adaptive variable neighbourhood search and large neighbourhood search: Application to the vehicle routing problem, Expert Systems With Applications 65 (2016) 383–397,.

Digital Library

[265]

W.Y. Szeto, Y. Wu, S.C. Ho, An artificial bee colony algorithm for the capacitated vehicle routing problem, European Journal of Operational Research 215 (1) (2011) 126–135,.

[266]

L. Talarico, J. Springael, K. Sörensen, F. Talarico, A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem, Computers & Operations Research 78 (2017) 547–556,.

Digital Library

[267]

J. Tang, Y. Ma, J. Guan, C. Yan, A Max-Min Ant System for the split delivery weighted vehicle routing problem, Expert Systems with Applications 40 (18) (2013) 7468–7477,.

[268]

J. Tang, J. Zhang, Z. Pan, A scatter search algorithm for solving vehicle routing problem with loading cost, Expert Systems with Applications 37 (6) (2010) 4073–4083,.

Digital Library

[269]

C.D. Tarantilis, F. Stavropoulou, P.P. Repoussis, A template-based Tabu Search algorithm for the Consistent Vehicle Routing Problem, Expert Systems with Applications 39 (4) (2012) 4233–4239,.

Digital Library

[270]

Christos D. Tarantilis, A.K. Anagnostopoulou, P.P. Repoussis, Adaptive path relinking for vehicle routing and scheduling problems with product returns, Transportation Science 47 (April 2016) (2013) 356–379,.

Digital Library

[271]

D. Taş, N. Dellaert, T. van Woensel, T. de Kok, Vehicle routing problem with stochastic travel times including soft time windows and service costs, Computers & Operations Research 40 (1) (2013) 214–224,.

Digital Library

[272]

D. Taş, N. Dellaert, T. van Woensel, T. de Kok, The time-dependent vehicle routing problem with soft time windows and stochastic travel times, Transportation Research Part C: Emerging Technologies 48 (2014) 66–83,.

[273]

D. Taş, O. Jabali, T. Van Woensel, A vehicle routing problem with flexible time windows. Computers and, Operations Research 52 (PART A) (2014) 39–54,.

Digital Library

[274]

A.S. Tasan, M. Gen, A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries, Computers & Industrial Engineering 62 (3) (2012) 755–761,.

Digital Library

[275]

E. Teymourian, V. Kayvanfar, G.M. Komaki, M. Zandieh, Enhanced intelligent water drops and cuckoo search algorithms for solving the capacitated vehicle routing problem, Information Sciences 334–335 (2016) 354–378,.

Digital Library

[276]

C.K. Ting, X.L. Liao, Y.H. Huang, R.T. Liaw, Multi-vehicle selective pickup and delivery using metaheuristic algorithms, Information Sciences 406–407 (2017) 146–169,.

Digital Library

[277]

R. Todosijević, S. Hanafi, D. Urošević, B. Jarboui, B. Gendron, A general variable neighborhood search for the swap-body vehicle routing problem, Computers & Operations Research 78 (2017) 468–479,.

Digital Library

[278]

W. Tu, Z. Fang, Q. Li, S.-L. Shaw, B. Chen, 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 (2014) 84–97,.

[279]

G.Y. Tütüncü, An interactive GRAMPS algorithm for the heterogeneous fixed fleet vehicle routing problem with and without backhauls, European Journal of Operational Research 201 (2) (2010) 593–600,.

[280]

E. Uchoa, D. Pecin, A. Pessoa, M. Poggi, T. Vidal, A. Subramanian, New benchmark instances for the Capacitated Vehicle Routing Problem, European Journal of Operational Research 257 (3) (2017) 845–858,.

[281]

C.A. Valle, L.C. Martinez, A.S. da Cunha, G.R. Mateus, Heuristic and exact algorithms for a min–max selective vehicle routing problem, Computers & Operations Research 38 (7) (2011) 1054–1065,.

Digital Library

[282]

K. Venkata Narasimha, E. Kivelevitch, B. Sharma, M. Kumar, An ant colony optimization technique for solving min–max Multi-Depot Vehicle Routing Problem, Swarm and Evolutionary Computation 13 (2013) 63–73,.

[283]

T. Vidal, M. Battarra, A. Subramanian, G. Erdogˇan, Hybrid metaheuristics for the Clustered Vehicle Routing Problem, Computers & Operations Research 58 (2015) 87–99,.

Digital Library

[284]

T. Vidal, T.G. Crainic, M. Gendreau, C. Prins, A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows, Computers & Operations Research 40 (1) (2013) 475–489,.

Digital Library

[285]

T. Vidal, T.G. Crainic, M. Gendreau, C. Prins, Implicit depot assignments and rotations in vehicle routing heuristics, European Journal of Operational Research 237 (1) (2014) 15–28,.

[286]

T. Vidal, T. Crainic, M. Gendreau, N. Lahnrichi, W. Rei, A hybrid genetic algorithm for multi-depot and periodic vehicle routing problems, Operations Research 60 (3) (2012) 611–624,.

Digital Library

[287]

J.G. Villegas, C. Prins, C. Prodhon, A.L. Medaglia, N. Velasco, A GRASP with evolutionary path relinking for the truck and trailer routing problem, Computers and Operations Research 38 (9) (2011) 1319–1334,.

Digital Library

[288]

J.G. Villegas, C. Prins, C. Prodhon, A.L. Medaglia, N. Velasco, A matheuristic for the truck and trailer routing problem, European Journal of Operational Research 230 (2) (2013) 231–244,.

[289]

C.-H. Wang, J.-Z. Lu, A hybrid genetic algorithm that optimizes capacitated vehicle routing problems, Expert Systems with Applications 36 (2) (2009) 2921–2936,.

Digital Library

[290]

C. Wang, D. Mu, F. Zhao, J.W. Sutherland, A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup–delivery and time windows, Computers & Industrial Engineering 83 (2015) 111–122,.

Digital Library

[291]

Z. Wang, Y. Li, X. Hu, A heuristic approach and a tabu search for the heterogeneous multi-type fleet vehicle routing problem with time windows and an incompatible loading constraint, Computers & Industrial Engineering 89 (2015) 162–176,.

Digital Library

[292]

N. Wassan, N. Wassan, G. Nagy, S. Salhi, The multiple trip vehicle routing problem with backhauls: Formulation and a two-level variable neighbourhood search, Computers & Operations Research 78 (2017) 454–467,.

Digital Library

[293]

L. Wei, Z. Zhang, D. Zhang, A. Lim, A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints, European Journal of Operational Research 243 (3) (2015) 798–814,.

[294]

M. Wen, J.F. Cordeau, G. Laporte, J. Larsen, The dynamic multi-period vehicle routing problem, Computers and Operations Research 37 (9) (2010) 1615–1623,.

Digital Library

[295]

L. Wu, M. Hifi, H. Bederina, A new robust criterion for the vehicle routing problem with uncertain travel time, Computers & Industrial Engineering 112 (2017) 607–615,.

Digital Library

[296]

W. Wu, Y. Tian, T. Jin, A label based ant colony algorithm for heterogeneous vehicle routing with mixed backhaul, Applied Soft Computing Journal 47 (2016) 224–234,.

Digital Library

[297]

J. Wy, B.I. Kim, A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem, Computers and Operations Research 40 (8) (2013) 1947–1952,.

Digital Library

[298]

J. Wy, B. Kim, S. Kim, The rollon – rolloff waste collection vehicle routing problem with time windows, European Journal of Operational Research 224 (3) (2013) 466–476,.

[299]

Y. Xiao, A. Konak, A genetic algorithm with exact dynamic programming for the green vehicle routing & scheduling problem, Journal of Cleaner Production 167 (2017) 1450–1463,.

[300]

D. Xu, K. Li, X. Zou, L. Liu, An unpaired pickup and delivery vehicle routing problem with multi-visit, Transportation Research Part E: Logistics and Transportation Review 103 (2017) 218–247,.

[301]

J. Xu, F. Yan, S. Li, Vehicle routing optimization with soft time windows in a fuzzy random environment, Transportation Research Part E: Logistics and Transportation Review 47 (6) (2011) 1075–1091,.

[302]

S.-H. Xu, J.-P. Liu, F.-H. Zhang, L. Wang, L.-J. Sun, A combination of genetic algorithm and particle swarm optimization for vehicle routing problem with time windows, Sensors 15 (9) (2015) 21033–21053,.

[303]

E. Yakıcı, A heuristic approach for solving a rich min-max vehicle routing problem with mixed fleet and mixed demand, Computers and Industrial Engineering 109 (2017) 288–294,.

[304]

X.-S. Yang, M. Karamanoglu, Swarm intelligence and bio-inspired computation. Swarm intelligence and bio-inspired, Computation (2013) 3–23,.

[305]

E.T. Yassen, M. Ayob, M.Z.A. Nazri, N.R. Sabar, An adaptive hybrid algorithm for vehicle routing problems with time windows, Computers and Industrial Engineering 113 (September) (2017) 382–391,.

Digital Library

[306]

G. Yazgi Tütüncü, C.A.C. Carreto, B.M. Baker, A visual interactive approach to classical and mixed vehicle routing problems with backhauls, Omega 37 (1) (2009) 138–154,.

[307]

B. Yu, Z.Z. Yang, B.Z. Yao, A hybrid algorithm for vehicle routing problem with time windows, Expert Systems with Applications 38 (1) (2011) 435–441,.

Digital Library

[308]

B. Yu, Z.-Z. Yang, J.-X. Xie, A parallel improved ant colony optimization for multi-depot vehicle routing problem, Journal of the Operational Research Society 62 (1) (2011) 183–188,.

[309]

B. Yu, Z.Z. Yang, An ant colony optimization model: The period vehicle routing problem with time windows, Transportation Research Part E: Logistics and Transportation Review 47 (2) (2011) 166–181,.

[310]

B. Yu, Z.Z. Yang, B. Yao, An improved ant colony optimization for vehicle routing problem, European Journal of Operational Research 196 (1) (2009) 171–176,.

[311]

M. Yu, X. Qi, A vehicle routing problem with multiple overlapped batches, Transportation Research Part E: Logistics and Transportation Review 61 (2014) 40–55,.

[312]

S. Yu, C. Ding, K. Zhu, A hybrid GA-TS algorithm for open vehicle routing optimization of coal mines material, Expert Systems with Applications 38 (8) (2011) 10568–10573,.

Digital Library

[313]

V.F. Yu, A.A.N.P. Redi, Y.A. Hidayat, O.J. Wibowo, A simulated annealing heuristic for the hybrid vehicle routing problem, Applied Soft Computing 53 (2017) 119–132,.

Digital Library

[314]

G.N. Yücenur, N.Ç. Demirel, A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem, Expert Systems with Applications 38 (9) (2011) 11859–11865,.

Digital Library

[315]

A. Yurtkuran, E. Emel, A new Hybrid Electromagnetism-like Algorithm for capacitated vehicle routing problems, Expert Systems with Applications 37 (4) (2010) 3427–3433,.

Digital Library

[316]

E.E. Zachariadis, C.D. Tarantilis, C.T. Kiranoudis, A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service, Expert Systems with Applications 36 (2 PART 1) (2009) 1070–1081,.

Digital Library

[317]

E.E. Zachariadis, C.D. Tarantilis, C.T. Kiranoudis, An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries, European Journal of Operational Research 202 (2) (2010) 401–411,.

[318]

E. Zare-Reisabadi, S. Hamid Mirmohammadi, Site dependent vehicle routing problem with soft time window: Modeling and solution approach, Computers and Industrial Engineering 90 (2015) 177–185,.

Digital Library

[319]

D. Zhang, S. Cai, F. Ye, Y. Si, T.T. Nguyen, A hybrid algorithm for a vehicle routing problem with realistic constraints, Information Sciences 394–395 (2017) 167–182,.

Digital Library

[320]

J. Zhang, Y. Zhao, W. Xue, J. Li, Vehicle routing problem with fuel consumption and carbon emission, International Journal of Production Economics 170 (2015) 234–242,.

[321]

J. Zhang, W.H.K. Lam, B.Y. Chen, A Stochastic vehicle routing problem with travel time uncertainty: Trade-off between cost and customer service, Networks and Spatial Economics 13 (4) (2013) 471–496,.

[322]

S. Zhang, C.K.M. Lee, K.L. Choy, W. Ho, W.H. Ip, Design and development of a hybrid artificial bee colony algorithm for the environmental vehicle routing problem, Transportation Research Part D: Transport and Environment 31 (2014) 85–99,.

[323]

T. Zhang, W.A. Chaovalitwongse, Y. Zhang, Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries, Computers and Operations Research 39 (10) (2012) 2277–2290,.

Digital Library

[324]

Z. Zhang, O. Che, B. Cheang, A. Lim, H. Qin, A memetic algorithm for the multiperiod vehicle routing problem with profit, European Journal of Operational Research 229 (3) (2013) 573–584,.

[325]

Z. Zhang, H. Qin, K. Wang, H. He, T. Liu, Manpower allocation and vehicle routing problem in non-emergency ambulance transfer service, Transportation Research Part E: Logistics and Transportation Review 106 (2017) 45–59,.

Cited By

Wang WHe XHe JZhang QWang YGuo J(2024)Optimization model of material distribution in titanium sponge intelligent factory based on SEO algorithmProceedings of the 2024 4th International Conference on Artificial Intelligence, Big Data and Algorithms10.1145/3690407.3690441(201-205)Online publication date: 21-Jun-2024
https://dl.acm.org/doi/10.1145/3690407.3690441
Zhang YLi J(2024)An Improved Harmony Search Algorithm for the VRPTWProceedings of the 2024 10th International Conference on Computing and Artificial Intelligence10.1145/3669754.3669820(425-430)Online publication date: 26-Apr-2024
https://dl.acm.org/doi/10.1145/3669754.3669820
Akbay MBlum CSaliba MLi XHandl J(2024)The Electric Vehicle Problem with Road Junctions and Road Types: An Ant Colony Optimization ApproachProceedings of the Genetic and Evolutionary Computation Conference10.1145/3638529.3653997(1454-1462)Online publication date: 14-Jul-2024
https://dl.acm.org/doi/10.1145/3638529.3653997
Show More Cited By

Index Terms

A taxonomic review of metaheuristic algorithms for solving the vehicle routing problem and its variants
1. Computing methodologies
  1. Artificial intelligence
    1. Search methodologies
2. Theory of computation
  1. Design and analysis of algorithms

Index terms have been assigned to the content through auto-classification.

Recommendations

A general heuristic for vehicle routing problems

We present a unified heuristic which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacitated vehicle routing problem (CVRP), the multi-depot vehicle routing problem (...
A two-phase metaheuristic for the cumulative capacitated vehicle routing problem

The cumulative capacitated vehicle routing problem, which aims to minimize the total arrival time at customers, is a relatively new variant of vehicle routing problem. It can be used to model many real-world applications, e.g., the important application ...
Evolutionary hyperheuristic for capacitated vehicle routing problem
GECCO '13 Companion: Proceedings of the 15th annual conference companion on Genetic and evolutionary computation

In this paper a novel constructive hyperheuristic for CVRP is proposed. This hyperheuristic, called HyperPOEMS, is based on an evolutionary-based iterative local search algorithm. Its inherent characteristics make it capable of autonomously searching a ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Computers and Industrial Engineering

Computers and Industrial Engineering Volume 140, Issue C

Feb 2020

671 pages

ISSN:0360-8352

Issue’s Table of Contents

Elsevier Ltd.

Publisher

Pergamon Press, Inc.

United States

Publication History

Published: 01 February 2020

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

41
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Wang WHe XHe JZhang QWang YGuo J(2024)Optimization model of material distribution in titanium sponge intelligent factory based on SEO algorithmProceedings of the 2024 4th International Conference on Artificial Intelligence, Big Data and Algorithms10.1145/3690407.3690441(201-205)Online publication date: 21-Jun-2024
https://dl.acm.org/doi/10.1145/3690407.3690441
Zhang YLi J(2024)An Improved Harmony Search Algorithm for the VRPTWProceedings of the 2024 10th International Conference on Computing and Artificial Intelligence10.1145/3669754.3669820(425-430)Online publication date: 26-Apr-2024
https://dl.acm.org/doi/10.1145/3669754.3669820
Akbay MBlum CSaliba MLi XHandl J(2024)The Electric Vehicle Problem with Road Junctions and Road Types: An Ant Colony Optimization ApproachProceedings of the Genetic and Evolutionary Computation Conference10.1145/3638529.3653997(1454-1462)Online publication date: 14-Jul-2024
https://dl.acm.org/doi/10.1145/3638529.3653997
Jiang HTong YSong BWang CLi JLiu QZhang X(2024)A robustness division based multi-population evolutionary algorithm for solving vehicle routing problems with uncertain demandEngineering Applications of Artificial Intelligence10.1016/j.engappai.2024.108004133:PAOnline publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1016/j.engappai.2024.108004
Hou YWang HHuang X(2024)A Q-learning-based multi-objective evolutionary algorithm for integrated green production and distribution scheduling problemsEngineering Applications of Artificial Intelligence10.1016/j.engappai.2023.107434127:PAOnline publication date: 1-Feb-2024
https://dl.acm.org/doi/10.1016/j.engappai.2023.107434
Kim SChung B(2024)Integrated food delivery problem considering both single-order and multiple order deliveriesComputers and Industrial Engineering10.1016/j.cie.2024.110458196:COnline publication date: 1-Oct-2024
https://dl.acm.org/doi/10.1016/j.cie.2024.110458
Peng XWang SZhang L(2024)Production routing problem in shared manufacturingComputers and Industrial Engineering10.1016/j.cie.2024.110422195:COnline publication date: 18-Nov-2024
https://dl.acm.org/doi/10.1016/j.cie.2024.110422
Fabri MRamalhinho H(2024)Assessing the In-house Logistics flows in the automotive industryComputers and Industrial Engineering10.1016/j.cie.2023.109822187:COnline publication date: 12-Apr-2024
https://dl.acm.org/doi/10.1016/j.cie.2023.109822
Toaza BEsztergár-Kiss D(2024)A review of metaheuristic algorithms for solving TSP-based scheduling optimization problems ▪Applied Soft Computing10.1016/j.asoc.2023.110908148:COnline publication date: 27-Feb-2024
https://dl.acm.org/doi/10.1016/j.asoc.2023.110908
Abasi AAloqaily MGuizani MOuni B(2024)Metaheuristic Algorithms for 6G wireless communicationsAd Hoc Networks10.1016/j.adhoc.2024.103474158:COnline publication date: 1-May-2024
https://dl.acm.org/doi/10.1016/j.adhoc.2024.103474
Show More Cited By

View Options

View options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents