An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
暂无分享,去创建一个
Mehmet Fatih Tasgetiren | Quan-Ke Pan | Ponnuthurai N. Suganthan | M. F. Tasgetiren | P. Suganthan | Q. Pan | M. Tasgetiren
[1] James C. Bean,et al. A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem , 1991, Oper. Res..
[2] Lawrence V. Snyder,et al. A random-key genetic algorithm for the generalized traveling salesman problem , 2006, Eur. J. Oper. Res..
[3] David Ben-Arieh,et al. Process planning for rotational parts using the generalized travelling salesman problem , 2003 .
[4] Thomas Stützle,et al. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..
[5] Matteo Fischetti,et al. A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem , 1997, Oper. Res..
[6] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[7] Mehmet Fatih Tasgetiren,et al. A discrete particle swarm optimization algorithm for the generalized traveling salesman problem , 2007, GECCO '07.
[8] Gilbert Laporte,et al. Generalized travelling salesman problem through n sets of nodes: the asymmetrical case , 1987, Discret. Appl. Math..
[9] Gregory Gutin,et al. A memetic algorithm for the generalized traveling salesman problem , 2008, Natural Computing.
[10] Gilbert Laporte,et al. Some Applications of the Generalized Travelling Salesman Problem , 1996 .
[11] David Ben-Arieh,et al. Transformations of generalized ATSP into ATSP , 2003, Oper. Res. Lett..
[12] Mehmet Fatih Tasgetiren,et al. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..
[13] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .
[14] Mehmet Fatih Tasgetiren,et al. A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem , 2007, Eur. J. Oper. Res..
[15] Gilbert Laporte,et al. A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem , 1996, INFORMS J. Comput..
[16] Matteo Fischetti,et al. The symmetric generalized traveling salesman polytope , 1995, Networks.
[17] G. Laporte,et al. Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach , 1983 .
[18] A. G. Chentsov,et al. The dynamic programming method in the generalized traveling salesman problem , 1997 .
[19] Mehmet Fatih Tasgetiren,et al. A discrete differential evolution algorithm for single machine total weighted tardiness problem with sequence dependent setup times , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).
[20] Mehmet Fatih Tasgetiren,et al. A genetic algorithm for the generalized traveling salesman problem , 2007, 2007 IEEE Congress on Evolutionary Computation.
[21] Jacques Renaud,et al. An efficient composite heuristic for the symmetric generalized traveling salesman problem , 1998, Eur. J. Oper. Res..
[22] David E. Goldberg,et al. AllelesLociand the Traveling Salesman Problem , 1985, ICGA.
[23] Bruce L. Golden,et al. The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach , 2007 .
[24] Mehmet Fatih Tasgetiren,et al. A discrete differential evolution algorithm for the permutation flowshop scheduling problem , 2008, Comput. Ind. Eng..
[25] Gerhard Reinelt,et al. TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..
[26] Lawrence Davis,et al. Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.