ABSTRACT
The basic idea to defend in this paper is that an adequate perception of the search space, sacrificing most of the precision, can paradoxically accelerate the discovery of the most promising solution zones. While any search space can be observed at any scale according to the level of details, there is nothing inherent to the classical metaheuristics to naturally account for this multi-scaling. Nevertheless, the wider the search space the longer the time needed by any metaheuristic to discover and exploit the "promising" zones. Any possibility to compress this time is welcome. Abstracting the search space during the search is one such possibility. For instance, a common Ordering Genetic Algorithm (o-GA) is not well suited to efficiently resolve very large instances of the Traveling Salesman Problem (TSP). The mechanism presented here (reminiscent of Gestalt psychology) aims at abstracting the search space by substituting the variables of the problems with macro-versions of them. This substitution allows any given metaheuristic to tackle the problem at various scales or through different multi-resolution lenses. In the TSP problem to be treated here, the towns will simply be aggregated into regions and the metaheuristics will apply on this new one-level-up search space. The whole problem becomes now how to discover the most appropriate regions and to merge this discovery with the running of the o-GA at the new level.
- M. Ash. Gestalt Psychology In German Culture 1890 -- 1967. Cambridge University Press, 1995.Google Scholar
- H. Bersini. Whatever emerges should be intrinsically useful. In Artificial life 9, pages 226--231. The MIT Press, 2004.Google Scholar
- J. Crutchfield. Is anything ever new? considering emergence. In DP. GCowan and DMelzner, editors, Integrative Themes, volume XIX of Santa Fe Institute Studies in the Sciences of Complexity. Addison-Wesley Publishing Company, Reading, Massachusetts, 1994.Google Scholar
- J. Crutchfield and M. Mitchell. The evolution of emergent computation. In Proceedings of the National Academy of Science}, volume 23, page 103, 1995.Google ScholarCross Ref
- D. F. D. Whitley, T. Starkweather. Scheduling problems and traveling salesman: The genetic edge recombination operator. In Proceedings of the 3rd International Conference on Genetic Algorithms (ICGA), pages 133--140, 1989. Google ScholarDigital Library
- A. Defaweux, T. Lenaerts, and J. I. van Hemert. Evolutionary transitions as a metaphor for evolutionary optimisation. In Advances in Artificial Life, 8th European Conference, ECAL 2005, Proceedings, volume 3630 of Lecture Notes in Computer Science, pages 342--352. Springer, 2005. Google ScholarDigital Library
- A. Defaweux, T. Lenaerts, J. I. van Hemert, and J. Parent. Transition models as an incremental approach for problem solving in evolutionary algorithms. In GECCO '05: Proceedings of the 2005 conference on Genetic and evolutionary computation, pages 599--606, New York, NY, USA, 2005. ACM Press. Google ScholarDigital Library
- M. Demerec and P. Hartman. Complex loci in microorganims. Annual Review of Microbiology, 13:377--406, 1959.Google ScholarCross Ref
- E. Falkenauer. A new representation and operators for genetic algorithms applied to grouping problems. Evolutionary Computation, 2(2):123--144, 1994.Google ScholarDigital Library
- D. Fogel. Applying evolutionary programming to selected travelling salesman problems. Cybernetics and Systems : an International Journal, 24:27--36, 1993. Google ScholarDigital Library
- B. Freisleben and P. Merz. A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems. In Proceedings of IEEE International Conference on Evolutionary Computation 1996, pages 616--621, 1996.Google ScholarCross Ref
- M. R. Garey, R. L. Graham, and D. S. Johnson. Some np-complete geometric problems. In STOC '76: Proceedings of the eighth annual ACM symposium on Theory of computing, pages 10--22, New York, NY, USA, 1976. ACM Press. Google ScholarDigital Library
- D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Professional, 1989. Google ScholarDigital Library
- S. Jung and B. R. Moon. Toward minimal restriction of genetic encoding and crossovers for the two-dimensional euclidean tsp. IEEE Trans. Evolutionary Computation, 6(6): 557--565, 2002. Google ScholarDigital Library
- P. Krolak, W. Felts, and G. Marble. A man-machine approach toward solving the traveling salesman problem. Commununications of the ACM, 14(5):327--334, 1971. Google ScholarDigital Library
- S. Lin and B. Kernighan. An effective heuristic algorithm for traveling salesman problem. Operations Research, 220(4598):498-516, 1973.Google ScholarDigital Library
- I. Or. Traveling salesman-type problems and their relation to the logistics of regional blood banking. PhD thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL, 1976.Google Scholar
- C. Philemotte and H. Bersini. Coevolution of effective observers and observed multi-agents system. In Advances in Artificial Life, 8th European Conference, ECAL 2005, Proceedings, volume 3630 of Lecture Notes in Computer Science, pages 785--794. Springer, 2005. Google ScholarDigital Library
- C. Philemotte and H. Bersini. How an optimal observer can collapse the search space. In GECCO '06: Proceedings of the 8th annual conference on Genetic and evolutionary computation, pages 1273--1280, New York, NY, USA, 2006. ACM Press. Google ScholarDigital Library
- C. Philemotte and H. Bersini. How an optimal observer can smooth a landscape. In IEEE Congress on Evolutionary Computation 2006, pages 2293--2300. IEEE, 2006. Google ScholarDigital Library
- G. Reinelt. The traveling Salesman: Computational Solutions for TSP Applications. Springer-Verlag, 1994.Google ScholarDigital Library
- F. Rothlauf and D. E. Goldberg. Representations for Genetic and Evolutionary Algorithms. Physica-Verlag, 2002. Google ScholarDigital Library
- L. Steels. Towards a theory of emergent functionality. In Proceedings of the first international conference on simulation of adaptive behavior on From animals to animats, pages 451--461, Cambridge, MA, USA, 1990. MIT Press. Google ScholarDigital Library
- T. Stützle. Local Search Algorithms for Combinatorial Problems -- Analysis, Algorithms, and New Applications. PhD thesis, Department of Computer Science, Darmstadt University of Technology, 1998.Google Scholar
- T. Walters. Repair and brood selection in the traveling salesman problem. In AEiben, TBack, MSchoenauer, and H.-P. Schwefel, editors, Proceedings of the Fifth International Conference on Parallel Problem Solving from Nature, Amsterdam, The Netherlands, volume 1498 of Lecture Notes in Computer Science}, pages 813--822. Springer-Verlag, 1998. Google ScholarDigital Library
- R. A. Watson. Compositional evolution: interdisciplinary investigations in evolvability, modularity, and symbiosis. PhD thesis, Brandeis University, 2002. Adviser-Jordan B. Pollack. Google ScholarDigital Library
Index Terms
A gestalt genetic algorithm: less details for better search
Recommendations
A discrete gravitational search algorithm for solving combinatorial optimization problems
Metaheuristics are general search strategies that, at the exploitation stage, intensively exploit areas of the solution space with high quality solutions and, at the exploration stage, move to unexplored areas of the solution space when necessary. The ...
A Populated Iterated Greedy Algorithm with Inver-Over Operator for Traveling Salesman Problem
SEMCCO 2013: 4th International Conference on Swarm, Evolutionary, and Memetic Computing - Volume 8297In this study, we propose a populated iterated greedy algorithm with an Inver-Over operator to solve the traveling salesman problem. The iterated greedy IG algorithm is mainly based on the central procedures of destruction and construction. The basic ...
Solving traveling salesman problems via artificial intelligent search techniques
AIKED'12: Proceedings of the 11th WSEAS international conference on Artificial Intelligence, Knowledge Engineering and Data BasesThe traveling salesman problem (TSP) is one of the most intensively studied problems in computational mathematics and combinatorial optimization. It is also considered as the class of the NP-complete combinatorial optimization problems. By literatures, ...
Comments