Variable neighbourhood simulated annealing algorithm for capacitated vehicle routing problems
暂无分享,去创建一个
Ikou Kaku | Nenad Mladenović | Qiuhong Zhao | Yiyong Xiao | N. Mladenović | Yiyong Xiao | I. Kaku | Qiuhong Zhao
[1] James B. Orlin,et al. Creating very large scale neighborhoods out of smaller ones by compounding moves , 2006, J. Heuristics.
[2] Olli Bräysy,et al. Active guided evolution strategies for large-scale vehicle routing problems with time windows , 2005, Comput. Oper. Res..
[3] Dragan Urošević,et al. A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem , 2011, Eur. J. Oper. Res..
[4] Pierre Hansen,et al. Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..
[5] Ikou Kaku,et al. The Deterministic Annealing Algorithms for Vehicle Routing Problems , 2003 .
[6] Jean Berger,et al. A new hybrid genetic algorithm for the capacitated vehicle routing problem , 2003, J. Oper. Res. Soc..
[7] David Pisinger,et al. A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..
[8] Jafar Fathali,et al. Solving the p-median problem with pos/neg weights by variable neighborhood search and some results for special cases , 2006, Eur. J. Oper. Res..
[9] Patrick Siarry,et al. A theoretical study on the behavior of simulated annealing leading to a new cooling schedule , 2005, Eur. J. Oper. Res..
[10] Christian Prins,et al. A GRASP × Evolutionary Local Search Hybrid for the Vehicle Routing Problem , 2009, Bio-inspired Algorithms for the Vehicle Routing Problem.
[11] Pierre Hansen,et al. Variable Neighborhood Search , 2018, Handbook of Heuristics.
[12] Yuchun Xu,et al. Development of a fuel consumption optimization model for the capacitated vehicle routing problem , 2012, Comput. Oper. Res..
[13] Ikou Kaku,et al. A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems , 2011, Eur. J. Oper. Res..
[14] Yiyo Kuo,et al. A variable neighborhood search for the multi-depot vehicle routing problem with loading cost , 2012, Expert Syst. Appl..
[15] Attahiru Sule Alfa,et al. A REVISED SIMULATED ANNEALING AND CLUSTER-FIRST ROUTE-SECOND ALGORITHM APPLIED TO THE VEHICLE ROUTING PROBLEM , 1993 .
[16] Pierre Hansen,et al. Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..
[17] Ho-Gyun Kim,et al. A robust design of simulated annealing approach for mixed-model sequencing , 2005, Comput. Ind. Eng..
[18] Shih-Wei Lin,et al. Applying hybrid meta-heuristics for capacitated vehicle routing problem , 2009, Expert Syst. Appl..
[19] Olli Bräysy,et al. Active-guided evolution strategies for large-scale capacitated vehicle routing problems , 2007, Comput. Oper. Res..
[20] Christos D. Tarantilis,et al. BoneRoute: An Adaptive Memory-Based Method for Effective Fleet Management , 2002, Ann. Oper. Res..
[21] Roberto Baldacci,et al. An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation , 2004, Oper. Res..
[22] Ulrich Derigs,et al. Applying the attribute based hill climber heuristic to the vehicle routing problem , 2007, Eur. J. Oper. Res..
[23] Bruce L. Golden,et al. Very large-scale vehicle routing: new test problems, algorithms, and results , 2005, Comput. Oper. Res..
[24] Christos D. Tarantilis,et al. Solving the vehicle routing problem with adaptive memory programming methodology , 2005, Comput. Oper. Res..
[25] Yuichi Nagata,et al. Edge Assembly Crossover for the Capacitated Vehicle Routing Problem , 2007, EvoCOP.
[26] Jean-Yves Potvin,et al. State-of-the Art Review - Evolutionary Algorithms for Vehicle Routing , 2009, INFORMS J. Comput..
[27] Pierre Hansen,et al. First vs. best improvement: An empirical study , 1999, Discret. Appl. Math..
[28] Nicos Christofides,et al. An Algorithm for the Vehicle-dispatching Problem , 1969 .
[29] P. Hansen,et al. Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..
[30] Ping Chen,et al. Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem , 2010, Expert Syst. Appl..
[31] P. Hansen,et al. Variable neighborhood search for the p-median , 1997 .
[32] Gilbert Laporte,et al. A unified tabu search heuristic for vehicle routing problems with time windows , 2001, J. Oper. Res. Soc..
[33] Amir Ahmadi-Javid,et al. A location-routing-inventory model for designing multisource distribution networks , 2012 .
[34] Antoine Kalmbach,et al. Evolutionary Algorithms in Vehicle Routing , 2011 .
[35] J. F. Pierce,et al. ON THE TRUCK DISPATCHING PROBLEM , 1971 .
[36] Paolo Toth,et al. The Granular Tabu Search and Its Application to the Vehicle-Routing Problem , 2003, INFORMS J. Comput..
[37] Jon Jouis Bentley,et al. Fast Algorithms for Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..
[38] P. Chakroborty,et al. An asexual genetic algorithm for the general single vehicle routing problem , 2005 .
[39] Krzysztof Fleszar,et al. A variable neighbourhood search algorithm for the open vehicle routing problem , 2009, Eur. J. Oper. Res..
[40] Gilbert Laporte,et al. The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .
[41] Michel Gendreau,et al. An efficient variable neighborhood search heuristic for very large scale vehicle routing problems , 2007, Comput. Oper. Res..
[42] Xiaolei Ma,et al. Vehicle Routing Problem , 2013 .
[43] Christian Prins,et al. A simple and effective evolutionary algorithm for the vehicle routing problem , 2004, Comput. Oper. Res..
[44] Saïd Salhi,et al. A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem , 2009, Eur. J. Oper. Res..
[45] George C. Runger,et al. See the forest before the trees: fine-tuned learning and its application to the traveling salesman problem , 1998, IEEE Trans. Syst. Man Cybern. Part A.
[46] James P. Kelly,et al. The Impact of Metaheuristics on Solving the Vehicle Routing Problem: Algorithms, Problem Sets, and Computational Results , 1998 .
[47] Richard F. Hartl,et al. D-Ants: Savings Based Ants divide and conquer the vehicle routing problem , 2004, Comput. Oper. Res..