A discrete particle swarm optimization algorithm for the generalized traveling salesman problem
暂无分享,去创建一个
[1] Jacques Renaud,et al. An efficient composite heuristic for the symmetric generalized traveling salesman problem , 1998, Eur. J. Oper. Res..
[2] Elena Marchiori,et al. An Evolutionary Algorithm for Large Scale Set Covering Problems with Application to Airline Crew Scheduling , 2000, EvoWorkshops.
[3] Pierre Hansen,et al. Variable Neighborhood Search , 2018, Handbook of Heuristics.
[4] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .
[5] Mehmet Fatih Tasgetiren,et al. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..
[6] Gerhard Reinelt,et al. TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..
[7] Gilbert Laporte,et al. Some Applications of the Generalized Travelling Salesman Problem , 1996 .
[8] David Ben-Arieh,et al. Process planning for rotational parts using the generalized travelling salesman problem , 2003 .
[9] James C. Bean,et al. A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem , 1991, Oper. Res..
[10] Lawrence V. Snyder,et al. A random-key genetic algorithm for the generalized traveling salesman problem , 2006, Eur. J. Oper. Res..
[11] Matteo Fischetti,et al. A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem , 1997, Oper. Res..
[12] A. G. Chentsov,et al. The dynamic programming method in the generalized traveling salesman problem , 1997 .
[13] Mauro Birattari,et al. Swarm Intelligence , 2012, Lecture Notes in Computer Science.
[14] Gilbert Laporte,et al. A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem , 1996, INFORMS J. Comput..
[15] Matteo Fischetti,et al. The symmetric generalized traveling salesman polytope , 1995, Networks.
[16] G. Laporte,et al. Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach , 1983 .
[17] L. W. Jacobs,et al. Note: A local-search heuristic for large set-covering problems , 1995 .
[18] Gilbert Laporte,et al. Generalized travelling salesman problem through n sets of nodes: the asymmetrical case , 1987, Discret. Appl. Math..
[19] Thomas Stützle,et al. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..