Skip to main content

Distributed Genetic Algorithms on Portable Devices for Smart Cities

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 10268))

Abstract

In the future smart city, citizens are interconnected and easily share information anywhere, anytime. Through a sensor network integrated with real time monitoring systems, data are collected, processed and analyzed. Of course, this is already happening, in part. Nowdays, the number of portable devices that are available to all people is huge and we can find them everywhere, they are not only smartphones but also tablets, IoT, and other. This is a perfect scenario to start new lines of research on the actual suitability of portable devices to solve real optimization and machine learning problems. On the one hand, the fact that they are everywhere encourages research aimed at their collaboration in a distributed way. On the other hand, genetic algorithms are metaheuristics where parallelization takes on great importance. In this paper, we analyze the numerical behavior of distributed genetic algorithms on portable devices. We focus on the behavior of the distributed algorithm when we modify the number of interconnected devices, as well as the behavior of the algorithm when the devices with different performances collaborate together. As a conclusion, the numerical results support the future research in the concept of distributed intelligence everywhere, since algorithms worked out accurate and efficient results.

This research has been partially funded by I Plan Propio de Investigacón y Transferencia de la Universidad de Málaga 2016–2017. Also, partially funded by the Spanish MINECO project TIN2014-57341-R (http://moveon.lcc.uma.es).

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Alba, E., Blum, C., Asasi, P., Leon, C., Gomez, J.A.: Optimization Techniques for Solving Complex Problems, vol. 76. Wiley, Hoboken (2009)

    Book  Google Scholar 

  2. Bäck, T., Fogel, D.B., Michalewicz, Z.: Handbook of Evolutionary Computation. Oxford, New York (1997)

    Book  MATH  Google Scholar 

  3. Michaelwicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, Heidelberg (1992)

    Book  Google Scholar 

  4. Alba, E., Tomassini, M.: Parallelism and evolutionary algorithms. IEEE Trans. Evol. Comput. 6(5), 443–462 (2002)

    Article  Google Scholar 

  5. Letchford, A.N., Lysgaard, J., Eglese, R.W.: A branch-and-cut algorithm for the capacitated open vehicle routing problem. J. Oper. Res. Soc. 58(12), 1642–1651 (2007)

    Article  MATH  Google Scholar 

  6. Wassan, N.A., Wassan, A.H., Nagy, G.: A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries. J. Comb. Optim. 15(4), 368–386 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  7. Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 6(1), 80–91 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  8. Gary, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness (1979)

    Google Scholar 

  9. Alba, E., Dorronsoro, B.: Solving the vehicle routing problem by using cellular genetic algorithms. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2004. LNCS, vol. 3004, pp. 11–20. Springer, Heidelberg (2004). doi:10.1007/978-3-540-24652-7_2

    Chapter  Google Scholar 

  10. Alba, E., Dorronsoro, B.: Cellular Genetic Algorithms, vol. 42. Springer Science & Business Media, New York (2009)

    MATH  Google Scholar 

  11. Alba, E., Dorronsoro, B.: Computing nine new best-so-far solutions for capacitated vrp with a cellular genetic algorithm. Inf. Process. Lett. 98(6), 225–230 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  12. Cintrano, C., Alba, E.: Genetic algorithms running into portable devices: a first approach. In: Luaces, O., Gámez, J.A., Barrenechea, E., Troncoso, A., Galar, M., Quintián, H., Corchado, E. (eds.) CAEPIA 2016. LNCS, vol. 9868, pp. 383–393. Springer, Cham (2016). doi:10.1007/978-3-319-44636-3_36

    Chapter  Google Scholar 

  13. Christofides, N.: Combinatorial optimization. In: Nicos, C. (ed.) A Wiley-Interscience Publication, Based on a series of lectures, given at the Summer School in Combinatorial Optimization, held in Sogesta, Italy, 30 May - 11 June 1977. Wiley, Chichester (1979)

    Google Scholar 

  14. Nesmachnow, S., Cancela, H., Alba, E.: Heterogeneous computing scheduling with evolutionary algorithms. Soft. Comput. 15(4), 685–701 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to J. A. Morell .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Morell, J.A., Alba, E. (2017). Distributed Genetic Algorithms on Portable Devices for Smart Cities. In: Alba, E., Chicano, F., Luque, G. (eds) Smart Cities. Smart-CT 2017. Lecture Notes in Computer Science(), vol 10268. Springer, Cham. https://doi.org/10.1007/978-3-319-59513-9_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-59513-9_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-59512-2

  • Online ISBN: 978-3-319-59513-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics