Skip to main content

The Effectiveness of the Simplicity in Evolutionary Computation

  • Conference paper
  • First Online:
Intelligent Information and Database Systems (ACIIDS 2017)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10192))

Included in the following conference series:

  • 2227 Accesses

Abstract

Current research in Evolutionary Computation concentrates on proposing more and more sophisticated methods that are supposed to be more effective than their predecessors. New mechanisms, like linkage learning (LL) that improve the overall method effectiveness, are also proposed. These research directions are promising and lead to effectiveness increase that cannot be questioned. Nevertheless, in this paper, we concentrate on a situation in which the simplification of the method leads to the improvement of its effectiveness. We show situations when primitive methods, like Random Search (RS) combined with local search, can compete with highly sophisticated and highly effective methods. The presented results were obtained for an up-to-date, practical, NP-complete problem, namely the Routing and Spectrum Allocation of Multicast and Unicast Flows (RSA/MU) in Elastic Optical Networks (EONs). None of the considered test cases is trivial. The number of solutions possible to encode by an evolutionary method is large.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Aibin M., Walkowiak K.: Simulated annealing algorithm for optimization of elastic optical networks with unicast and anycast traffic. In: Proceedings of 16th International Conference on Transparent Optical Networks ICTON (2014)

    Google Scholar 

  2. Fieldsend, J.E.: Running up those hills: multi-modal search with the niching migratory multi-swarm optimizer. In: IEEE Congress on Evolutionary Computation, pp. 2593–2600 (2014)

    Google Scholar 

  3. Goldberg, D.E., et al.: Rapid, accurate optimization of difficult problems using fast messy genetic algorithms. In: Proceedings of 5th International Conference on Genetic Algorithms, pp. 55–64 (1993)

    Google Scholar 

  4. Goldman, B.W., Punch, W.F.: Parameter-less population pyramid. In: Proceedings of 2014 Annual Conference on Genetic and Evolutionary Computation (GECCO 2014), pp. 785–792 (2014)

    Google Scholar 

  5. Hsu, S.-H., Yu, T.-L.: Optimization by pairwise linkage detection, incremental linkage set, and restricted/back mixing: DSMGA-II. In: Proceedings of 2015 Annual Conference on Genetic and Evolutionary Computation (GECCO 2015), pp. 519–526 (2015)

    Google Scholar 

  6. Komarnicki, M.M., Przewozniczek, M.W.: Linked genes migration in island models. In: Proceedings of International Conference on Evolutionary Computation Theory and Applications (ECTA 2016) (2016, in press)

    Google Scholar 

  7. Kwasnicka, H., Przewozniczek, M.: Multi population pattern searching algorithm: a new evolutionary method based on the idea of messy genetic algorithm. IEEE Trans. Evol. Comput. 15(5), 715–734 (2011)

    Article  Google Scholar 

  8. Kurdi, M.: An effective new island model genetic algorithm for job shop scheduling problem. Comput. Oper. Res. 67, 132–142 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  9. Muelas, S., Mendiburu, A., LaTorre, A., Peña, J.-M.: Distributed estimation of distribution algorithms for continuous optimization: how does the exchanged information influence their behavior? Inf. Sci. 268, 231–254 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  10. Przewozniczek, M., Goscien, R., Walkowiak, K., Klinkowski, M.: Towards solving practical problems of large solution space using a novel pattern searching hybrid evolutionary algorithm - an elastic optical network optimization case study. Expert Syst. Appl. 42, 7781–7796 (2015)

    Article  Google Scholar 

  11. Przewozniczek, M.: Dynamic subpopulation number control for solving routing and spectrum allocation problems in elastic optical networks. In: Proceeding of 3rd European Network Intelligence Conference (2016)

    Google Scholar 

  12. Przewozniczek, M.: Active multi population pattern searching algorithm for flow optimization in computer networks – the novel coevolution schema combined with linkage learning. Inf. Sci. 355–356, 15–36 (2016)

    Article  Google Scholar 

  13. Przewozniczek, M., Walkowiak, K., Aibin, M.: The evolutionary cost of Baldwin effect in the routing and spectrum allocation problem in elastic optical networks. Appl. Soft Comput. (2016, in press)

    Google Scholar 

  14. Resende, M.G.C., Ribeiro, C.C.: Optimization by GRASP: Greedy Randomized Adaptive Search Procedures. Springer, Heidelberg (2016). ISBN-10: 149396528X ISBN-13: 978-1493965281

    Book  MATH  Google Scholar 

  15. Simmons, J.M.: Optical Network Design and Planning, 2nd edn. Springer, Heidelberg (2014)

    Book  Google Scholar 

  16. Velasco, L., Klinkowski, M., Ruiz, M., Comellas, J.: Modeling the routing and spectrum allocation problem for flexgrid optical networks. Photon Netw. Commun. 24(3), 177–186 (2012)

    Article  Google Scholar 

  17. Walkowiak, K., Przewozniczek, M., Pajak, K.: Heuristic algorithms for survivable P2P multicasting. Appl. Artif. Intell. 27(4), 278–303 (2013)

    Article  Google Scholar 

  18. Walkowiak, K., Goścień, R., Klinkowski, M., Woźniak, M.: Optimization of multicast traffic in elastic optical networks with distance-adaptive transmission. IEEE Commun. Lett. 18, 2117–2120 (2014)

    Article  Google Scholar 

  19. Walkowiak, K., Goścień, R., Woźniak, M., Klinkowski, M.: Joint optimization of multicast and unicast flows in elastic optical networks. In: Proceedings of IEEE International Conference on Communications ICC, pp. 5186–5191 (2015)

    Google Scholar 

  20. Walkowiak, K.: Modeling and Optimization of Cloud-Ready and Content-Oriented Networks. Springer, Heidelberg (2016)

    Book  Google Scholar 

  21. Yu, X., Tornatore, M., Xia, M., Wang, J., Zhang, J., Zhao, Y., Zhang, J., Mukherjee, B.: Migration from fixed grid to flexible grid in optical networks. IEEE Commun. Mag. 53(2), 34–43 (2015)

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported in by the Polish National Science Centre (NCN) under Grant 2015/19/D/ST6/03115.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Michal Witold Przewozniczek .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Przewozniczek, M.W., Walkowiak, K., Aibin, M. (2017). The Effectiveness of the Simplicity in Evolutionary Computation. In: Nguyen, N., Tojo, S., Nguyen, L., Trawiński, B. (eds) Intelligent Information and Database Systems. ACIIDS 2017. Lecture Notes in Computer Science(), vol 10192. Springer, Cham. https://doi.org/10.1007/978-3-319-54430-4_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-54430-4_38

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-54429-8

  • Online ISBN: 978-3-319-54430-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics