{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,25]],"date-time":"2026-08-25T10:08:39Z","timestamp":1787652519902,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030917012","type":"print"},{"value":"9783030917029","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-91702-9_8","type":"book-chapter","created":{"date-parts":[[2021,11,27]],"date-time":"2021-11-27T20:02:46Z","timestamp":1638043366000},"page":"111-125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Graph-Based Crossover and Soft-Repair Operators for the Steiner Tree Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1715-0852","authenticated-orcid":false,"given":"Giliard Almeida","family":"de Godoi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4027-8851","authenticated-orcid":false,"given":"Renato","family":"Tin\u00f3s","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8972-5221","authenticated-orcid":false,"given":"Danilo Sipoli","family":"Sanches","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,11,28]]},"reference":[{"issue":"11","key":"8_CR1","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley, J.E.: OR-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069\u20131072 (1990)","journal-title":"J. Oper. Res. Soc."},{"key":"8_CR2","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Algoritmos: Teoria e Pr\u00e1tica. Editora Elsevier (2012)"},{"issue":"4","key":"8_CR3","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/net.3230260403","volume":"26","author":"H Esbensen","year":"1995","unstructured":"Esbensen, H.: Computing near-optimal solutions to the Steiner problem in a graph using a genetic algorithm. Networks 26(4), 173\u2013185 (1995). https:\/\/doi.org\/10.1002\/net.3230260403","journal-title":"Networks"},{"issue":"2","key":"8_CR4","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1002\/net.3230010203","volume":"1","author":"SL Hakimi","year":"1971","unstructured":"Hakimi, S.L.: Steiner\u2019s problem in graphs and its implications. Networks 1(2), 113\u2013133 (1971). https:\/\/doi.org\/10.1002\/net.3230010203","journal-title":"Networks"},{"issue":"4","key":"8_CR5","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1057\/jors.1993.69","volume":"44","author":"A Kapsalis","year":"1993","unstructured":"Kapsalis, A., Rayward-smith, V.J., Smith, G.D.: Solving the graphical Steiner tree problem using genetic algorithms. J. Oper. Res. Soc. 44(4), 397\u2013406 (1993)","journal-title":"J. Oper. Res. Soc."},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among Combinatorial Problems, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF00288961","volume":"15","author":"L Kou","year":"1981","unstructured":"Kou, L., Markowsky, G., Berman, L.: A fast algorithm for Steiner trees. Acta Inf. 15(2), 141\u2013145 (1981). https:\/\/doi.org\/10.1007\/BF00288961","journal-title":"Acta Inf."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7(1), 48\u201350 (1956). http:\/\/www.jstor.org\/stable\/2033241","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1002\/net.22005","volume":"77","author":"I Ljubi\u0107","year":"2021","unstructured":"Ljubi\u0107, I.: Solving Steiner trees: recent advances, challenges, and perspectives. Networks 77(2), 177\u2013204 (2021)","journal-title":"Networks"},{"issue":"6","key":"8_CR10","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36(6), 1389\u20131401 (1957)","journal-title":"Bell Syst. Tech. J."},{"issue":"3","key":"8_CR11","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1109\/TEVC.2002.807275","volume":"7","author":"GR Raidl","year":"2003","unstructured":"Raidl, G.R., Julstrom, B.A.: Edge sets: an effective evolutionary coding of spanning trees. IEEE Trans. Evol. Comput. 7(3), 225\u2013239 (2003). https:\/\/doi.org\/10.1109\/TEVC.2002.807275","journal-title":"IEEE Trans. Evol. Comput."},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Tin\u00f3s, R., Whitley, D., Ochoa, G.: Generalized Asymmetric Partition Crossover (GAPX) for the asymmetric TSP. In: Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, GECCO 2014, pp. 501\u2013508. ACM, New York (2014)","DOI":"10.1145\/2576768.2598245"},{"key":"8_CR13","doi-asserted-by":"publisher","unstructured":"Tin\u00f3s, R., Whitley, D., Ochoa, G.: A new generalized partition crossover for the traveling salesman problem: tunneling between local optima. Evol. Comput. 28(2), 255\u2013288 (2020). https:\/\/doi.org\/10.1162\/evco_a_00254, pMID: 30900928","DOI":"10.1162\/evco_a_00254"},{"key":"8_CR14","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-319-91086-4_8","volume-title":"Handbook of Metaheuristics","author":"D Whitley","year":"2019","unstructured":"Whitley, D.: Next generation genetic algorithms: a user\u2019s guide and tutorial. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. ISORMS, vol. 272, pp. 245\u2013274. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91086-4_8"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Whitley, D., Hains, D., Howe, A.: Tunneling between optima: partition crossover for the traveling salesman problem. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, GECCO 2009, pp. 915\u2013922. ACM, New York (2009)","DOI":"10.1145\/1569901.1570026"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-642-15844-5_57","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"D Whitley","year":"2010","unstructured":"Whitley, D., Hains, D., Howe, A.: A hybrid genetic algorithm for the traveling salesman problem using generalized partition crossover. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6238, pp. 566\u2013575. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15844-5_57"}],"container-title":["Lecture Notes in Computer Science","Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91702-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:02:56Z","timestamp":1709812976000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91702-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030917012","9783030917029"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91702-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"28 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BRACIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazilian Conference on Intelligent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bracis2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/c4ai.inova.usp.br\/bracis\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"JEMS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"192","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":"77","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":"0","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":"40% - 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":"3","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":"3.1","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to COVID-19, the conference was held as an online event.","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)"}}]}}