Nicolás Rojas-Morales
ABSTRACT
In this work we present different learning strategies focused on detecting candidate solutions that are not interesting to be explored by a metaheuristic, in terms of evaluation function. We include a first step before the metaheuristic. The information obtained from this step is given to the metaheuristic, for visiting candidate solutions that are more promising in terms of their quality. The goal of using these strategies is to learn about candidate solutions that can be discarded from the search space, and thus to improve the search of the metaheuristic. We present two new strategies that differ on how the solutions can be constructed in an opposite way. Our approach is evaluated using Ant Solver, a well-known ant based algorithm for solving Constraint Satisfaction Problems. We show promising results that make our solution as good approach to apply in other metaheuristics.
- M. A. Ahandani and H. Alavi-Rad. Opposition-based learning in the shuffled differential evolution algorithm. Soft Comput., 16(8):1303--1337, 2012. Google Scholar
Digital Library
- T. Bartz-Beielstein and M. Preuss. Experimental research in evolutionary computation. In Genetic and Evolutionary Computation Conference, GECCO 2007, pages 3001--3020. Springer Berlin, 2007. Google ScholarDigital Library
- C. Blum and M. Dorigo. Deception in ant colony optimization. In M. Dorigo, M. Birattari, C. Blum, L. M. Gambardella, F. Mondada, and T. Stützle, editors, Ant Colony Optimization and Swarm Intelligence, 4th International Workshop, ANTS 2004, volume 3172 of Lecture Notes in Computer Science, pages 118--129. Springer, 2004.Google Scholar
- Y. Chi and G. Cai. Particle swarm optimization with opposition-based disturbance. In Informatics in Control, Automation and Robotics (CAR), 2010 2nd International Asia Conference on, volume 2, pages 223--226, 2010. Google ScholarDigital Library
- J. Derracm, S. Garcıa, D. Molina, and F. Herrera. A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm and Evolutionary Computation, 1(1):3--18, 2011.Google ScholarCross Ref
- N. Dong and Y. Wang. Multiobjective differential evolution based on opposite operation. In 2009 International Conference on Computational Intelligence and Security, CIS 2009, pages 123--127. IEEE Computer Society, 2009. Google ScholarDigital Library
- A. Esmailzadeh and S. Rahnamayan. Opposition-based differential evolution with protective generation jumping. In Differential Evolution (SDE), 2011 IEEE Symposium on, pages 1--8, 2011.Google ScholarCross Ref
- E. C. Freuder and R. J. Wallace. Partial constraint satisfaction. Artificial Intelligence, 58(1--3):21--70, 1992. Google ScholarDigital Library
- I. P. Gent, E. Macintyre, P. Prosser, B. M. Smith, and T. Walsh. Random constraint satisfaction: Flaws and structure. Constraints, 6(4):345--372, 2001. Google ScholarDigital Library
- L. Han and X. He. A novel opposition-based particle swarm optimization for noisy problems. In Natural Computation, 2007. ICNC 2007. Third International Conference on, volume 3, pages 624--629, 2007. Google ScholarDigital Library
- A. Malisia and H. Tizhoosh. Applying opposition-based ideas to the ant colony system. In 2007 IEEE Swarm Intelligence Symposium, SIS 2007, pages 182--189, 2007. Google ScholarDigital Library
- A. R. Malisia. Improving the exploration ability of ant-based algorithms. In H. R. Tizhoosh and M. Ventresca, editors, Oppositional Concepts in Computational Intelligence, volume 155, pages 121--142. Springer, 2008.Google ScholarCross Ref
- R. G. Miller. Simultaneous Statistical Inference. Springer-Verlag, 1981.Google ScholarCross Ref
- J. Montgomery and M. Randall. Anti-pheromone as a tool for better exploration of search space. In M. Dorigo, G. Di Caro, and M. Sampels, editors, Ant Algorithms, Third International Workshop, ANTS 2002, volume 2463 of Lecture Notes in Computer Science, pages 100--110. Springer, 2002. Google ScholarDigital Library
- S. Rahnamayan, H. Tizhoosh, and M. Salama. Opposition-based differential evolution algorithms. In IEEE International Conference on Evolutionary Computation, CEC 2006, pages 2010--2017, 2006.Google ScholarCross Ref
- S. Rahnamayan, H. Tizhoosh, and M. Salama. Quasi-oppositional differential evolution. In IEEE Congress on Evolutionary Computation (CEC 2007), pages 2229--2236, 2007.Google ScholarCross Ref
- S. Rahnamayan, H. R. Tizhoosh, and M. M. A. Salama. Opposition-based differential evolution (ODE) with variable jumping rate. In IEEE Symposium on Foundations of Computational Intelligence (FOCI 2007), pages 81--88. IEEE, 2007.Google ScholarCross Ref
- S. Rahnamayan and G. G. Wang. Solving large scale optimization problems by opposition-based differential evolution (ODE). WSEAS Trans. on Computation, 7(10):1792--1804, 2008. Google ScholarDigital Library
- R. Schoonderwoerd, J. L. Bruten, O. E. Holland, and L. J. M. Rothkrantz. Ant-based load balancing in telecommunications networks. volume 5, pages 169--207. MIT Press, 1996. Google ScholarDigital Library
- C. Solnon. Ants can solve constraint satisfaction problems. IEEE Transactions on Evolutionary Computation, 6(4):347--357, 2002. Google ScholarDigital Library
- T. Stützle and H. H. Hoos. MAX-MIN Ant System. volume 16, pages 889--914. Elsevier, 2000. Google ScholarDigital Library
- J. Tang and X. Zhao. On the improvement of opposition-based differential evolution. In Sixth International Conference on Natural Computation, ICNC 2010, pages 2407--2411. IEEE, 2010.Google ScholarCross Ref
- J. I. van Hemert and C. Solnon. A study into ant colony optimisation, evolutionary computation and constraint programming on binary constraint satisfaction problems. In J. Gottlieb and G. Raidl, editors, Evolutionary Computation in Combinatorial Optimization, 4th European Conference, EvoCOP 2004, volume 3004 of Lecture Notes in Computer Science, pages 114--123. Springer, 2004.Google Scholar
- H. Wang, H. Li, Y. Liu, C. Li, and S. Zeng. Opposition-based particle swarm algorithm with cauchy mutation. In Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2007, pages 4750--4756, 2007.Google ScholarCross Ref
- J. Wang, Z. Wu, and H. Wang. Hybrid differential evolution algorithm with chaos and generalized opposition-based learning. In Advances in Computation and Intelligence, volume 6382 of Lecture Notes in Computer Science, pages 103--111. Springer Berlin Heidelberg, 2010. Google ScholarDigital Library
Index Terms
- Ants can Learn from the Opposite
Recommendations
Ant colony optimization with group learning
GECCO '14: Proceedings of the 2014 Annual Conference on Genetic and Evolutionary ComputationWe introduce Group Learning for Ant Colony Optimization applied to combinatorial optimization problems with group-structured solution encodings. In contrast to the common assignment of one pheromone value per solution component in Group Learning each ...
Using Anti-pheromone to Identify Core Objects for Multidimensional Knapsack Problems: A Two-step Ants based Approach
GECCO Companion '15: Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary ComputationThis paper proposes a two-step ants algorithm for the Multidimensional Knapsack Problem. In the first step, the algorithm uses an Anti-pheromone to detect which objects are less suitable to be part of a near-optimal solution solving the opposite ...
Ants can solve constraint satisfaction problems
We describe a novel incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to use artificial ants to keep track of promising areas of the search space by laying ...
Comments