{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:52:24Z","timestamp":1740099144273,"version":"3.37.3"},"publisher-location":"Singapore","reference-count":14,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811328282"},{"type":"electronic","value":"9789811328299"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","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-981-13-2829-9_38","type":"book-chapter","created":{"date-parts":[[2018,10,5]],"date-time":"2018-10-05T21:25:14Z","timestamp":1538774714000},"page":"415-425","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Orthogonal Genetic Algorithm with Multi-parent Multi-point Crossover for Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Xinchao","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Jiaqi","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Rui","family":"Li","sequence":"additional","affiliation":[]},{"given":"Dunwei","family":"Gong","sequence":"additional","affiliation":[]},{"given":"Xingmei","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,6]]},"reference":[{"key":"38_CR1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., New York (1979)"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.eswa.2016.01.055","volume":"54","author":"TY Lim","year":"2016","unstructured":"Lim, T.Y., Al-Betar, M.A., Khader, A.T.: Taming the 0\/1 knapsack problem with monogamous pairs genetic algorithm. Expert Syst. Appl. 54, 241\u2013250 (2016)","journal-title":"Expert Syst. Appl."},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.swevo.2015.09.005","volume":"26","author":"C Patvardhan","year":"2016","unstructured":"Patvardhan, C., Bansal, S., Srivastav, A.: Parallel improved quantum inspired evolutionary algorithm to solve large size quadratic knapsack problems. Swarm Evol. Comput. 26, 175\u2013190 (2016)","journal-title":"Swarm Evol. Comput."},{"issue":"2","key":"38_CR4","first-page":"445","volume":"43","author":"ZH Zhan","year":"2012","unstructured":"Zhan, Z.H., Li, J., Cao, J., Zhang, J., Chung, H.S.: Multiple populations for multiple objectives: a coevolutionary technique for solving multi-objective optimization problems. IEEE Trans. Syst. Man 43(2), 445\u2013463 (2012)","journal-title":"IEEE Trans. Syst. Man"},{"issue":"11","key":"38_CR5","first-page":"2655","volume":"28","author":"YC He","year":"2007","unstructured":"He, Y.C., Liu, K.Q., Zhang, C.J.: Greedy genetic algorithm for solving knapsack problem and its application use. Comput. Eng. Des. 28(11), 2655\u20132657 (2007)","journal-title":"Comput. Eng. Des."},{"issue":"36","key":"38_CR6","first-page":"32","volume":"45","author":"XC Zhao","year":"2009","unstructured":"Zhao, X.C., Yang, T.T.: Very greedy particle swarm optimization algorithm for knapsack problem. Comput. Eng. Appl. 45(36), 32\u201334 (2009)","journal-title":"Comput. Eng. Appl."},{"issue":"4","key":"38_CR7","first-page":"87","volume":"21","author":"YC Ye","year":"2006","unstructured":"Ye, Y.C., Che, L.X., He, B.: A hybrid particle swarm optimization algorithm for solving 0\/1 knapsack problem. J. Changsha Electr. Power Coll. 21(4), 87\u201390 (2006)","journal-title":"J. Changsha Electr. Power Coll."},{"issue":"9","key":"38_CR8","doi-asserted-by":"publisher","first-page":"1798","DOI":"10.1109\/TCYB.2014.2360752","volume":"45","author":"YL Li","year":"2015","unstructured":"Li, Y.L., Zhan, Z.H., Gong, Y.J., Chen, W.N., Zhang, J.: Differential evolution with an evolution path: a deep evolutionary algorithm. IEEE Trans. Cybern. 45(9), 1798\u20131810 (2015)","journal-title":"IEEE Trans. Cybern."},{"issue":"1","key":"38_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/4235.910464","volume":"5","author":"YW Leung","year":"2001","unstructured":"Leung, Y.W., Wang, Y.P.: An orthogonal genetic algorithm with quantization for global numerical optimization. IEEE Trans. Evol. Comput. 5(1), 41\u201353 (2001)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"38_CR10","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1109\/TCYB.2016.2523000","volume":"47","author":"Q Yang","year":"2017","unstructured":"Yang, Q., Chen, W.N., Li, Y., Chen, C.L., Xu, X.M.: Multimodal estimation of distribution algorithms. IEEE Trans. Cybern. 47(3), 636\u2013650 (2017)","journal-title":"IEEE Trans. Cybern."},{"issue":"6","key":"38_CR11","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1080\/03052150701280541","volume":"39","author":"Y Wang","year":"2007","unstructured":"Wang, Y., Liu, H., Cai, Z., Zhou, Y.: An orthogonal design based constrained evolutionary optimization algorithm. Eng. Optimiz. 39(6), 715\u2013736 (2007)","journal-title":"Eng. Optimiz."},{"key":"38_CR12","volume-title":"Design and Analysis of Experiments","author":"DC Montgomery","year":"1991","unstructured":"Montgomery, D.C.: Design and Analysis of Experiments, 3rd edn. Wiley, New York (1991)","edition":"3"},{"issue":"1","key":"38_CR13","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.ejor.2010.02.018","volume":"206","author":"VV Kalashnikov","year":"2010","unstructured":"Kalashnikov, V.V., P\u00e9rez-Vald\u00e9s, G.A., Tomasgard, A., Kalashnykova, N.I.: Natural gas cash-out problem: bilevel stochastic optimization approach. Eur. J. Oper. Res. 206(1), 18\u201333 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"38_CR14","doi-asserted-by":"publisher","first-page":"763","DOI":"10.3969\/j.issn.1004-4132.2010.05.008","volume":"21","author":"H Li","year":"2010","unstructured":"Li, H., Jiao, Y.C., Zhang, L.: Orthogonal genetic algorithm for solving quadratic bilevel programming problems. J. Syst. Eng. Electron. 21(5), 763\u2013770 (2010)","journal-title":"J. Syst. Eng. Electron."}],"container-title":["Communications in Computer and Information Science","Bio-inspired Computing: Theories and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-13-2829-9_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,5]],"date-time":"2018-10-05T21:43:41Z","timestamp":1538775821000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-13-2829-9_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9789811328282","9789811328299"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-981-13-2829-9_38","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"BIC-TA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Bio-Inspired Computing: Theories and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","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":"2 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bicta2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2018.bicta.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}