{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T16:40:42Z","timestamp":1774629642936,"version":"3.50.1"},"reference-count":99,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2017,10,31]],"date-time":"2017-10-31T00:00:00Z","timestamp":1509408000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Scientific Research Special Plan of Guangzhou Science and Technology Programme","award":["201607010045"],"award-info":[{"award-number":["201607010045"]}]},{"name":"National Basic Research Program of China 973","award":["2014CB347701"],"award-info":[{"award-number":["2014CB347701"]}]},{"name":"Excellent Graduate Student Innovation Program from the Collaborative Innovation Center of High Performance Computing"},{"name":"Program for Guangdong Introducing Innovative and Enterpreneurial Teams","award":["2016ZT06D211"],"award-info":[{"award-number":["2016ZT06D211"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61773410, 61673403 and 61472143"],"award-info":[{"award-number":["61773410, 61673403 and 61472143"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Softw. Eng. Methodol."],"published-print":{"date-parts":[[2017,10,31]]},"abstract":"<jats:p>\n            A feature model (FM) is a compact representation of the information of all possible products from software product lines. The optimal feature selection involves the simultaneous optimization of multiple (usually more than three) objectives in a large and highly constrained search space. By combining our previous work on many-objective evolutionary algorithm (i.e., VaEA) with two different satisfiability (SAT) solvers, this article proposes a new approach named\n            <jats:italic>SATVaEA<\/jats:italic>\n            for handling the optimal feature selection problem. In SATVaEA, an FM is simplified with the number of both features and constraints being reduced greatly. We enhance the search of VaEA by using two SAT solvers: one is a stochastic local search--based SAT solver that can quickly repair infeasible configurations, whereas the other is a conflict-driven clause-learning SAT solver that is introduced to generate diversified products. We evaluate SATVaEA on 21 FMs with up to 62,482 features, including two models with realistic values for feature attributes. The experimental results are promising, with SATVaEA returning 100% valid products on almost all FMs. For models with more than 10,000 features, the search in SATVaEA takes only a few minutes. Concerning both effectiveness and efficiency, SATVaEA significantly outperforms other state-of-the-art algorithms.\n          <\/jats:p>","DOI":"10.1145\/3176644","type":"journal-article","created":{"date-parts":[[2018,2,20]],"date-time":"2018-02-20T16:45:32Z","timestamp":1519145132000},"page":"1-46","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":69,"title":["Configuring Software Product Lines by Combining Many-Objective Optimization and SAT Solvers"],"prefix":"10.1145","volume":"26","author":[{"given":"Yi","family":"Xiang","sequence":"first","affiliation":[{"name":"Sun Yat-sen University, China"}]},{"given":"Yuren","family":"Zhou","sequence":"additional","affiliation":[{"name":"Sun Yat-sen University, China"}]},{"given":"Zibin","family":"Zheng","sequence":"additional","affiliation":[{"name":"Sun Yat-sen University, China"}]},{"given":"Miqing","family":"Li","sequence":"additional","affiliation":[{"name":"University of Birmingham, UK"}]}],"member":"320","published-online":{"date-parts":[[2018,2,20]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00009"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/CJECE.2014.2323958"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31612-8_3"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11554844_3"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2010.01.001"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1858996.1859010"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190075"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190039"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.01.002"},{"key":"e_1_2_1_12_1","unstructured":"P. Clements and L. Northrop. 2001. Software Product Lines: Practices and Patterns. Addison Wesley Longman.   P. Clements and L. Northrop. 2001. Software Product Lines: Practices and Patterns. Addison Wesley Longman."},{"key":"e_1_2_1_13_1","volume-title":"Van Veldhuizen","author":"Coello Coello Carlos A.","year":"2007","unstructured":"Carlos A. Coello Coello , Gary B. Lamont , and David A . Van Veldhuizen . 2007 . Evolutionary Algorithms for Solving Multi-Objective Problems (2nd ed.). Springer Science + Business Media LLC, New York, NY. Carlos A. Coello Coello, Gary B. Lamont, and David A. Van Veldhuizen. 2007. Evolutionary Algorithms for Solving Multi-Objective Problems (2nd ed.). Springer Science + Business Media LLC, New York, NY."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.826067"},{"key":"e_1_2_1_15_1","volume-title":"Hierons","author":"Sergio Segura Personal","year":"2017","unstructured":"Personal communication with Sergio Segura and Robert M . Hierons . 2017 . Personal communication with Sergio Segura and Robert M. Hierons. 2017."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/368273.368557"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792766"},{"key":"e_1_2_1_18_1","volume-title":"Multi-Objective Optimization Using Evolutionary Algorithms","author":"Deb Kalyanmoy","unstructured":"Kalyanmoy Deb . 2001. Multi-objective optimization . In Multi-Objective Optimization Using Evolutionary Algorithms . Wiley , 13--46. Kalyanmoy Deb. 2001. Multi-objective optimization. In Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, 13--46."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281535"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2011.05.014"},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of the International Conference on Theory and Applications of Satisfiability Testing. 502--518","author":"E\u00e9n Niklas","year":"2003","unstructured":"Niklas E\u00e9n and Niklas S\u00f6rensson . 2003 . An extensible SAT-solver . In Proceedings of the International Conference on Theory and Applications of Satisfiability Testing. 502--518 . Niklas E\u00e9n and Niklas S\u00f6rensson. 2003. An extensible SAT-solver. In Proceedings of the International Conference on Theory and Applications of Satisfiability Testing. 502--518."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/11663430_9"},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the Annual Meeting of the North American Fuzzy Information Processing Society. IEEE","author":"Farina M.","unstructured":"M. Farina and P. Amato . 2002. On the optimal solution definition for many-criteria optimization problems . In Proceedings of the Annual Meeting of the North American Fuzzy Information Processing Society. IEEE , Los Alamitos, CA, 233--238. M. Farina and P. Amato. 2002. On the optimal solution definition for many-criteria optimization problems. In Proceedings of the Annual Meeting of the North American Fuzzy Information Processing Society. IEEE, Los Alamitos, CA, 233--238."},{"key":"e_1_2_1_25_1","volume-title":"The Measure of Pareto Optima Applications to Multi-Objective Metaheuristics","author":"Fleischer M.","unstructured":"M. Fleischer . 2003. The Measure of Pareto Optima Applications to Multi-Objective Metaheuristics . Springer , Berlin, Germany , 519--533. M. Fleischer. 2003. The Measure of Pareto Optima Applications to Multi-Objective Metaheuristics. Springer, Berlin, Germany, 519--533."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2015.03.006"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.10.007"},{"key":"e_1_2_1_28_1","first-page":"1","article-title":"SMTIBEA: A hybrid multi-objective optimization algorithm for configuring large constrained software product lines","volume":"2017","author":"Guo Jianmei","year":"2017","unstructured":"Jianmei Guo , Jia Hui Liang , Kai Shi , Dingyu Yang , Jingsong Zhang , Krzysztof Czarnecki , Vijay Ganesh , and Huiqun Yu . 2017 . SMTIBEA: A hybrid multi-objective optimization algorithm for configuring large constrained software product lines . Software and Systems Modeling 2017 , 1 -- 20 . Jianmei Guo, Jia Hui Liang, Kai Shi, Dingyu Yang, Jingsong Zhang, Krzysztof Czarnecki, Vijay Ganesh, and Huiqun Yu. 2017. SMTIBEA: A hybrid multi-objective optimization algorithm for configuring large constrained software product lines. Software and Systems Modeling 2017, 1--20.","journal-title":"Software and Systems Modeling"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2011.06.026"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2642937.2642971"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2648511.2648513"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/2818754.2818819"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSTW.2013.30"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491627.2491635"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897760"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/5.1.10"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/GEFS.2008.4484566"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281534"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2362536.2362547"},{"key":"e_1_2_1_40_1","volume-title":"Feature-Oriented Domain Analysis (FODA) Feasibility Study. CMU\/SEI-90-TR-21","author":"Kang Kyo C.","unstructured":"Kyo C. Kang , Sholom G. Cohen , James A. Hess , William E. Novak , and A. Spencer Peterson . 1990. Feature-Oriented Domain Analysis (FODA) Feasibility Study. CMU\/SEI-90-TR-21 . Georgetown University . Kyo C. Kang, Sholom G. Cohen, James A. Hess, William E. Novak, and A. Spencer Peterson. 1990. Feature-Oriented Domain Analysis (FODA) Feasibility Study. CMU\/SEI-90-TR-21. Georgetown University."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/590631.590645"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2012.06.004"},{"key":"e_1_2_1_43_1","volume-title":"Software Product-Family Engineering. Lecture Notes in Computer Science","volume":"2290","author":"Knauber P.","unstructured":"P. Knauber , J. Bermejo , G. B\u00f6ckle , J. C. S. do Prado Leite, F. van der Linden, L. Northrop, M. Stark, and D. M. Weiss. 2002. Quantifying product line benefits . In Software Product-Family Engineering. Lecture Notes in Computer Science , Vol. 2290 . Springer, 155--163. P. Knauber, J. Bermejo, G. B\u00f6ckle, J. C. S. do Prado Leite, F. van der Linden, L. Northrop, M. Stark, and D. M. Weiss. 2002. Quantifying product line benefits. In Software Product-Family Engineering. Lecture Notes in Computer Science, Vol. 2290. Springer, 155--163."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.1999.781913"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2006.14.2.223"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2792984"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2373386"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2310651"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2262178"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.06.007"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2017.2742869"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/SANER.2015.7081829"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2791060.2791070"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2015.01.008"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.11.001"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1007\/11527695_27"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.769433"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/1639950.1640002"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.5555\/1753235.1753267"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/378239.379017"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/SPLC.2011.18"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/3023956.3023959"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/2648511.2648521"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12414"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2010.43"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2011.6100068"},{"key":"e_1_2_1_67_1","volume-title":"Lampinen","author":"Price Kenneth","year":"2005","unstructured":"Kenneth Price , Rainer M. Storn , and Jouni A . Lampinen . 2005 . Differential Evolution : A Practical Approach to Global Optimization. Natural Computing Series. Springer-Verlag , Secaucus, NJ. Kenneth Price, Rainer M. Storn, and Jouni A. Lampinen. 2005. Differential Evolution: A Practical Approach to Global Optimization. Natural Computing Series. Springer-Verlag, Secaucus, NJ."},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10270-015-0459-z"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2012.2185847"},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1109\/RESER.2013.6"},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.5555\/2662572.2662581"},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2013.6693104"},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.5555\/2486788.2486853"},{"key":"e_1_2_1_76_1","volume-title":"Proceedings of the 12th National Conference on Artificial Intelligence\u2014Volume 1 (AAAI\u201994)","author":"Selman Bart","year":"1994","unstructured":"Bart Selman , Henry A. Kautz , and Bram Cohen . 1994 . Noise strategies for improving local search . In Proceedings of the 12th National Conference on Artificial Intelligence\u2014Volume 1 (AAAI\u201994) . 337--343. http:\/\/dl.acm.org\/citation.cfm?id&equals;199288.178090 Bart Selman, Henry A. Kautz, and Bram Cohen. 1994. Noise strategies for improving local search. In Proceedings of the 12th National Conference on Artificial Intelligence\u2014Volume 1 (AAAI\u201994). 337--343. http:\/\/dl.acm.org\/citation.cfm?id&equals;199288.178090"},{"key":"e_1_2_1_77_1","volume-title":"Proceedings of the 10th National Conference on Artificial Intelligence (AAAI\u201992)","author":"Selman Bart","year":"1992","unstructured":"Bart Selman , Hector Levesque , and David Mitchell . 1992 . A new method for solving hard satisfiability problems . In Proceedings of the 10th National Conference on Artificial Intelligence (AAAI\u201992) . 440--446. Bart Selman, Hector Levesque, and David Mitchell. 1992. A new method for solving hard satisfiability problems. In Proceedings of the 10th National Conference on Artificial Intelligence (AAAI\u201992). 440--446."},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/1985793.1985856"},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11219-011-9152-9"},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2016.12.014"},{"key":"e_1_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.294849"},{"key":"e_1_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1145\/2771783.2771808"},{"key":"e_1_2_1_83_1","series-title":"Lecture Notes in Computer Science","volume-title":"Evolutionary Multi-Criterion Optimization","author":"Wagner Tobias","unstructured":"Tobias Wagner , Nicola Beume , and Boris Naujoks . 2007. Pareto- , aggregation-, and indicator-based methods in many-objective optimization . In Evolutionary Multi-Criterion Optimization . Lecture Notes in Computer Science , Vol. 4403 . Springer , 742--756. Tobias Wagner, Nicola Beume, and Boris Naujoks. 2007. Pareto-, aggregation-, and indicator-based methods in many-objective optimization. In Evolutionary Multi-Criterion Optimization. Lecture Notes in Computer Science, Vol. 4403. Springer, 742--756."},{"key":"e_1_2_1_84_1","first-page":"1","article-title":"Diversity assessment in many-objective optimization","volume":"99","author":"Wang Handing","year":"2016","unstructured":"Handing Wang , Yaochu Jin , and Xin Yao . 2016 . Diversity assessment in many-objective optimization . IEEE Transactions on Cybernetics PP , 99 , 1 -- 13 . Handing Wang, Yaochu Jin, and Xin Yao. 2016. Diversity assessment in many-objective optimization. IEEE Transactions on Cybernetics PP, 99, 1--13.","journal-title":"IEEE Transactions on Cybernetics PP"},{"key":"e_1_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12204-013-1468-0"},{"key":"e_1_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2010.2077298"},{"key":"e_1_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2009.02.011"},{"key":"e_1_2_1_88_1","volume-title":"Proceedings of the 12th International Software Product Lines Conference\u2014Volume 2 (SPLC\u201908)","author":"White Jules","unstructured":"Jules White , Brian Doughtery , and Douglas C. Schmidt . 2008. Filtered Cartesian flattening: An approximation technique for optimally selecting features while adhering to resource constraints . In Proceedings of the 12th International Software Product Lines Conference\u2014Volume 2 (SPLC\u201908) . 209--216. Jules White, Brian Doughtery, and Douglas C. Schmidt. 2008. Filtered Cartesian flattening: An approximation technique for optimally selecting features while adhering to resource constraints. In Proceedings of the 12th International Software Product Lines Conference\u2014Volume 2 (SPLC\u201908). 209--216."},{"key":"e_1_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2013.10.010"},{"key":"e_1_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.2307\/3001968"},{"key":"e_1_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-017-0929-9"},{"key":"e_1_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2587808"},{"key":"e_1_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.03.005"},{"key":"e_1_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.07.040"},{"key":"e_1_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2012.2227145"},{"key":"e_1_2_1_96_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0890060405050043"},{"key":"e_1_2_1_97_1","volume-title":"Genetic Algorithms+ Data Structures &eqauls","author":"Michalewicz Z.","unstructured":"Z. Michalewicz . 2013. Genetic Algorithms+ Data Structures &eqauls ; Evolution Programs. Springer Science 8 Business Media. Z. Michalewicz. 2013. Genetic Algorithms+ Data Structures &eqauls; Evolution Programs. Springer Science 8 Business Media."},{"key":"e_1_2_1_98_1","volume-title":"Proceedings of the 7th AAAI National Conference on Artificial Intelligence (AAAI\u201988)","author":"Zabih Ramin","year":"1988","unstructured":"Ramin Zabih and David McAllester . 1988 . A rearrangement search strategy for determining propositional satisfiability . In Proceedings of the 7th AAAI National Conference on Artificial Intelligence (AAAI\u201988) . 155--160. Ramin Zabih and David McAllester. 1988. A rearrangement search strategy for determining propositional satisfiability. In Proceedings of the 7th AAAI National Conference on Artificial Intelligence (AAAI\u201988). 155--160."},{"key":"e_1_2_1_99_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"e_1_2_1_100_1","volume-title":"Proceedings of the Special Session on Performance Assessment of Multi-Objective Optimization Algorithms.","author":"Zhang Qingfu","year":"2009","unstructured":"Qingfu Zhang , Aimin Zhou , Shizheng Zhao , Ponnuthurai Nagaratnam Suganthan , Wudong Liu , and Santosh Tiwari . 2009 . Multiobjective optimization test instances for the CEC 2009 special session and competition . In Proceedings of the Special Session on Performance Assessment of Multi-Objective Optimization Algorithms. Qingfu Zhang, Aimin Zhou, Shizheng Zhao, Ponnuthurai Nagaratnam Suganthan, Wudong Liu, and Santosh Tiwari. 2009. Multiobjective optimization test instances for the CEC 2009 special session and competition. In Proceedings of the Special Session on Performance Assessment of Multi-Objective Optimization Algorithms."},{"key":"e_1_2_1_101_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2567648"},{"key":"e_1_2_1_102_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30217-9_84"},{"key":"e_1_2_1_104_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.797969"}],"container-title":["ACM Transactions on Software Engineering and Methodology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3176644","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3176644","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:32Z","timestamp":1750212692000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3176644"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,31]]},"references-count":99,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,10,31]]}},"alternative-id":["10.1145\/3176644"],"URL":"https:\/\/doi.org\/10.1145\/3176644","relation":{},"ISSN":["1049-331X","1557-7392"],"issn-type":[{"value":"1049-331X","type":"print"},{"value":"1557-7392","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,31]]},"assertion":[{"value":"2017-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-02-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}