{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T23:12:01Z","timestamp":1775862721544,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031539657","type":"print"},{"value":"9783031539664","type":"electronic"}],"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-53966-4_15","type":"book-chapter","created":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T18:02:29Z","timestamp":1707933749000},"page":"192-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Hybrid Steady-State Genetic Algorithm for\u00a0the\u00a0Minimum Conflict Spanning Tree Problem"],"prefix":"10.1007","author":[{"given":"Punit Kumar","family":"Chaubey","sequence":"first","affiliation":[]},{"given":"Shyam","family":"Sundar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,15]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","unstructured":"Carrabs, F., Cerrone, C., Pentangelo, R.: A multi-ethnic genetic approach for the minimum conflict weighted spanning tree problem. Networks 74 (2019). https:\/\/doi.org\/10.1002\/net.21883","DOI":"10.1002\/net.21883"},{"issue":"1","key":"15_CR2","first-page":"65","volume":"298","author":"F Carrabs","year":"2018","unstructured":"Carrabs, F., Cerulli, R., Pentangelo, R., Raiconi, A.: Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach. Ann. Oper. Res. 298(1), 65\u201378 (2018)","journal-title":"Ann. Oper. Res."},{"key":"15_CR3","series-title":"AIRO Springer Series","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-030-34960-8_39","volume-title":"Advances in Optimization and Decision Science for Society, Services and Enterprises","author":"C Cerrone","year":"2019","unstructured":"Cerrone, C., Di Placido, A., Russo, D.D.: A genetic algorithm for minimum conflict weighted spanning tree problem. In: Paolucci, M., Sciomachen, A., Uberti, P. (eds.) Advances in Optimization and Decision Science for Society, Services and Enterprises. ASS, vol. 3, pp. 445\u2013455. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34960-8_39"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Chaubey, P.K., Sundar, S.: Two phases of metaheuristic techniques for the minimum conflict weighted spanning tree problem. Appl. Soft Comput. 110205 (2023)","DOI":"10.1016\/j.asoc.2023.110205"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-642-04428-1_36","volume-title":"Algorithmic Decision Theory","author":"A Darmann","year":"2009","unstructured":"Darmann, A., Pferschy, U., Schauer, J.: Determining a minimum spanning tree with disjunctive constraints. In: Rossi, F., Tsoukias, A. (eds.) ADT 2009. LNCS (LNAI), vol. 5783, pp. 414\u2013423. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04428-1_36"},{"issue":"16","key":"15_CR6","doi-asserted-by":"publisher","first-page":"1726","DOI":"10.1016\/j.dam.2010.12.016","volume":"159","author":"A Darmann","year":"2011","unstructured":"Darmann, A., Pferschy, U., Schauer, J., Woeginger, G.J.: Paths, trees and matchings under disjunctive constraints. Discret. Appl. Math. 159(16), 1726\u20131735 (2011)","journal-title":"Discret. Appl. Math."},{"key":"15_CR7","volume-title":"Handbook of Genetic Algorithms","author":"L Davis","year":"1991","unstructured":"Davis, L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1991)"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.engappai.2015.08.012","volume":"46","author":"ZH Fu","year":"2015","unstructured":"Fu, Z.H., Hao, J.K.: A three-phase search approach for the quadratic minimum spanning tree problem. Eng. Appl. Artif. Intell. 46, 113\u2013130 (2015)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"15_CR9","volume-title":"Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications in Biology, Control, and Artificial Intelligence","author":"JH Holland","year":"1975","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications in Biology, Control, and Artificial Intelligence. University of Michigan Press, Ann Arbor (1975)"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-642-38236-9_31","volume-title":"Theory and Applications of Models of Computation","author":"MM Kant\u00e9","year":"2013","unstructured":"Kant\u00e9, M.M., Laforest, C., Mom\u00e8ge, B.: Trees in graphs with conflict edges or forbidden transitions. In: Chan, T.-H.H., Lau, L.C., Trevisan, L. (eds.) TAMC 2013. LNCS, vol. 7876, pp. 343\u2013354. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38236-9_31"},{"key":"15_CR11","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-319-18161-5_3","volume-title":"Modelling, Computation and Optimization in Information Systems and Management Sciences","author":"A Klein","year":"2015","unstructured":"Klein, A., Haugland, D., Bauer, J., Mommer, M.: An integer programming model for branching cable layouts in offshore wind farms. In: Le Thi, H.A., Pham Dinh, T., Nguyen, N.T. (eds.) Modelling, Computation and Optimization in Information Systems and Management Sciences. AISC, vol. 359, pp. 27\u201336. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18161-5_3"},{"issue":"4","key":"15_CR12","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1016\/j.cor.2012.10.022","volume":"40","author":"T \u00d6ncan","year":"2013","unstructured":"\u00d6ncan, T., Zhang, R., Punnen, A.P.: The minimum cost perfect matching problem with conflict pair constraints. Comput. Oper. Res. 40(4), 920\u2013930 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"15_CR13","doi-asserted-by":"publisher","first-page":"233","DOI":"10.7155\/jgaa.00186","volume":"13","author":"U Pferschy","year":"2009","unstructured":"Pferschy, U., Schauer, J.: The knapsack problem with conflict graphs. J. Graph Algorithms Appl. 13(2), 233\u2013249 (2009)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"15_CR14","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10878-011-9438-7","volume":"26","author":"U Pferschy","year":"2013","unstructured":"Pferschy, U., Schauer, J.: The maximum flow problem with disjunctive constraints. J. Comb. Optim. 26(1), 109\u2013119 (2013)","journal-title":"J. Comb. Optim."},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R Prim","year":"1957","unstructured":"Prim, R.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36, 1389\u20131401 (1957)","journal-title":"Bell Syst. Tech. J."},{"issue":"3","key":"15_CR16","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)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"15_CR17","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1287\/ijoc.1120.0499","volume":"25","author":"R Sadykov","year":"2013","unstructured":"Sadykov, R., Vanderbeck, F.: Bin packing with conflicts: a generic branch-and-price algorithm. INFORMS J. Comput. 25(2), 244\u2013255 (2013)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"15_CR18","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s11590-014-0750-x","volume":"9","author":"P Samer","year":"2015","unstructured":"Samer, P., Urrutia, S.: A branch and cut algorithm for minimum spanning trees under conflict constraints. Optim. Lett. 9(1), 41\u201355 (2015)","journal-title":"Optim. Lett."},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.asoc.2017.10.022","volume":"62","author":"K Singh","year":"2018","unstructured":"Singh, K., Sundar, S.: Artificial bee colony algorithm using problem-specific neighborhood strategies for the tree t-spanner problem. Appl. Soft Comput. 62, 110\u2013118 (2018)","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"15_CR20","doi-asserted-by":"publisher","first-page":"2169","DOI":"10.1007\/s00500-019-04051-x","volume":"24","author":"K Singh","year":"2020","unstructured":"Singh, K., Sundar, S.: A hybrid genetic algorithm for the degree-constrained minimum spanning tree problem. Soft. Comput. 24(3), 2169\u20132186 (2020)","journal-title":"Soft. Comput."},{"issue":"16","key":"15_CR21","doi-asserted-by":"publisher","first-page":"11289","DOI":"10.1007\/s00500-021-05913-z","volume":"25","author":"K Singh","year":"2021","unstructured":"Singh, K., Sundar, S.: Artificial bee colony algorithm using permutation encoding for the bounded diameter minimum spanning tree problem. Soft. Comput. 25(16), 11289\u201311305 (2021)","journal-title":"Soft. Comput."},{"issue":"17","key":"15_CR22","doi-asserted-by":"publisher","first-page":"3182","DOI":"10.1016\/j.ins.2010.05.001","volume":"180","author":"S Sundar","year":"2010","unstructured":"Sundar, S., Singh, A.: A swarm intelligence approach to the quadratic minimum spanning tree problem. Inf. Sci. 180(17), 3182\u20133191 (2010)","journal-title":"Inf. Sci."},{"key":"15_CR23","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.ins.2012.01.037","volume":"195","author":"S Sundar","year":"2012","unstructured":"Sundar, S., Singh, A., Rossi, A.: New heuristics for two bounded-degree spanning tree problems. Inf. Sci. 195, 226\u2013240 (2012)","journal-title":"Inf. Sci."},{"key":"15_CR24","unstructured":"Wilcoxon, F.: Wilcoxon signed-rank test calculator (1945)"},{"issue":"2","key":"15_CR25","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.disopt.2010.08.001","volume":"8","author":"R Zhang","year":"2011","unstructured":"Zhang, R., Kabadi, S.N., Punnen, A.P.: The minimum spanning tree problem with conflict constraints and its variations. Discret. Optim. 8(2), 191\u2013205 (2011)","journal-title":"Discret. Optim."}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-53966-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T18:04:46Z","timestamp":1707933886000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-53966-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031539657","9783031539664"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-53966-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"15 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning, Optimization, and Data Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Grasmere","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mod2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lod2023.icas.cc\/","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":"In-house system and EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","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":"72","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":"61% - 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":"5-6","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":"1-2","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)"}}]}}