An improved simulated annealing algorithm with crossover operator for capacitated vehicle routing problem

[1]  Sener Akpinar,et al.  Hybrid large neighbourhood search algorithm for capacitated vehicle routing problem , 2016, Expert Syst. Appl..

[2]  Mazin Abed Mohammed,et al.  Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution , 2017, J. Comput. Sci..

[3]  Gilbert Laporte,et al.  Classical Heuristics for the Capacitated VRP , 2002, The Vehicle Routing Problem.

[4]  Maghsud Solimanpur,et al.  Using the Taguchi method to optimize the differential evolution algorithm parameters for minimizing the workload smoothness index in simple assembly line balancing , 2013, Math. Comput. Model..

[5]  E. L. Lawler,et al.  Branch-and-Bound Methods: A Survey , 1966, Oper. Res..

[6]  Bassem Jarboui,et al.  A variable neighborhood search algorithm for the capacitated vehicle routing problem , 2017, Electron. Notes Discret. Math..

[7]  Subiyanto Subiyanto,et al.  An efficient meta-heuristic algorithm for solving capacitated vehicle routing problem , 2018, International Journal of Advances in Intelligent Informatics.

[8]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .

[9]  Ikou Kaku,et al.  Variable neighbourhood simulated annealing algorithm for capacitated vehicle routing problems , 2014 .

[10]  Harun Resit Yazgan,et al.  A novel heuristic algorithm for capacitated vehicle routing problem , 2017 .

[11]  Ralph E. Gomory,et al.  Outline of an Algorithm for Integer Solutions to Linear Programs and An Algorithm for the Mixed Integer Problem , 2010, 50 Years of Integer Programming.

[12]  S. G. Ponnambalam,et al.  Differential evolution algorithm with local search for capacitated vehicle routing problem , 2015, Int. J. Bio Inspired Comput..

[13]  Leandro dos Santos Coelho,et al.  A population-based simulated annealing algorithm for global optimization , 2016, 2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC).

[14]  Kan Wu,et al.  A multiple colonies artificial bee colony algorithm for a capacitated vehicle routing problem and re-routing strategies under time-dependent traffic congestion , 2017, Comput. Ind. Eng..

[15]  Nicos Christofides,et al.  An Algorithm for the Vehicle-dispatching Problem , 1969 .

[16]  Bochra Rabbouch,et al.  Empirical-type simulated annealing for solving the capacitated vehicle routing problem , 2020, J. Exp. Theor. Artif. Intell..

[17]  Lawrence Davis,et al.  Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.

[18]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[19]  Frank Neumann,et al.  More effective crossover operators for the all-pairs shortest path problem , 2013, Theor. Comput. Sci..

[20]  Vincent F. Yu,et al.  Solving the location-routing problem with simultaneous pickup and delivery by simulated annealing , 2016 .

[21]  Mirko Vujosevic,et al.  Enhanced savings calculation and its applications for solving capacitated vehicle routing problem , 2013, Appl. Math. Comput..

[22]  Ping Chen,et al.  Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem , 2010, Expert Syst. Appl..

[23]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[24]  Abdollah Hadi-Vencheh,et al.  An unsupervised fuzzy clustering approach to the capacitated vehicle routing problem , 2015, Neural Computing and Applications.

[25]  A. Abraham,et al.  A new efficient approach for solving the capacitated Vehicle Routing Problem using the Gravitational Emulation Local Search Algorithm , 2017 .

[26]  İlhan Ilhan,et al.  A population based simulated annealing algorithm for capacitated vehicle routing problem , 2020, Turkish J. Electr. Eng. Comput. Sci..

[27]  Xiaolei Ma,et al.  Vehicle Routing Problem , 2013 .

[28]  X. Yao,et al.  Analysing crossover operators by search step size , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[29]  Gen-ke Yang,et al.  Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem , 2006 .

[30]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[31]  Jon Jouis Bentley,et al.  Fast Algorithms for Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..

[32]  Xin-She Yang,et al.  Hybrid Metaheuristic Algorithms: Past, Present, and Future , 2015, Recent Advances in Swarm Intelligence and Evolutionary Computation.

[33]  Yongquan Zhou,et al.  A Hybrid Bat Algorithm with Path Relinking for the Capacitated Vehicle Routing Problem , 2013 .

[34]  Hadeer Awad,et al.  An Effective Genetic Algorithm for Capacitated Vehicle Routing Problem , 2017 .

[35]  R. H. Mole,et al.  A Sequential Route-building Algorithm Employing a Generalised Savings Criterion , 1976 .

[36]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[37]  Abdulqader M. Mohsen,et al.  An improved hybrid firefly algorithm for capacitated vehicle routing problem , 2019, Appl. Soft Comput..