{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:16:01Z","timestamp":1743120961072,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":34,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789811659393"},{"type":"electronic","value":"9789811659409"}],"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-981-16-5940-9_22","type":"book-chapter","created":{"date-parts":[[2021,9,9]],"date-time":"2021-09-09T23:04:08Z","timestamp":1631228648000},"page":"283-299","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Multi-objective Firefly Algorithm for Test Data Generation with Surrogate Model"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1035-4887","authenticated-orcid":false,"given":"Wenning","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1156-1108","authenticated-orcid":false,"given":"Qinglei","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1348-3323","authenticated-orcid":false,"given":"Chongyang","family":"Jiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6832-0332","authenticated-orcid":false,"given":"Ting","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,10]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Harman, M., Jones, B.F.: Search-based software engineering. Inf. Softw. Technol. 43(14), 833\u2013839 (2001)","DOI":"10.1016\/S0950-5849(01)00189-6"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Harman, M., Yue, J, Zhang, Y.: Achievements, open problems and challenges for search based software testing. In: 8th IEEE International Conference on Software Testing, Verification and Validation (ICST 2015), Graz, Austria (2015)","DOI":"10.1109\/ICST.2015.7102580"},{"issue":"2","key":"22_CR3","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1109\/TSE.2012.14","volume":"39","author":"G Fraser","year":"2013","unstructured":"Fraser, G., Arcuri, A.: Whole test suite generation. IEEE Trans. Software Eng. 39(2), 276\u2013291 (2013)","journal-title":"IEEE Trans. Software Eng."},{"issue":"2","key":"22_CR4","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/j.jss.2014.05.032","volume":"103","author":"G Fraser","year":"2015","unstructured":"Fraser, G., Arcuri, A., Mcminn, P.: A memetic algorithm for whole test suite generation. J. Syst. Softw. 103(2), 311\u2013327 (2015)","journal-title":"J. Syst. Softw."},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Panichella, A., Kifetew, F.M., Tonella, P.: Reformulating branch coverage as a many-objective optimization problem. In: IEEE International Conference on Software Testing. IEEE (2015)","DOI":"10.1109\/ICST.2015.7102604"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Panichella, A., Kifetew, F., Tonella, P.: Automated test case generation as a many-objective optimisation problem with dynamic selection of the targets. IEEE Trans. Softw. Eng. 44, 1 (2018)","DOI":"10.1109\/TSE.2017.2663435"},{"issue":"4","key":"22_CR7","first-page":"1143","volume":"29","author":"CW Xie","year":"2018","unstructured":"Xie, C.W., Xiao, C., Ding, L.X., Xia, X.W., Zhu, J.Y., Zhang, F.L.: HMOFA: a hybrid multi-objective firefly algorithm. J. Softw. 29(4), 1143\u20131162 (2018)","journal-title":"J. Softw."},{"issue":"2","key":"22_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1162\/106365600568167","volume":"8","author":"JD Knowles","year":"2000","unstructured":"Knowles, J.D., Corne, D.W.: Approximating the nondominated front using the Pareto archived evolution strategy. Evol. Comput. 8(2), 149\u2013172 (2000)","journal-title":"Evol. Comput."},{"issue":"3","key":"22_CR9","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"N Srinivas","year":"1994","unstructured":"Srinivas, N., Deb, K.: Multi-Objective optimization using non-dominated sorting in genetic algorithms. Evol. Comput. 2(3), 221\u2013248 (1994)","journal-title":"Evol. Comput."},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","DOI":"10.1109\/4235.996017"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"95","DOI":"10.3929\/ethz-a-004284029","volume-title":"Evolutionary Methods for Design, Optimization and Control with Applications to Industrial Problems","author":"E Zitzler","year":"2002","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: improving the strength pareto evolutionary algorithm. In: Giannakoglou, K., Tsahalis, D.T., Periaux, J., Papailious, K.D., Fogarty, T. (eds.) Evolutionary Methods for Design, Optimization and Control with Applications to Industrial Problems, pp. 95\u2013100. Springer, Berlin (2002). https:\/\/doi.org\/10.3929\/ethz-a-004284029"},{"issue":"11","key":"22_CR12","first-page":"2359","volume":"47","author":"C Xie","year":"2019","unstructured":"Xie, C., Feilong, Z., Jianbo, L., et al.: Multi-objective firefly algorithm based on multiply cooperative strategies. Acta Electron. Sin. 47(11), 2359\u20132367 (2019)","journal-title":"Acta Electron. Sin."},{"issue":"6","key":"22_CR13","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2008","unstructured":"Zhang, Q., Hui, L.: MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2008)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"22_CR14","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1109\/TEVC.2004.826067","volume":"8","author":"CCA Coello","year":"2004","unstructured":"Coello, C.C.A., Pulido, G.T., Lechuga, M.S.: Handling multiple objectives with particles swarm optimization. IEEE Trans. Evol. Comput. 8(3), 256\u2013279 (2004)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"22_CR15","unstructured":"Chengwang, X., Lei, X., Huairui, Z., et al.: Multi-objective fireworks optimization algorithm using elite opposite based learning. Acta Electronica Sinica 44(5), 1180\u20131188 (2016)"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Gopi, P., Ramalingam, M., Arumugam, C.: Search based test data generation: a multi objective approach using MOPSO evolutionary algorithm (2016)","DOI":"10.1145\/2998476.2998492"},{"key":"22_CR17","unstructured":"Zhiqun, Z.: Test case generation based on multi-objective evolutionary algorithm. Hunan University (2016)"},{"key":"22_CR18","unstructured":"Dafei, H.: An improved evolutionary strategy for multi-target path coverage testing. Jiangxi University of Finance and Economics (2019)"},{"key":"22_CR19","unstructured":"Shunhui, J., Pengcheng, Z.: Test case generation approach for data flow based on dominance relations. Comput. Sci. 47(9), 40\u201346 (2020)"},{"key":"22_CR20","unstructured":"Miao, Z., Shujuan, J., Yanmei, Z.: Research on multi-objective optimization in class integration test order. J. Chin. Comput. Syst. 38(8), 1772\u20131777 (2017)"},{"key":"22_CR21","unstructured":"Weizhi, L., Xiaoyun, X., Xiaojun, J.: Test data generation for multiple paths coverage based on ant colony algorithm. Acta Electronica Sinica 48(7), 1330\u20131342 (2020)"},{"key":"22_CR22","unstructured":"Chengwang, X., Weiwei, Y., Yingzhou, B., et al.: Many-objective evolutionary algorithm based on decomposition and coevolution. J. Softw. 31(2), 356\u2013373 (2020)"},{"key":"22_CR23","volume-title":"Nature-inspired Metaheuristic Algorithms","author":"XS Yang","year":"2008","unstructured":"Yang, X.S.: Nature-inspired Metaheuristic Algorithms. Luniver Press, London (2008)"},{"issue":"006","key":"22_CR24","first-page":"1299","volume":"038","author":"G Dunwei","year":"2010","unstructured":"Dunwei, G., Yan, Z.: Novel evolutionary generation approach to test data for multiple paths coverage. Acta Electron. Sin. 038(006), 1299\u20131304 (2010)","journal-title":"Acta Electron. Sin."},{"key":"22_CR25","unstructured":"Gaoyang, L.: The research of swarm intelligence optimization algorithms based on surrogate model. Jilin University (2016)"},{"key":"22_CR26","unstructured":"Xiangjuan, Y., Dunwei, G., Bin, L.: Evolutional test data generation for path coverage by integrating neural network. J. Softw. 27(4), 828\u2013838 (2016)"},{"key":"22_CR27","unstructured":"Xiaoji, C., Chuan, S.: Multiobjective evolutionary algorithm based on hybrid individual selection mechanism. J. Softw. 30(12), 3651\u20133664 (2019)"},{"issue":"005","key":"22_CR28","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1360\/jos160761","volume":"16","author":"C Xunxue","year":"2005","unstructured":"Xunxue, C., Chuang, L.: A preference based multi-objective concordance genetic algorithm. J. Softw. 16(005), 761\u2013770 (2005)","journal-title":"J. Softw."},{"issue":"001","key":"22_CR29","doi-asserted-by":"publisher","first-page":"14","DOI":"10.3724\/SP.J.1001.2010.03551","volume":"021","author":"Y Dongdong","year":"2010","unstructured":"Dongdong, Y., Licheng, J., Maoguo, G., et al.: Clone selection algorithm to solve preference multi-objective optimization. J. Softw. 021(001), 14\u201333 (2010)","journal-title":"J. Softw."},{"key":"22_CR30","doi-asserted-by":"crossref","unstructured":"Laumanns, M., Thiele, L., Deb, K., et al.: Combining convergence and diversity in evolutionary multi-objective optimization. Evol. Comput. 10(3), 263\u2013282 (2002)","DOI":"10.1162\/106365602760234108"},{"key":"22_CR31","unstructured":"Enze, Z.: Research on multi-objective particle swarm optimization algorithm and applications. Nanjing University of Science & Technology (2016)"},{"issue":"004","key":"22_CR32","first-page":"545","volume":"048","author":"G Maoguo","year":"2011","unstructured":"Maoguo, G., Gang, C., Licheng, J.: Nondominated individual selection strategy based on adaptive partition for evolutionary multi-objective optimization. J. Comput. Res. Dev. 048(004), 545\u2013557 (2011)","journal-title":"J. Comput. Res. Dev."},{"key":"22_CR33","doi-asserted-by":"crossref","unstructured":"Han, X., Lei, H., Wang, Y.S.: Multiple paths test data generation based on particle swarm optimization. IET Softw. 11(2), 41\u201347 (2017)","DOI":"10.1049\/iet-sen.2016.0066"},{"issue":"3","key":"22_CR34","first-page":"59","volume":"2014","author":"X Yao","year":"2014","unstructured":"Yao, X., Gong, D.: Genetic algorithm based test data generation for multiple paths via individual sharing. Comput. Intell. Neurosci. 2014(3), 59\u201370 (2014)","journal-title":"Comput. Intell. Neurosci."}],"container-title":["Communications in Computer and Information Science","Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-16-5940-9_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T15:07:42Z","timestamp":1710256062000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-16-5940-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9789811659393","9789811659409"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-981-16-5940-9_22","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"10 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICPCSEE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of Pioneering Computer Scientists, Engineers and Educators","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiyuan","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icpcsee2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2021.icpcsee.org\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"256","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":"81","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":"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":"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":"5","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)"}}]}}