Skip to main content

A Memetic Algorithm for the Network Construction Problem with Due Dates

  • Conference paper
  • First Online:
Intelligent Systems Design and Applications (ISDA 2017)

Abstract

In this work, we present an effective memetic algorithm for a transportation network reconstruction problem. The problem addressed arises when the connections of a transportation network have been destroyed by a disaster, and then need to be rebuilt by a construction crew in order to minimize the damage caused in the post-disaster phase. Each vertex of the network has a due date that indicates its self-sufficiency, i.e., a time that this vertex may remain isolated from the network without causing more damages. The objective of the problem is to reconnect all the vertices of the network in order to minimize the maximum lateness in the recovery of the vertices. The computational results show that our memetic algorithm is able to find solutions with same or higher quality in short computation time for most instances when compared to the methods already present in the literature.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.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

Institutional subscriptions

References

  1. Abadie, A., Gardeazabal, J.: Terrorism and the world economy. Eur. Econ. Rev. 52(1), 1–27 (2008)

    Article  Google Scholar 

  2. Guha-Sapir, D., Hoyois, P.: Estimating populations affected by disasters: A review of methodological issues and research gaps. Centre for Research on the Epidemiology of Disasters (CRED), Institute of Health and Society (IRSS), University Catholique de Louvain, Brussels (2015)

    Google Scholar 

  3. Berktaş, N., Kara, B.Y., Karaan, O.E.: Solution methodologies for debris removal in disaster response. EURO J. Comput. Optim. 4(3–4), 403–445 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  4. Çelik, M.: Network restoration and recovery in humanitarian operations: framework, literature review, and research directions. Surv. Oper. Res. Manage. Sci. 21(2), 47–61 (2016)

    Google Scholar 

  5. Feng, C.M., Wang, T.C.: Highway emergency rehabilitation scheduling in post-earthquake 72 hours. J. 5th East. Asia Soc. Transp. Stud. 5, 3276–3285 (2003)

    Google Scholar 

  6. Hu, Z.H., Sheu, J.B.: Post-disaster debris reverse logistics management under psychological cost minimization. Transp. Res. Part B: Methodol. 55, 118–141 (2013)

    Article  Google Scholar 

  7. Averbakh, I., Pereira, J.: Network construction problems with due dates. Eur. J. Oper. Res. 244(3), 715–729 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  8. Chagas, J.B.C., Santos, A.G.: Abordagem Heurística para o Problema de Reconstrução de Redes de Transporte com Prazos de Recuperação. In: XLVIII Simpósio Brasileiro de Pesquisa Operacional (SBPO), pp. 1696–1707, Vitória, Espírito Santo, Brazil (2016)

    Google Scholar 

  9. Darwin, C., Bynum, W.F.: The Origin of Species by Means of Natural Selection: Or, the Preservation of Favored Races in the Struggle for Life. AL Burt, New York (2009)

    Google Scholar 

  10. Holland, J.H.: Genetic algorithms and the optimal allocation of trials. SIAM J. Comput. 2(2), 88–105 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  11. Holland, J.H.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. MIT press, Cambridge, MA (1992)

    Google Scholar 

  12. Moscato, P.: On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Technical Report, Caltech Concurrent Computation Program, C3P Report (1989)

    Google Scholar 

  13. Gong, M., Cai, Q., Li, Y., Ma, J.: An improved memetic algorithm for community detection in complex networks. In: IEEE Congress on Evolutionary Computation (CEC), pp. 1–8. IEEE Press, Brisbane, Australia (2012)

    Google Scholar 

  14. Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097–1100 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  15. López-Ibáñez, M., Dubois-Lacoste, J., Cáceres, L.P., Birattari, M., Stützle, T.: The irace package: Iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43–58 (2016)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

The authors thank Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) and Fundação de Amparo à Pesquisa do Estado de Minas Gerais (FAPEMIG) for the financial support of this project.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jonatas B. C. Chagas .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chagas, J.B.C., Santos, A.G., Souza, M.J.F. (2018). A Memetic Algorithm for the Network Construction Problem with Due Dates. In: Abraham, A., Muhuri, P., Muda, A., Gandhi, N. (eds) Intelligent Systems Design and Applications. ISDA 2017. Advances in Intelligent Systems and Computing, vol 736. Springer, Cham. https://doi.org/10.1007/978-3-319-76348-4_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-76348-4_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-76347-7

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

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics