Skip to main content
SpringerLink
Log in

Comparative Study of Different Memetic Algorithm Configurations for the Cyclic Bandwidth Sum Problem

  • Conference paper
  • First Online:
Book cover Parallel Problem Solving from Nature – PPSN XV (PPSN 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11101))

Included in the following conference series:

Abstract

The Cyclic Bandwidth Sum Problem (CBSP) is an NP-Hard Graph Embedding Problem which aims to embed a simple, finite graph (the guest) into a cycle graph of the same order (the host) while minimizing the sum of cyclic distances in the host between guest’s adjacent nodes. This paper presents preliminary results of our research on the design of a Memetic Algorithm (MA) able to solve the CBSP. A total of 24 MA versions, induced by all possible combinations of four selection schemes, two operators for recombination and three for mutation, were tested over a set of 25 representative graphs. Results compared with respect to the state-of-the-art top algorithm showed that all the tested MA versions were able to consistently improve its results and give us some insights on the suitability of the tested operators.

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

Access this chapter

Log in via an institution
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

Institutional subscriptions

Notes

  1. 1.

    BSP is the problem of embedding a graph into a path while minimizing the sum of linear distances between embedded vertices.

  2. 2.

    http://www.tamps.cinvestav.mx/~ertello/cbsp-ma.php.

References

  1. Bhatt, S.N., Leighton, F.T.: A framework for solving VLSI graph layout problems. J. Comput. Syst. Sci. 28(2), 300–343 (1984). https://doi.org/10.1016/0022-0000(84)90071-0

    Article  MathSciNet  MATH  Google Scholar 

  2. Chen, Y., Yan, J.: A study on cyclic bandwidth sum. J. Comb. Optim. 14(2), 295–308 (2007). https://doi.org/10.1007/s10878-007-9051-y

    Article  MathSciNet  MATH  Google Scholar 

  3. Chung, F.R.K.: Labelings of graphs (Chap. 7). In: Beineke, L.W., Wilson, R.J. (eds.) Selected Topics in Graph Theory, vol. 3, pp. 151–168. Academic Press, Cambridge (1988)

    Google Scholar 

  4. Davis, L.: Applying adaptive algorithms to epistatic domains. In: Proceedings of the 9th IJCAI, vol. 1, pp. 162–164. Morgan Kaufmann Publishers Inc., San Francisco (1985)

    Google Scholar 

  5. Diaz, J., Petit, J., Serna, M.: A survey of graph layout problems. ACM Comput. Surv. 34(3), 313–356 (2002). https://doi.org/10.1145/568522.568523

    Article  Google Scholar 

  6. Hamon, R., Borgnat, P., Flandrin, P., Robardet, C.: Relabelling vertices according to the network structure by minimizing the cyclic bandwidth sum. J. Complex Netw. 4(4), 534–560 (2016). https://doi.org/10.1093/comnet/cnw006

    Article  MathSciNet  Google Scholar 

  7. Harper, L.: Optimal assignment of numbers to vertices. J. SIAM 12(1), 131–135 (1964). https://doi.org/10.1137/0112012

    Article  MathSciNet  MATH  Google Scholar 

  8. Jaccard, P.: The distribution of the flora in the alpine zone. New Phytol. 11(2), 37–50 (1912). https://doi.org/10.1111/j.1469-8137.1912.tb05611.x

    Article  Google Scholar 

  9. Jianxiu, H.: Cyclic bandwidth sum of graphs. Appl. Math. J. Chin. Univ. 16(2), 115–121 (2001). https://doi.org/10.1007/s11766-001-0016-0

    Article  MathSciNet  MATH  Google Scholar 

  10. Li, Y., Liang, Y.: Compressed sensing in multi-hop large-scale wireless sensor networks based on routing topology tomography. IEEE Access 6, 27637–27650 (2018). https://doi.org/10.1109/ACCESS.2018.2834550

    Article  Google Scholar 

  11. Liberatore, V.: Multicast scheduling for list requests. In: Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 2, pp. 1129–1137. IEEE (2002). https://doi.org/10.1109/INFCOM.2002.1019361

  12. Monien, B., Sudborough, I.H.: Embedding one interconnection network in another. In: Tinhofer, G., Mayr, E., Noltemeier, H., Syslo, M.M. (eds.) Computational Graph Theory, vol. 7, pp. 257–282. Springer, Vienna (1990). https://doi.org/10.1007/978-3-7091-9076-0_13

    Chapter  Google Scholar 

  13. Oliver, I., Smith, D., Holland, J.: A study of permutation crossover operators on the traveling salesman problem. In: Proceedings of the 2nd International Conference on Genetic Algorithms and Their Application, pp. 224–230. L. Erlbaum Associates Inc., Hillsdale (1987)

    Google Scholar 

  14. Satsangi, D., Srivastava, K., Gursaran, S.: General variable neighbourhood search for cyclic bandwidth sum minimization problem. In: Proceedings of the Students Conference on Engineering and Systems, pp. 1–6. IEEE Press, March 2012. https://doi.org/10.1109/SCES.2012.6199079

  15. Ullman, J.D.: Computational Aspects of VLSI. Computer Science Press, Rockville (1984)

    MATH  Google Scholar 

  16. Yuan, J.: Cyclic arrangement of graphs. In: Graph Theory Notes of New York, pp. 6–10. New York Academy of Sciences (1995)

    Google Scholar 

Download references

Acknowledgments

The second author acknowledges support from CONACyT through a scholarship to pursue graduate studies at CINVESTAV-Tamaulipas.

Author information

Authors and Affiliations

  1. CINVESTAV – Tamaulipas, Km. 5.5 Carretera Victoria-Soto La Marina, 87130, Victoria, Tamaulipas, Mexico

    Eduardo Rodriguez-Tello & Valentina Narvaez-Teran

  2. LERIA, Université d’Angers, 2 Boulevard Lavoisier, 49045, Angers, France

    Fréderic Lardeux

Authors
  1. Eduardo Rodriguez-Tello
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Valentina Narvaez-Teran
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fréderic Lardeux
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Eduardo Rodriguez-Tello .

Editor information

Editors and Affiliations

  1. Inria Saclay, Palaiseau, France

    Anne Auger

  2. University of Coimbra, Coimbra, Portugal

    Carlos M. Fonseca

  3. University of Coimbra, Coimbra, Portugal

    Nuno Lourenço

  4. University of Coimbra, Coimbra, Portugal

    Penousal Machado

  5. University of Coimbra, Coimbra, Portugal

    Luís Paquete

  6. Colorado State University, Fort Collins, Colorado, USA

    Darrell Whitley

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Rodriguez-Tello, E., Narvaez-Teran, V., Lardeux, F. (2018). Comparative Study of Different Memetic Algorithm Configurations for the Cyclic Bandwidth Sum Problem. In: Auger, A., Fonseca, C., Lourenço, N., Machado, P., Paquete, L., Whitley, D. (eds) Parallel Problem Solving from Nature – PPSN XV. PPSN 2018. Lecture Notes in Computer Science(), vol 11101. Springer, Cham. https://doi.org/10.1007/978-3-319-99253-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-99253-2_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-99252-5

  • Online ISBN: 978-3-319-99253-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation