{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:54:09Z","timestamp":1760648049308,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031646041"},{"type":"electronic","value":"9783031646058"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-64605-8_9","type":"book-chapter","created":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T05:01:59Z","timestamp":1719810119000},"page":"125-136","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Iterated Local Search with\u00a0Tabu Search for\u00a0the\u00a0Bandwidth Reduction Problem in\u00a0Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6364-8347","authenticated-orcid":false,"given":"Alexandre Augusto Alberto Moreira d","family":"Abreu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4863-542X","authenticated-orcid":false,"given":"Sanderson L.","family":"Gonzaga de Oliveira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,2]]},"reference":[{"key":"9_CR1","unstructured":"Baum, E.B.: Iterated descent: a better algorithm for local search in combinatorial optimization problems. Technical report, Caltech, Pasadena, CA (1986)"},{"issue":"9","key":"9_CR2","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1057\/jors.1981.159","volume":"32","author":"J Baxter","year":"1981","unstructured":"Baxter, J.: Local optima avoidance in depot location. J. Oper. Res. Soc. 32(9), 815 (1981)","journal-title":"J. Oper. Res. Soc."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Chagas, G.O., Gonzaga de Oliveira, S.L.: Metaheuristic-based heuristics for symmetric-matrix bandwidth reduction: a systematic review. Procedia Comput. Sci. (ICCS 2015 International Conference on Computational Science) 51, 211\u2013220 (2015)","DOI":"10.1016\/j.procs.2015.05.229"},{"issue":"2","key":"9_CR4","doi-asserted-by":"publisher","first-page":"169","DOI":"10.15388\/Informatica.2013.390","volume":"24","author":"G Czibula","year":"2013","unstructured":"Czibula, G., Cri\u015fan, G.C., Pintea, C.M., Czibula, I.G.: Soft computing approaches on the bandwidth problem. Informatica 24(2), 169\u2013180 (2013)","journal-title":"Informatica"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Davis, T., Hu, Y.: The university of florida sparse matrix collection. ACM Trans. Math. Softw. 38, 1 (11 2011)","DOI":"10.1145\/2049662.2049663"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Freire, M., Marichal, R., Gonzaga de Oliveira, S.L., Dufrechou, E., Ezzatti, P.: Enhancing the sparse matrix storage using reordering techniques. In: Barrios H., C.J., Rizzi, S., Meneses, E., Mocskos, E., Monsalve Diaz, J.M., Montoya, J. (eds) High Performance Computing, CARLA 2023, CCIS, vol. 1887, pp. 66\u201376. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-52186-7_5","DOI":"10.1007\/978-3-031-52186-7_5"},{"key":"9_CR7","volume-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"A George","year":"1981","unstructured":"George, A., Liu, J.: Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, Englewood Cliffs, New Jersey, USA (1981)"},{"issue":"3","key":"9_CR8","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1145\/355841.355845","volume":"5","author":"A George","year":"1979","unstructured":"George, A., Liu, J.W.H.: An implementation of a pseudoperipheral node finder. ACM Trans. Math. Softw. 5(3), 284\u2013295 (1979)","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"9_CR9","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1137\/0713023","volume":"13","author":"NE Gibbs","year":"1976","unstructured":"Gibbs, N.E., Poole, W.G., Stockmeyer, P.K.: An algorithm for reducing the bandwidth and profile of a sparse matrix. SIAM J. Numer. Anal. 13(2), 236\u2013250 (1976)","journal-title":"SIAM J. Numer. Anal."},{"issue":"5","key":"9_CR10","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13(5), 533\u2013549 (1986)","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"9_CR11","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10732-010-9143-1","volume":"17","author":"JF Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.C.: Biased random-key genetic algorithms for combinatorial optimization. J. Heuristics 17(5), 487\u2013525 (2011)","journal-title":"J. Heuristics"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Gonzaga de Oliveira, S.L.: An evaluation of heuristic methods for the bandwidth reduction of large-scale graphs. Revista Pesquisa Operacional 43(e268255), 1\u201322 (2023)","DOI":"10.1590\/0101-7438.2023.043.00268255"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-319-42085-1_5","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2016","author":"SL Gonzaga de Oliveira","year":"2016","unstructured":"Gonzaga de Oliveira, S.L., de Abreu, A.A.A.M., Robaina, D., Kischinhevsky, M.: A new heuristic for bandwidth and profile reductions of matrices using a self-organizing map. In: Gervasi, O., et al. (eds.) ICCSA 2016. LNCS, vol. 9786, pp. 54\u201370. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-42085-1_5"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Gonzaga de Oliveira, S.L., Abreu, A.A.A.M., Robaina, D.T., Kischnhevsky, M.: An evaluation of four reordering algorithms to reduce the computational cost of the Jacobi-preconditioned conjugate gradient method using high-precision arithmetic. Int. J. Bus. Intell. Data Min. 12(2), 190\u2013209 (2017)","DOI":"10.1504\/IJBIDM.2017.084281"},{"key":"9_CR15","unstructured":"Gonzaga de Oliveira, S.L., Chagas, G.O.: A systematic review of heuristics for symmetric-matrix bandwidth reduction: methods not based on metaheuristics. In: Proceedings of the Brazilian Symposium on Operations Research (SBPO 2015), Sobrapo, Pernambuco, Brazil, August 2015"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Gonzaga de Oliveira, S.L., Silva, L.M.: Evolving reordering algorithms using an ant colony hyperheuristic approach for accelerating the convergence of the ICCG method. Eng. Comput. 36(4), 1857\u20131873 (2019)","DOI":"10.1007\/s00366-019-00801-5"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Gonzaga de Oliveira, S.L., Carvalho, C.: Metaheuristic algorithms for the bandwidth reduction of large-scale matrices. J. Comb. Optim. 43, 727\u2013784 (2022)","DOI":"10.1007\/s10878-021-00801-6"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Gonzaga de Oliveira, S.L., Silva, L.M.: Low-cost heuristics for matrix bandwidth reduction combined with a Hill-Climbing strategy. RAIRO-Oper. Res. 55(4), 2247\u20132264 (2021)","DOI":"10.1051\/ro\/2021102"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Gonzaga de Oliveira, S., Silva, L.M.: An ant colony hyperheuristic approach for matrix bandwidth reduction. Appl. Soft Comput. 94, 106434 (2020)","DOI":"10.1016\/j.asoc.2020.106434"},{"issue":"1\u20132","key":"9_CR20","first-page":"65","volume":"12","author":"J Guan","year":"2019","unstructured":"Guan, J., Lin, G., Feng, H.B.: Ant colony optimisation with local search for the bandwidth minimisation problem on graphs. Int. J. Intell. Inf. Database Syst. 12(1\u20132), 65\u201378 (2019)","journal-title":"Int. J. Intell. Inf. Database Syst."},{"issue":"4","key":"9_CR21","first-page":"535","volume":"16","author":"A Kaveh","year":"2015","unstructured":"Kaveh, A., Bijari, S.: Bandwidth optimization using CBO and ECBO. Asian J. Civel Eng. 16(4), 535\u2013545 (2015)","journal-title":"Asian J. Civel Eng."},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1108\/02644400910943644","volume":"26","author":"A Kaveh","year":"2009","unstructured":"Kaveh, A., Sharafi, P.: Nodal ordering for bandwidth reduction using ant system algorithm. Eng. Comput. 26, 313\u2013323 (2009)","journal-title":"Eng. Comput."},{"key":"9_CR23","first-page":"39","volume":"36","author":"A Kaveh","year":"2012","unstructured":"Kaveh, A., Sharafi, P.: Ordering for bandwidth and profile minimization problems via charged system search algorithm. IJST Trans. Civil Eng. 36, 39\u201352 (2012)","journal-title":"IJST Trans. Civil Eng."},{"issue":"4598","key":"9_CR24","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"7","key":"9_CR25","doi-asserted-by":"publisher","first-page":"7988","DOI":"10.1007\/s10489-022-03802-y","volume":"53","author":"B Koohestani","year":"2022","unstructured":"Koohestani, B.: On the solution of the graph bandwidth problem by means of search methods. Appl. Intell. 53(7), 7988\u20138004 (2022)","journal-title":"Appl. Intell."},{"key":"9_CR26","doi-asserted-by":"publisher","unstructured":"Koohestani, B., Poli, R.: A hyper-heuristic approach to evolving algorithms for bandwidth reduction based on genetic programming. In: Bramer, M., Petridis, M., Nolle, L. (eds.) Research and Development in Intelligent Systems XXVIII, SGAI 2011, pp. 93\u2013106. Springer, London (2011). https:\/\/doi.org\/10.1007\/978-1-4471-2318-7_7","DOI":"10.1007\/978-1-4471-2318-7_7"},{"issue":"1","key":"9_CR27","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.ejor.2005.02.066","volume":"174","author":"A Lim","year":"2006","unstructured":"Lim, A., Rodrigues, B., Xiao, F.: Heuristics for matrix bandwidth reduction. Eur. J. Oper. Res. 174(1), 69\u201391 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR28","doi-asserted-by":"publisher","unstructured":"Mafteiu-Scai, L., Mafteiu, E., Mafteiu-Scai, R.: Brain storm optimization algorithms for solving equations systems. In: Cheng, S., Shi, Y. (eds.) Brain Storm Optimization Algorithms. Adaptation, Learning, and Optimization, vol. 23, pp. 189\u2013220. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-15070-9_8","DOI":"10.1007\/978-3-030-15070-9_8"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Mafteiu-Scai, L.O., Mafteiu-Scai, E., Voina, T.: Bandwidths optimization on sparse matrices using brain storm optimization. In: 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), pp. 219\u2013224. IEEE, Timisoara, Romania (2017)","DOI":"10.1109\/SYNASC.2017.00043"},{"issue":"2","key":"9_CR30","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1016\/S0377-2217(00)00325-8","volume":"135","author":"R Mart\u00ed","year":"2001","unstructured":"Mart\u00ed, R., Laguna, M., Glover, F., Campos, V.: Reducing the bandwidth of a sparse matrix with tabu search. Eur. J. Oper. Res. 135(2), 450\u2013459 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"Matsakis, N.D., Klock, F.S.: The rust language. In: Proceedings of the 2014 ACM SIGAda Annual Conference on High Integrity Language Technology, HILT 2014, pp. 103\u2013104. Association for Computing Machinery, New York, NY, USA (2014)","DOI":"10.1145\/2663171.2663188"},{"issue":"1","key":"9_CR32","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ejor.2008.12.015","volume":"200","author":"N Mladenovic","year":"2010","unstructured":"Mladenovic, N., Urosevic, D., P\u00e9rez-Brito, D., Garc\u00eda-Gonz\u00e1lez, C.G.: Variable neighbourhood search for bandwidth reduction. Eur. J. Oper. Res. 200(1), 14\u201327 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9_CR33","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF02280884","volume":"16","author":"CH Papadimitriou","year":"1976","unstructured":"Papadimitriou, C.H.: The NP-completeness of the bandwidth minimization problem. Computing 16(3), 263\u2013270 (1976)","journal-title":"Computing"},{"key":"9_CR34","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-642-13769-3_49","volume-title":"Hybrid Artificial Intelligence Systems","author":"C-M Pintea","year":"2010","unstructured":"Pintea, C.-M., Cri\u015fan, G.-C., Chira, C.: A hybrid ACO Approach to the Matrix Bandwidth Minimization Problem. In: Gra\u00f1a Romay, M., Corchado, E., Garcia Sebastian, M.T. (eds.) HAIS 2010. LNCS (LNAI), vol. 6076, pp. 405\u2013412. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13769-3_49"},{"issue":"3","key":"9_CR35","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1093\/jigpal\/jzr004","volume":"20","author":"CM Pintea","year":"2012","unstructured":"Pintea, C.M., Cri\u015fan, G.C., Shira, C.: Hybrid ant models with a transition policy for solving a complex problem. Log. J. IGPL 20(3), 560\u2013569 (2012)","journal-title":"Log. J. IGPL"},{"key":"9_CR36","doi-asserted-by":"crossref","unstructured":"Pi\u00f1ana, E., Plana, I., Campos, V., Mart\u00ed, R.: Grasp and path relinking for the matrix bandwidth minimization. Eur. J. Oper. Res. 153(1), 200\u2013210 (2004)","DOI":"10.1016\/S0377-2217(02)00715-4"},{"key":"9_CR37","doi-asserted-by":"crossref","unstructured":"Pop, P., Matei, O., Comes, C.A.: Reducing the bandwidth of a sparse matrix with a genetic algorithm. Optim. A J. Math. Program. Oper. Res. 63(12), 1851\u20131876 (2014)","DOI":"10.1080\/02331934.2013.830120"},{"issue":"3","key":"9_CR38","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1016\/j.ejor.2005.12.052","volume":"185","author":"E Rodriguez-Tello","year":"2008","unstructured":"Rodriguez-Tello, E., Hao, J.K., Torres-Jimenez, J.: An improved simulated annealing algorithm for bandwidth minimization. Eur. J. Oper. Res. 185(3), 1319\u20131335 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-030-58799-4_23","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2020","author":"PHG Silva","year":"2020","unstructured":"Silva, P.H.G., Brand\u00e3o, D.N., Morais, I.S., Gonzaga de Oliveira, S.L.: A biased random-key genetic algorithm for bandwidth reduction. In: Gervasi, O., et al. (eds.) ICCSA 2020. LNCS, vol. 12249, pp. 312\u2013321. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58799-4_23"},{"issue":"11","key":"9_CR40","doi-asserted-by":"publisher","first-page":"1801","DOI":"10.1109\/PROC.1967.6011","volume":"55","author":"W Tinney","year":"1967","unstructured":"Tinney, W., Walker, J.: Direct solutions of sparse network equations by optimally ordered triangular factorization. Proc. IEEE 55(11), 1801\u20131809 (1967)","journal-title":"Proc. IEEE"},{"key":"9_CR41","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.ins.2014.12.041","volume":"303","author":"J Torres-Jimenez","year":"2015","unstructured":"Torres-Jimenez, J., Izquierdo-Marquez, I., Garcia-Robledo, A., Gonzalez-Gomez, A., Bernal, J., Kacker, R.N.: A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs. Inf. Sci. 303, 33\u201349 (2015)","journal-title":"Inf. Sci."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-64605-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T05:02:59Z","timestamp":1719810179000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-64605-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031646041","9783031646058"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-64605-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"2 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hanoi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}