{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T05:03:07Z","timestamp":1783141387867,"version":"3.54.6"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030587987","type":"print"},{"value":"9783030587994","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58799-4_23","type":"book-chapter","created":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T13:06:26Z","timestamp":1601471186000},"page":"312-321","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Biased Random-Key Genetic Algorithm for Bandwidth Reduction"],"prefix":"10.1007","author":[{"given":"P. H. G.","family":"Silva","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"D. N.","family":"Brand\u00e3o","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"I. S.","family":"Morais","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S. L. Gonzaga","family":"de Oliveira","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,10,1]]},"reference":[{"key":"23_CR1","first-page":"177","volume":"16","author":"CH Papadimitriou","year":"1976","unstructured":"Papadimitriou, C.H.: The NP-completeness of bandwidth minimization problem. Comput. J. 16, 177\u2013192 (1976)","journal-title":"Comput. J."},{"key":"23_CR2","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: The XLVII Brazilian Symposium of Operational Research (SBPO), Ipojuca-PE, Brazil, Sobrapo, August 2015"},{"key":"23_CR3","volume-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"A George","year":"1981","unstructured":"George, A., Liu, J.W.: Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, Englewood Cliffs (1981)"},{"issue":"2","key":"23_CR4","doi-asserted-by":"publisher","first-page":"1412","DOI":"10.1007\/s40314-016-0394-9","volume":"37","author":"SL Gonzaga de Oliveira","year":"2016","unstructured":"Gonzaga de Oliveira, S.L., Bernardes, J.A.B., Chagas, G.O.: An evaluation of low-cost heuristics for matrix bandwidth and profile reductions. Comput. Appl. Math. 37(2), 1412\u20131471 (2016). https:\/\/doi.org\/10.1007\/s40314-016-0394-9","journal-title":"Comput. Appl. Math."},{"key":"23_CR5","doi-asserted-by":"publisher","unstructured":"Gonzaga de Oliveira, S.L., Abreu, A.A.A.M.: An evaluation of pseudoperipheral vertex finders for the reverse Cuthill-Mckee method for bandwidth and profile reductions of symmetric matrices. In: Proceedings of the 37th International Conference of the Chilean Computer Science Society (SCCC), Santiago, Chile, November 2018, pp. 1\u20139. IEEE (2018). https:\/\/doi.org\/10.1109\/SCCC.2018.8705263","DOI":"10.1109\/SCCC.2018.8705263"},{"key":"23_CR6","doi-asserted-by":"publisher","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. (2019). https:\/\/doi.org\/10.1007\/s00366-019-00801-5)","DOI":"10.1007\/s00366-019-00801-5"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Gonzaga de Oliveira, S., Silva, L.: An ant colony hyperheuristic approach for matrix bandwidth reduction. Appl. Soft Comput. 94, 106434 (2020)","DOI":"10.1016\/j.asoc.2020.106434"},{"issue":"1","key":"23_CR8","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1137\/0613024","volume":"3","author":"JR Gilbert","year":"1992","unstructured":"Gilbert, J.R., Moler, C., Schreiber, R.: Sparse matrices in MATLAB: design and implementation. SIAM J. Matrix Anal. 3(1), 333\u2013356 (1992)","journal-title":"SIAM J. Matrix Anal."},{"key":"23_CR9","unstructured":"The MathWorks Inc.: MATLAB (1994\u20132018). http:\/\/www.mathworks.com\/products\/matlab\/"},{"key":"23_CR10","unstructured":"Eaton, J.W., Bateman, D., Hauberg, S., Wehbring, R.: GNU Octave version 4.0.0 manual: a high-level interactive language for numerical computations (2015)"},{"key":"23_CR11","unstructured":"Boost: Boost C++ libraries (2017). http:\/\/www.boost.org\/. Accessed 28 Jun 2017"},{"key":"23_CR12","unstructured":"Chagas, G.O., Gonzaga de Oliveira, S.L.: Metaheuristic-based heuristics for symmetric-matrix bandwidth reduction: a systematic review. Procedia Comput. Sci. 51, 211\u2013220 (2015)"},{"issue":"2","key":"23_CR13","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":"23_CR14","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s10479-009-0573-9","volume":"183","author":"V Campos","year":"2011","unstructured":"Campos, V., Pi\u00f1ana, E., Mart\u00ed, R.: Adaptive memory programming for matrix bandwidth minimization. Ann. Oper. Res. 183, 7\u201323 (2011)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"23_CR15","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/S0377-2217(02)00715-4","volume":"153","author":"E Pi\u00f1ana","year":"2004","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)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"23_CR16","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."},{"issue":"2","key":"23_CR17","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"},{"issue":"2","key":"23_CR18","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.asoc.2005.01.001","volume":"6","author":"A Lim","year":"2006","unstructured":"Lim, A., Lin, J., Rodrigues, B., Xiao, F.: Ant colony optimization with hill climbing for the bandwidth minimization problem. Appl. Soft Comput. 6(2), 180\u2013188 (2006)","journal-title":"Appl. Soft Comput."},{"key":"23_CR19","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":"23_CR20","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":"23_CR21","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. Logic J. IGPL 20(3), 560\u2013569 (2012)","journal-title":"Logic J. IGPL"},{"issue":"26","key":"23_CR22","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10489-006-0019-x","volume":"3","author":"A Lim","year":"2007","unstructured":"Lim, A., Lin, J., Xiao, F.: Particle swarm optimization and hill climbing for the bandwidth minimization problem. Appl. Intell. 3(26), 175\u2013182 (2007)","journal-title":"Appl. Intell."},{"key":"23_CR23","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., Jin-Kao, H., Torres-Jimenez, J.: An improved simulated annealing algorithm for bandwidth minimization. Eur. J. Oper. Res. 185, 1319\u20131335 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"23_CR24","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."},{"issue":"200","key":"23_CR25","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ejor.2008.12.015","volume":"1","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. 1(200), 14\u201327 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"23_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, 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"},{"key":"23_CR27","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-21222-2_9","volume-title":"Hybrid Artificial Intelligent Systems","author":"PC Pop","year":"2011","unstructured":"Pop, P.C., Matei, O.: An improved heuristic for the bandwidth minimization based on genetic programming. In: Corchado, E., Kurzy\u0144ski, M., Wo\u017aniak, M. (eds.) HAIS 2011. LNCS (LNAI), vol. 6679, pp. 67\u201374. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21222-2_9"},{"issue":"12","key":"23_CR28","first-page":"1851","volume":"63","author":"P Pop","year":"2013","unstructured":"Pop, P., Matei, O., Comes, C.A.: Reducing the bandwidth of a sparse matrix with a genetic algorithm. Optim. J. Math. Prog. Oper. Res. 63(12), 1851\u20131876 (2013)","journal-title":"Optim. J. Math. Prog. Oper. Res."},{"key":"23_CR29","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":"23_CR30","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":"23_CR31","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1023\/A:1014852026591","volume":"6","author":"M Ericsson","year":"2002","unstructured":"Ericsson, M., Resende, M.G.C., Pardalos, P.M.: A genetic algorithm for the weight setting problem in OSPF routing. J. Comb. Optim. 6, 299\u2013333 (2002)","journal-title":"J. Comb. Optim."},{"key":"23_CR32","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.cie.2004.07.003","volume":"47","author":"JF Gon\u00e7alves","year":"2004","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.C.: An evolutionary algorithm for manufacturing cell formation. Comput. Ind. Eng. 47, 247\u2013273 (2004)","journal-title":"Comput. Ind. Eng."},{"key":"23_CR33","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/s11750-011-0176-x","volume":"20","author":"MGC Resende","year":"2012","unstructured":"Resende, M.G.C.: Biased random-key genetic algorithms with applications in telecommunications. TOP 20, 130\u2013153 (2012)","journal-title":"TOP"},{"key":"23_CR34","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, 487\u2013525 (2011)","journal-title":"J. Heuristics"},{"key":"23_CR35","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6, 154\u2013160 (1994)","journal-title":"ORSA J. Comput."},{"key":"23_CR36","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1080\/10556788.2014.890197","volume":"30","author":"RF Toso","year":"2015","unstructured":"Toso, R.F., Resende, M.G.C.: A C++ application programming interface for biased random-key genetic algorithms. Optim. Methods Softw. 30, 81\u201393 (2015)","journal-title":"Optim. Methods Softw."},{"key":"23_CR37","doi-asserted-by":"crossref","unstructured":"Spears, W.M., De Jong, K.D.: On the virtues of parameterized uniform crossover. Technical report, DTIC Document (1995)","DOI":"10.21236\/ADA293985"},{"issue":"1","key":"23_CR38","first-page":"1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1\u201325 (2011)","journal-title":"ACM Trans. Math. Softw."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58799-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T16:09:36Z","timestamp":1619194176000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58799-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030587987","9783030587994"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58799-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"1 October 2020","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":"Cagliari","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Cyber chair 4","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1450","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"466","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Conference was held virtually due to COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}