Abstract
The cyclic bandwidth sum problem (CBSP) consists in embedding a host graph into a cycle graph while minimizing the sum of cyclic distances between guest adjacent vertices embedded in the host. While the problem has been addressed by heuristic and metaheuristic methods, to the best of our knowledge, this is the first effort to apply exact methods. This work presents preliminary results on the use of constraint programming (CP) and a branch & bound (B &B) algorithm to solve the cyclic bandwidth sum problem in small graphs from commonly employed topologies. We created a CP model of the CBSP and devised two further refined versions by adding new constraints based in problem-specific knowledge. For our proposed B &B algorithm, we designed a custom criterion for search priority employing estimations of potential cost. The results provided an assessment of the pros and cons of both methodologies, with the CP approach offering a more reliable alternative in terms of solved instances, execution time, and implementation effort.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Lower and upper bounds: https://www.tamps.cinvestav.mx/ertello/cbsp.php.
References
Bockmayr A, Hooker JN (2005) Constraint programming. In: Discrete optimization, Handbooks in operations research and management science, vol 12. Elsevier, pp. 559–600. https://doi.org/10.1016/S0927-0507(05)12010-6
Chung FRK (1988) Labelings of graphs. In: Beineke LW, Wilson RJ (eds) Selected topics in graph theory, vol 3, chap 7. Academic Press, pp 151–168
Hamon R, Borgnat P, Flandrin P, Robardet C (2016) Relabelling vertices according to the network structure by minimizing the cyclic bandwidth sum. J Complex Netw 4(4):534–560. https://doi.org/10.1093/comnet/cnw006
Jianxiu H (2001) Cyclic bandwidth sum of graphs. Appl Math J Chin Univ 16(2):115–121. https://doi.org/10.1007/s11766-001-0016-0
Li Y, Liang Y (2018) Compressed sensing in multi-hop large-scale wireless sensor networks based on routing topology tomography. IEEE Access. https://doi.org/10.1109/ACCESS.2018.2834550
Liberatore V (2002) Multicast scheduling for list requests. In: Proceedings of the 21st annual joint conference of the IEEE computer and communications societies, vol 2. IEEE, pp 1129–1137. https://doi.org/10.1109/INFCOM.2002.1019361
Mehlhorn K, Thiel S (2000) Faster algorithms for bound-consistency of the sortedness and the alldifferent constraint. In: Dechter R (ed) Principles and practice of constraint programming—CP 2000. Springer, Berlin Heidelberg, Berlin, Heidelberg, pp 306–319
Monien B, Sudborough IH (1990) Embedding one interconnection network in another, vol 7. Springer, pp 257–282. https://doi.org/10.1007/978-3-7091-9076-0_13
Morrison DR, Jacobson SH, Sauppe JJ, Sewell EC (2016) Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning. Discr Optim 19:79–102. https://doi.org/10.1016/j.disopt.2016.01.005
Nethercote N, Stuckey PJ, Becket R, Brand S, Duck GJ, Tack G (2007) Minizinc: towards a standard CP modelling language. In: Bessière C (ed) Principles and practice of constraint programming—CP 2007. Springer, Berlin Heidelberg, Berlin, Heidelberg, pp 529–543
Pesant G, Gendreau M (1999) A constraint programming framework for local search methods. J Heurist 5(3):255–279. https://doi.org/10.1023/A:1009694016861
Rodriguez-Tello E, Narvaez-Teran V, Lardeux F (2019) Dynamic multi-armed bandit algorithm for the cyclic bandwidth sum problem. IEEE Access 7:40258–40270. https://doi.org/10.1109/ACCESS.2019.2906840
Rossi F, van Beek P, Walsh T (eds) (2006) Handbook of constraint programming, 1st edn. Elsevier Science
Satsangi D, Srivastava K, Gursaran (2012) General variable neighbourhood search for cyclic bandwidth sum minimization problem. In: Proceedings of the students conference on engineering and systems. IEEE Press, pp 1–6. https://doi.org/10.1109/SCES.2012.6199079
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Narvaez-Teran, V., Rodriguez-Tello, E., Lardeux, F., Ramírez-Torres, G. (2023). Preliminary Results on Constraint Programming and Branch & Bound Algorithms for the Cyclic Bandwidth Sum Problem. In: Yang, XS., Sherratt, S., Dey, N., Joshi, A. (eds) Proceedings of Seventh International Congress on Information and Communication Technology. Lecture Notes in Networks and Systems, vol 448. Springer, Singapore. https://doi.org/10.1007/978-981-19-1610-6_11
Download citation
DOI: https://doi.org/10.1007/978-981-19-1610-6_11
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-19-1609-0
Online ISBN: 978-981-19-1610-6
eBook Packages: EngineeringEngineering (R0)