{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:27:18Z","timestamp":1743049638020,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319959566"},{"type":"electronic","value":"9783319959573"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-95957-3_7","type":"book-chapter","created":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T07:31:20Z","timestamp":1530775880000},"page":"54-62","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving Bi-criteria Maximum Diversity Problem with Multi-objective Multi-level Algorithm"],"prefix":"10.1007","author":[{"given":"Li-Yuan","family":"Xue","sequence":"first","affiliation":[]},{"given":"Rong-Qiang","family":"Zeng","sequence":"additional","affiliation":[]},{"given":"Hai-Yun","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Wen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,6]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1080\/00207729408928968","volume":"25","author":"B Alidaee","year":"1994","unstructured":"Alidaee, B., Kochenberger, G.A., Ahmadian, A.: 0-1 quadratic programming approach for the optimal solution of two scheduling problems. Int. J. Syst. Sci. 25, 401\u2013408 (1994)","journal-title":"Int. J. Syst. Sci."},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1057\/jors.2010.104","volume":"62","author":"R Aringhieri","year":"2011","unstructured":"Aringhieri, R., Cordone, R.: Comparing local search metaheuristics for the maximum diversity problem. J. Oper. Res. Soc. 62(2), 266\u2013280 (2011)","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"7_CR3","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10732-011-9178-y","volume":"18","author":"M Basseur","year":"2012","unstructured":"Basseur, M., Liefooghe, A., Le, K., Burke, E.: The efficiency of indicator-based local search for multi-objective combinatorial optimisation problems. J. Heuristics 18(2), 263\u2013296 (2012)","journal-title":"J. Heuristics"},{"issue":"8","key":"7_CR4","doi-asserted-by":"publisher","first-page":"1917","DOI":"10.1007\/s00521-011-0588-4","volume":"21","author":"M Basseur","year":"2012","unstructured":"Basseur, M., Zeng, R.-Q., Hao, J.-K.: Hypervolume-based multi-objective local search. Neural Comput. Appl. 21(8), 1917\u20131929 (2012)","journal-title":"Neural Comput. Appl."},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"1066","DOI":"10.1016\/j.cor.2010.10.007","volume":"38","author":"U Benlic","year":"2011","unstructured":"Benlic, U., Hao, J.-K.: An effective multilevel tabu search approach for balanced graph partitioning. Comput. Oper. Res. 38, 1066\u20131075 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"7_CR6","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1109\/TEVC.2011.2136346","volume":"15","author":"U Benlic","year":"2011","unstructured":"Benlic, U., Hao, J.-K.: A multilevel memetic approach for improving graph k-partitions. IEEE Trans. Evol. Comput. 15(2), 624\u2013642 (2011)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"1162","DOI":"10.1016\/j.engappai.2012.09.001","volume":"26","author":"U Benlic","year":"2013","unstructured":"Benlic, U., Hao, J.-K.: Breakout local search for the max-cut problem. Eng. Appl. Artif. Intell. 26, 1162\u20131173 (2013)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"11","key":"7_CR8","doi-asserted-by":"publisher","first-page":"2885","DOI":"10.1016\/j.cor.2008.12.020","volume":"36","author":"J Brimberg","year":"2009","unstructured":"Brimberg, J., Mladenovic, N., Urosevic, D., Ngai, E.: Variable neighborhood search for the heaviest k-subgraph. Comput. Oper. Res. 36(11), 2885\u20132891 (2009)","journal-title":"Comput. Oper. Res."},{"key":"7_CR9","series-title":"Genetic and Evolutionary Computation","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-36797-2","volume-title":"Evolutionary Algorithms for Solving Multi-Objective Problems","author":"CA Coello","year":"2007","unstructured":"Coello, C.A., Lamont, G.B., Van Veldhuizen, D.A.: Evolutionary Algorithms for Solving Multi-Objective Problems. Genetic and Evolutionary Computation. Springer, New York (2007). https:\/\/doi.org\/10.1007\/978-0-387-36797-2"},{"issue":"2","key":"7_CR10","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1007\/s11590-013-0610-0","volume":"8","author":"A Freitas","year":"2014","unstructured":"Freitas, A., Guimaraes, F., Silva, R.C.P.: Memetic self-adaptive evolution strategies applied to the maximum diversity problem. Optim. Lett. 8(2), 705\u2013714 (2014)","journal-title":"Optim. Lett."},{"issue":"1","key":"7_CR11","first-page":"36","volume":"200","author":"M Gallego","year":"2009","unstructured":"Gallego, M., Duarte, A., Laguna, M., Marti, R.: Hybrid heuristics for the maximum diversity problem. Comput. Optim. Appl. 200(1), 36\u201344 (2009)","journal-title":"Comput. Optim. Appl."},{"key":"7_CR12","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/BFb0120892","volume":"12","author":"G Gallo","year":"1980","unstructured":"Gallo, G., Hammer, P., Simeone, B.: Quadratic knapsack problems. Math. Program. 12, 132\u2013149 (1980)","journal-title":"Math. Program."},{"key":"7_CR13","first-page":"171","volume-title":"Lecture Notes in Computer Science","author":"Arnaud Liefooghe","year":"2015","unstructured":"Liefooghe, A., Verel, S., Paquete, L., Hao, J.-K.: Experiments on local search for bi-objective unconstrained binary quadratic programming. In: Proceedings of the 8th International Conference on Evolutionary Multi-criterion Optimization (EMO 2015), Guimar\u00e3es, Portugal, pp. 171\u2013186 (2015)"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1016\/j.ejor.2010.06.039","volume":"207","author":"Z L\u00fc","year":"2010","unstructured":"L\u00fc, Z., Glover, F., Hao, J.-K.: A hybrid metaheuristic approach to solving the UBQP problem. Eur. J. Oper. Res. 207, 1254\u20131262 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"7_CR15","first-page":"371","volume":"189","author":"G Palubeckis","year":"2007","unstructured":"Palubeckis, G.: Iterated tabu search for the maximum diversity problem. Optim. Lett. 189(1), 371\u2013383 (2007)","journal-title":"Optim. Lett."},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.engappai.2013.09.005","volume":"27","author":"Y Wang","year":"2014","unstructured":"Wang, Y., Hao, J., Glover, F., L\u00fc, Z.: A tabu search based memetic algorithm for the maximum diversity problem. Eng. Appl. Artif. Intell. 27, 103\u2013114 (2014)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1016\/j.asoc.2015.04.033","volume":"34","author":"Q Wu","year":"2015","unstructured":"Wu, Q., Wang, Y., L\u00fc, Z.: A tabu search based hybrid evolutionary algorithm for the max-cut problem. Appl. Soft Comput. 34, 827\u2013837 (2015)","journal-title":"Appl. Soft Comput."},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. Evol. Comput. 3, 257\u2013271 (1999)","journal-title":"Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Methodologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-95957-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:17:47Z","timestamp":1710325067000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-95957-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319959566","9783319959573"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-95957-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"6 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuhan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ic-ic.tongji.edu.cn\/2018\/index.htm","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":"LOD","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"632","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":"275","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":"72","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":"44% - 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.46","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":"0","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)"}}]}}