Can deterministic chaos improve differential evolution for the linear ordering problem?

Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014

Volumn , Issue , 2014, Pages 1443-1448

  Krömer, Pavel ^a,b   Zelinka, Ivan ^b   Snášel, Václav ^b  

^a UNIVERSITY OF ALBERTA   (Canada)

^b VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMIMETICS; CHAOTIC SYSTEMS; COMBINATORIAL OPTIMIZATION; DIGITAL ARITHMETIC; ELECTRIC GENERATORS; EVOLUTIONARY ALGORITHMS; GENES; HEURISTIC METHODS; INTEGER PROGRAMMING; NUMBER THEORY; SET THEORY;

COMBINATORIAL OPTIMIZATION PROBLEMS; CONTINUOUS OPTIMIZATION PROBLEMS; FLOATING POINT NUMBERS; LINEAR ORDERING PROBLEMS; META-HEURISTIC OPTIMIZATIONS; NATURE INSPIRED ALGORITHMS; PSEUDO RANDOM NUMBER GENERATORS; SURVIVAL-OF-THE-FITTEST;

RANDOM NUMBER GENERATION;

EID: 84908592916     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2014.6900589     Document Type: Conference Paper

References (37)

1. K. V. Price, R. M. Storn, and J. A. Lampinen, Differential Evolution A Practical Approach to Global Optimization, ser. Natural Computing Series, G. Rozenberg, T. Bäck, A. E. Eiben, J. N. Kok, and H. P. Spaink, Eds. Berlin, Germany: Springer-Verlag, 2005. Available: Http://www. springer. com/west/home/computer/ foundations?SGWID=4-156-22-32104365-0n&n#38;teaserId=68063n &n#38;CENTERn ID=69103
2. D. M. Gordon, Ant Encounters: Interaction Networks and Colony Behavior, ser. Primers in complex systems. Princeton University Press, 2010. [Online]. Available: Http://books. google. com/books?id= MabwdXLZ9YMC
3. P. Krömer, V. Snásael, and I. Zelinka, "Randomness and chaos in genetic algorithms and differential evolution," in Intelligent Networking and Collaborative Systems (INCoS), 2013 5th International Conference on, 2013, pp. 196-201.
4. H. Schuster and W. Just, Deterministic Chaos. Wiley, 2006. [Online]. Available: Http://books. google. cz/booksid=9y2qSGpQR7QC
5. R. Mart and G. Reinelt, The Linear Ordering Problem-Exact and Heuristic Methods in Combinatorial Optimization, ser. Applied Mathematical Sciences. Springer Heidelberg Dordrecht London New York, 2011, vol. 175.
6. R. Mart, G. Reinelt, and A. Duarte, "A benchmark library and a comparison of heuristic methods for the linear ordering problem," Computational Optimization and Applications, pp. 1-21, 2011, 10. 1007/s10589-010-9384-9. [Online]. Available: Http://dx. doi. org/10. 1007/s10589-010-9384-9
7. T. Schiavinotto and T. Stützle, "Search space analysis for the linear ordering problem," in Applications of Evolutionary Computing, ser. Lecture Notes in Computer Science, G. R. Raidl, J.-A. Meyer, M. Middendorf, S. Cagnoni, J. J. R. Cardalda, D. Corne, J. Gottlieb, A. Guillot, E. Hart, C. G. Johnson, and E. Marchiori, Eds., vol. 2611. Berlin, Germany: Springer-Verlag, 2003, pp. 322-333.
8. -, "The linear ordering problem: Instances, search space analysis and algorithms," Journal of Mathematical Modelling and Algorithms, vol. 3, no. 4, pp. 367-402, 2004.
9. V. Campos, F. Glover, M. Laguna, and R. Mart, "An experimental evaluation of a scatter search for the linear ordering problem," J. of Global Optimization, vol. 21, no. 4, pp. 397-414, 2001.
10. G. Reinelt, The Linear Ordering Problem: Algorithms and Applications, ser. Research and Exposition in Mathematics. Heldermann Verlag Berlin, 1985, vol. 8.
11. J. E. Mitchell and B. Borchers, "Solving linear ordering problems with a combined interior point/simplex cutting plane algorithm," Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, NY 12180-3590, Tech. Rep., September 1997, accepted for publication in Proceedings of HPOPT97, Rotterdam, The Netherlands. [Online]. Available: Http://www. math. rpi. edu/-mitchj/papers/combined. ps
12. G. Huang and A. Lim, "Designing a hybrid genetic algorithm for the linear ordering problem," in GECCO, 2003, pp. 1053-1064.
13. P. Krömer, V. Snásel, and J. Platos, "Evolving feasible linear ordering problem solutions," in CSTST '08: Proceedings of the 5th international conference on Soft computing as transdisciplinary science and technology. New York, NY, USA: ACM, 2008, pp. 337-342.
14. P. Krömer, V. Snásel, J. Platos, and D. Husek, "Genetic Algorithms for the Linear Ordering Problem," Neural Network World, vol. 19, no. 1, pp. 65-80, 2009, ISSN 1210-0552, impact factor 0. 395.
15. V. Snásel, P. Krömer, and J. Platos, "Differential evolution and genetic algorithms for the linear ordering problem. " in KES (1), ser. Lecture Notes in Computer Science, J. D. Velásquez, S. A. Ros, R. J. Howlett, and L. C. Jain, Eds., vol. 5711. Springer, 2009, pp. 139-146.
16. C. Chira, C. M. Pintea, G. C. Crisan, and D. Dumitrescu, "Solving the linear ordering problem using ant models," in Proceedings of the 11th Annual conference on Genetic and evolutionary computation, ser. GECCO '09. New York, NY, USA: ACM, 2009, pp. 1803-1804. Available: Http://doi. acm. org/10. 1145/1569901. 1570170
17. A. Abraham, "Editorial-hybrid soft computing and applications," International Journal of Computational Intelligence and Applications, vol. 8, no. 1, 2009.
18. E. Corchado, A. Arroyo, and V. Tricio, "Soft computing models to identify typical meteorological days," Logic Journal of the IGPL, vol. 19, no. 2, pp. 373-383, 2011.
19. S.-Z. Zhao, M. W. Iruthayarajan, S. Baskar, and P. Suganthan, "Multi-objective robust pid controller tuning using two lbests multi-objective particle swarm optimization," Information Sciences, vol. 181, no. 16, pp. 3323-3335, 2011. [Online]. Available: Http://www. sciencedirect. com/science/article/pii/S002002551100171X
20. J. Sedano, L. Curiel, E. Corchado, E. de la Cal, and J. R. Villar, "A soft computing method for detecting lifetime building thermal insulation failures," Integr. Comput.-Aided Eng., vol. 17, no. 2, pp. 103-115, Apr. 2010. [Online]. Available: Http://dl. acm. org/citation. cfm?id=1804647. 1804653
21. P. Krömer, J. Platos, and V. Snásel, "Differential evolution for the linear ordering problem implemented on cuda," in Proceedings of the 2011 IEEE Congress on Evolutionary Computation, A. E. Smith, Ed., IEEE Computational Intelligence Society. New Orleans, USA: IEEE Press, 5-8 June 2011, pp. 790-796.
22. R. Storn and K. Price, "Differential Evolution-A Simple and Efficient Adaptive Scheme for Global Optimization over Continuous Spaces," Tech. Rep., 1995. [Online]. Available: Http://citeseerx. ist. psu. edu/viewdoc/summarydoi=10. 1. 1. 1. 9696
23. R. Storn, "Differential evolution design of an IIR-filter," in Proceeding of the IEEE Conference on Evolutionary Computation ICEC. IEEE Press, 1996, pp. 268-273.
24. M. Cárdenas-Montes, M. A. Vega-Rodrúguez, and A. Gómez-Iglesias, "Sensitiveness of evolutionary algorithms to the random number generator," in Proceedings of the 10th international conference on Adaptive and natural computing algorithms-Volume Part I, ser. ICANNGA'11. Berlin, Heidelberg: Springer-Verlag, 2011, pp. 371-380. [Online]. Available: Http://dl. acm. org/citation. cfm?id= 1997052. 1997093
25. V. Tirronen, S. yrm, and M. Weber, "Study on the effects of pseudorandom generation quality on the performance of differential evolution," in Adaptive and Natural Computing Algorithms, ser. Lecture Notes in Computer Science, A. Dobnikar, U. Lotri, and B. ter, Eds. Springer Berlin Heidelberg, 2011, vol. 6593, pp. 361-370. Available: Http://dx. doi. org/10. 1007/978-3-642-20282-7 37
26. M. Yang, J. Guan, Z. Cai, and L. Wang, "Self-adapting differential evolution algorithm with chaos random for global numerical optimization," in Proceedings of the 5th international conference on Advances in computation and intelligence, ser. ISICA'10. Berlin, Heidelberg: Springer-Verlag, 2010, pp. 112-122. [Online]. Available: Http://dl. acm. org/citation. cfm?id=1926680. 1926694
27. N. R. Wagner, "The logistic lattice in random number generation," in Proceedings of the Thirtieth Annual Allerton Conference on Communications, Control, and Computing. Coordinated Science Lab and Department of Electrical and Computer Engineering, University of Illinois at Urbabn-Champaign, 1993, pp. 922-931.
28. M. Andrecut, "Logistic map as a random number generator," International Journal of Modern Physics B, vol. 12, no. 09, pp. 921-930, 1998. [Online]. Available: Http://www. worldscientific. com/ doi/abs/10. 1142/S021797929800051X
29. J. Szczepánski and Z. Kotulski, "Pseudorandom number generators based on chaotic dynamical systems," Open Systems & Information Dynamics, vol. 8, no. 2, pp. 137-146, Jun. 2001. [Online]. Available: Http://dx. doi. org/10. 1023/A:1011950531970
30. M. C. Shastry, N. Nagaraj, and P. G. Vaidya, "The b-exponential map: A generalization of the logistic map, and its applications in generating pseudo-random numbers," CoRR, vol. abs/cs/0607069, 2006.
31. S.-L. Chen, T. Hwang, and W.-W. Lin, "Randomness enhancement using digitalized modified logistic map," Circuits and Systems II: Express Briefs, IEEE Transactions on, vol. 57, no. 12, pp. 996-1000, 2010.
32. K. Persohn and R. Povinelli, "Analyzing logistic map pseudorandom number generators for periodicity induced by finite precision floatingpoint representation," Chaos, Solitons & Fractals, vol. 45, no. 3, pp. 238-245, 2012. [Online]. Available: Http://www. sciencedirect. com/ science/article/pii/S0960077911002384
33. L. V. Snyder and M. S. Daskin, "A random-key genetic algorithm for the generalized traveling salesman problem," European Journal of Operational Research, vol. 174, no. 1, pp. 38-53, 2006.
34. P. Krömer, J. Platos, and V. Snásel, "Modeling permutations for genetic algorithms," in Proceedings of the International Conference of Soft Computing and Pattern Recognition (SoCPaR 2009). IEEE Computer Society, 2009, pp. 100-105.
35. M. Matsumoto and T. Nishimura, "Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator," ACM Trans. Model. Comput. Simul., vol. 8, no. 1, pp. 3-30, Jan. 1998. [Online]. Available: Http://doi. acm. org/10. 1145/272991. 272995
36. M. Luscher, "A portable high-quality random number generator for lattice field theory simulations," Computer Physics Communications, vol. 79, no. 1, pp. 100-110, 1994. [Online]. Available: Http://www. sciencedirect. com/science/article/pii/0010465594902321
37. G. Box, J. Hunter, and W. Hunter, Statistics for experimenters: Design, innovation, and discovery, ser. Wiley series in probability and statistics. Wiley-Interscience, 2005.