Effect of using partial solutions in edge histogram sampling algorithms with different local searches

Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

Volumn , Issue , 2009, Pages 2137-2142

  Tsutsui, Shigeyoshi ^a  

^a HANNAN UNIVERSITY   (Japan)

Author keywords

3 OPT; Combining local search; EDA; eEHBSA; EHBSA; Genetic algorithm; Lin Kernighan heuristic; Partial solutions; Traveling salesman problem

Indexed keywords

3-OPT; EDA; EEHBSA; LIN-KERNIGHAN; LOCAL SEARCH;

CYBERNETICS; HEURISTIC METHODS; PROBLEM SOLVING;

TRAVELING SALESMAN PROBLEM;

EID: 74849088546     PISSN: 1062922X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSMC.2009.5346283     Document Type: Conference Paper

References (24)

1. H. Mühlenbein and G. Paass, "From recombination of genes to the estimation of distributions I. Binary parameters," Proceedings of the 1996 Parallel Problem Solving from Nature, pp. 178-187, 1996.
2. S. Tsutsui, "Probabilistic model-building genetic algorithms in permutation representation domain using edge histogram," Proceedings of the 7th International Conference on Parallel Problem Solving from Nature (PPSN VII), pp. 224-233, 2002.
3. S. Tsutsui, M. Pelikan, and D. Goldberg, "Using edge histogram models to solve permutation problems with probabilistic model-building genetic algorithms," IlliGAL Report No. 2003022, University of Illinois, 2003.
4. "TSPLIB," 2008, http://www.iwr.uni-heidelberg.de/groups/comopt/ software/TSPLIB95/.
5. I. Oliver, D. Smith, and J. Holland, "A study of permutation crossover operators on the travel salesman problem," Proceedings of the 2nd International Conference on Genetic Algorithms, pp. 224-230, 1987.
6. D. Goldberg, Genetic algorithms in search, optimization and machine learning. Addison-Wesley, 1989.
7. T. Starkweather, S. McDaniel, K. Mathias, D. Whitley, and C. Whitley, "A comparison of genetic sequence operators," Proceeding of the 4th International Conference on Genetic Algorithms, pp. 69-76, 1991.
8. S. Tsutsui and M. Miki, "Using edge histogram models to solve flow shop scheduling problems with probabilistic model-building genetic algorithms," Recent Advances in Simulated Evolution and Learning, Kay Chen Tan, Meng Hiot Lim, Xin Yao, and Lipo Wang Eds, Advances in Natural Computation Series, Chapter 13, pp. 230-249, 2004.
9. S. Tsutsui and G. Wilson, "Solving capacitated vehicle routing problems using edge histogram based sampling algorithms," Proceedings of the 2004 Congress on Evolutionary Computation (CEC' 04), pp. 1150-1157, 2004.
10. S. Lin and B. W. Kernighan, "An effective heuristic algorithm for the traveling salesman problem," Operations Research, vol. 21, pp. 498-516, 1973.
11. D. Goldberg, The design of innovation: Lessons from and for competent genetic algorithms. Kluwer, 2002.
12. D. Thierens, "Analysis and design of genetic algorithms, Doctoral dissertation, katholieke universiteit leuven," 1995.
13. M. Pelikan, "Bayesian optimization algorithm: From single level to hierarchy. Doctoral dissertation, University of Illinois at Urbana-Champaign, Urbana, IL," 2002.
14. M. Pelikan, D. Goldberg, and F. Lobo, "A survey of optimization by building and using probabilistic models," Computational Optimization and Applications, vol. 21, no. 1, pp. 5-20, 2002.
15. P. Larrañaga and J. Lozano, "Estimation of distribution algorithms: A new tool for evolutionary computation," 2002.
16. M. Pelikan, K. Sastryand, and D. E. Goldberg, "iBOA: The incremental bayesian optimization algorithm," Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2008), pp. 455-462, 2008.
17. P. Bosman and D. Thierens, "Crossing the road to efficient IDEAs for permutation problems," Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pp. 219-226, 2001.
18. -, "Permutation optimization by iterated estimation of random keys marginal product factorizations," Proceedings of the 2002 Parallel Problem Solving From Nature, pp. 331-340, 2002.
19. V. Robles, P. Miguel, and P. Larrañaga, "Solving the traveling salesman problem with EDAs," Estimation of Distribution Algorithms, pp. 211-229, 2002.
20. S. Tsutsui, "cAS: Ant colony optimization with cunning ants," Proceedings of the 9th International Conference on Parallel Problem Solving from Nature (PPSN IX), pp. 162-171, 2006.
21. J. L. Bentley, "Fast algorithms for geometric traveling salesman problems," ORSA Journal on Computing, vol. 4, pp. 387-411, 1992.
22. D. Applegate, W. Cook, and A. Rohe, "Chained Lin-Kernighan for large traveling salesman problems," (INFORMS.
23. D. S. Johnson, "Experimental analysis of heuristics for the STSP," G. Gutin and A. P. Punnen (ed.), The Traveling Salesman Problem and Variations, vol. 9, pp. 369-443, 2002.
24. "ANSI C Code as gzipped tar file, Concorde TSP Solver," 2006, http://www.tsp.gatech.edu/concorde.html.