Abstract
Population dynamics and its relation to chaotic systems is analyzed in this Chapter. Using basic chaotic principles of attractors and edges, a dynamic population is developed, which is used to induce and retain diversity in a metaheuristic population. Simulation is done with Genetic Algorithm, Differential Evolution and Self-Organizing Migrating Algorithm on the combinatorial problem of Quadratic Assignment with promising results.
Keywords
- Genetic Algorithm
- Differential Evolution
- Chaotic System
- Differential Evolution Algorithm
- Large Lyapunov Exponent
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ahuja, R., Orlin, J., Tiwari, A.: A descent genetic algorithm for the quadratic assignment problem. Comput. Oper. Res. 27, 917–934 (2000)
Aihara, K., Takabe, T., Toyoda, M.: Chaotic Neural Networks. Phys. Lett. A 6, 333–340 (1990)
Boelte, A., Thonemann, U.: Optimizing simulated annealing schedules with genetic programming. Eur. J. Oper. Res. 92, 402–416 (1996)
Burkard, R., Rendl, F.: A thermodynamically motivated simulation procedure for combinatorial optimisation problems. Eur. J. Oper. Res. 17, 169–174 (1994)
Chen, L., Kazuyuki, A.: Chaotic simulated annealing by a neural network model with transient chaos. Neural Networks 6(8), 915–930 (1995)
Connolly, D.: An improved annealing scheme for the QAP. Eur. J. Oper. Res. 46, 93–100 (1990)
Davendra, D.: Differential Evolution Algorithm for Flow Shop Scheduling, Bachelor Degree Thesis, University of the South Pacific (2001)
Davendra, D.: Hybrid Differential Evolution Algorithm for Discrete Domain Problems. Master Degree Thesis, University of the South Pacific (2003)
Davendra, D., Onwubolu, G.: Flow Shop Scheduling using Enhanced Differential Evolution. In: Proceeding of the 21st European Conference on Modelling and Simulation, Prague, Czech Republic, June 4–5, pp. 259–264 (2007)
Davendra, D., Onwubolu, G.: Enhanced Differential Evolution hybrid Scatter Search for Discrete Optimisation. In: Proceeding of the IEEE Congress on Evolutionary Computation, Singapore, September 25–28, pp. 1156–1162 (2007)
Davendra, D., Onwubolu, G.: Forward Backward Transformation. In: Onwubolu, G., Davendra, D. (eds.) Differential Evolution: A Handbook for Permutation-Based Combinatorial Optimization, pp. 35–80. Springer, Germany (2009)
Davendra, D., Zelinka, I.: Optimization of Quadratic Assignment Problem using Self-Organinsing Migrating Algorithm. Comput. Informat. 28, 169–180 (2009)
Drezne, Z.: A new genetic algorithm for the quadratic assignment problem. INFORMS Journal on Computing 115, 320–330 (2003)
Gambardella, L., Thaillard, E., Dorigo, M.: Ant Colonies for the Quadratic Assignment Problem. Int. J. Oper. Res. 50, 167–176 (1999)
Gleick, J.: Chaos: Making a New Science, Vintage, USA (1987)
Hochbam, D.: Approximation Algorithms for NP — Hard Problems. PWS Publishing Company, USA (1997)
Holland, J.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)
Ikeguchi, T., Horio, Y.: Chaos for avoiding local minima A. Mutual Connection Neural Network Dynamics (White Paper)
Ishi, S., Sato, M.: Chaotic potts spin model for combinatorial optimization problems. Neural Networks 10, 941–963 (1997)
Ji, P., Yongzhong, W., Haozhao, L.: A solution method for the Quadratic Assignment Problem (QAP). In: Proceeding of the Sixth International Symposium on Operations Research and Its Applications (ISORA 2006), Xinjiang, China, August 8–12, pp. 106–117 (2006)
Koopmans, T., Beckmann, M.: Assignment problems and the location of economic activities. Econometrica 25, 53–76 (1957)
Lawler, E., Lensta, J., Rinnooy, K., Shmoys, D.: Sequencing and scheduling: algorithms and complexity. In: Graves, S., Rinnooy, K., Zipkin, P. (eds.) Logistics of Production and Inventory, pp. 445–522. North Holland, Amsterdam (1995)
Lin, F., Kao, C., Hsu: Applying the genetic approach to simulated annealing in solving NP-hard problems. IEEE Trans. Syst. Man Cybern. B Cybern. 23, 1752–1767 (1993)
May, R.: Stability and Complexity in Model Ecosystems. Princeton University Press, Princeton (2001)
Misevicius, A.: An Improved Hybrid Optimization algorithm for the Quadratic Assignment Problem. Mathematical Modelling and Analysis 9(2), 149–168 (2004)
Nozawa, H.: Chaos 2. Physics D 2, 377 (1992)
Onwubolu, G.: Optimisation using Differential Evolution Algorithm. Technical Report TR-2001-05, IAS (October 2001)
Onwubolu, G.: Emerging Optimisation Techniques in Production Planning and Control. Imperial Collage Press, London (2002)
Onwubolu, G., Clerc, M.: Optimal path for automated drilling operations by a new heuristic approach using particle swamp optimisation. Int. J. Prod. Res. 42(3), 473–491 (2004)
Onwubolu, G., Davendra, D.: Scheduling flow shops using differential evolution algorithm. Eur. J. Oper. Res. 171, 674–679 (2006)
Operations Reserach Library, http://people.brunel.ac.uk/~mastjjb/jeb/info.htm (Cited September 13, 2008)
Pinedo, M.: Scheduling: theory, algorithms and systems. Prentice Hall, Inc., New Jersey (1995)
Price, K.: An introduction to differential evolution. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimisation, pp. 79–108. McGraw Hill, International, UK (1999)
Price, K., Storn, R.: Differential evolution (2001), http://www.ICSI.Berkeley.edu/~storn/code.html (Cited September 10, 2008)
Sahni, S., Gonzalez, T.: P-complete approximation problems. J. ACM 23, 555–565 (1976)
Taillard, E.: Robust taboo search for the quadratic assignment problem. Parallel Comput. 17, 443–455 (1991)
Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64, 278–285 (1993)
Yamada, T., Aihara, K.: Nonlinear Neurodynamics and Combinatorial Optimization in Chaotic Neural Networks. J. Intell. Fuzzy Sys. 1(5), 53–68 (1997)
Zelinka, I.: Soma — Self Organizing Migrating Algorithm. In: Onwubolu, G., Babu, B. (eds.) New Optimization Techniques in Engineering. Springer, Germany (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Davendra, D., Zelinka, I., Onwubolu, G. (2010). Chaotic Attributes and Permutative Optimization. In: Zelinka, I., Celikovsky, S., Richter, H., Chen, G. (eds) Evolutionary Algorithms and Chaotic Systems. Studies in Computational Intelligence, vol 267. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10707-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-10707-8_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10706-1
Online ISBN: 978-3-642-10707-8
eBook Packages: EngineeringEngineering (R0)