{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T10:28:25Z","timestamp":1725877705674},"publisher-location":"Singapore","reference-count":28,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811036132"},{"type":"electronic","value":"9789811036149"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-981-10-3614-9_2","type":"book-chapter","created":{"date-parts":[[2017,1,7]],"date-time":"2017-01-07T05:02:41Z","timestamp":1483765361000},"page":"10-19","source":"Crossref","is-referenced-by-count":2,"title":["A Multi-parent Crossover Based Genetic Algorithm for Bi-Objective Unconstrained Binary Quadratic Programming Problem"],"prefix":"10.1007","author":[{"given":"Chao","family":"Huo","sequence":"first","affiliation":[]},{"given":"Rongqiang","family":"Zeng","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Mingsheng","family":"Shang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,8]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/S0377-2217(97)00130-6","volume":"108","author":"TM Alkhamis","year":"1998","unstructured":"Alkhamis, T.M., Hasan, M., Ahmed, M.A.: Simulated annealing for the unconstrained binary quadratic pseudo-boolean function. Eur. J. Oper. Res. 108, 641\u2013652 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"2_CR2","first-page":"317","volume":"108","author":"M Amini","year":"1999","unstructured":"Amini, M., Alidaee, B., Kochenberger, G.: A scatter search approach to unconstrained quadratic binary programs. New Methods Optim. 108, 317\u2013330 (1999)","journal-title":"New Methods Optim."},{"issue":"2","key":"2_CR3","doi-asserted-by":"crossref","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":"2_CR4","doi-asserted-by":"crossref","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":"2_CR5","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1016\/j.eswa.2014.08.011","volume":"42","author":"U Benlic","year":"2015","unstructured":"Benlic, U., Hao, J.-K.: Memetic search for the quadratic assignment problem. Expert Syst. Appl. 42, 584\u2013595 (2015)","journal-title":"Expert Syst. Appl."},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/3-540-31182-3_1","volume":"2","author":"I Borgulya","year":"2005","unstructured":"Borgulya, I.: An evolutionary algorithm for the binary quadratic problems. Adv. Soft Comput. 2, 3\u201316 (2005)","journal-title":"Adv. Soft Comput."},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s10732-007-9009-3","volume":"13","author":"E Boros","year":"2007","unstructured":"Boros, E., Hammer, P.L., Tavarse, G.: Local search heuristics for quadratic unconstrained binary optimization (QUBO). J. Heuristics 13, 99\u2013132 (2007)","journal-title":"J. Heuristics"},{"key":"2_CR8","volume-title":"Evolutionary Algorithms for Solving Multi-objective Problems (Genetic and Evolutionary Computation)","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-Verlag New York Inc., Secaucus (2007)"},{"key":"2_CR9","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":"2_CR10","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1287\/mnsc.44.3.336","volume":"44","author":"F Glover","year":"1998","unstructured":"Glover, F., Kochenberger, G., Alidaee, B.: Adaptive memory tabu search for binary quadratic programs. Manag. Sci. 44, 336\u2013345 (1998)","journal-title":"Manag. Sci."},{"key":"2_CR11","volume-title":"Stochastic Local Search Foundations and Applications","author":"H Hoos","year":"2004","unstructured":"Hoos, H., St\u00fctzle, T.: Stochastic Local Search Foundations and Applications. Morgan Kaufmann, San Francisco (2004)"},{"key":"2_CR12","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/978-3-540-88051-6_4","volume":"171","author":"X-B Hu","year":"2009","unstructured":"Hu, X.-B., Paolo, E.D.: An efficient genetic algorithm with uniform crossover for the multi-objective airport gate assignment problem. Multi-Objective Memetic Algorithm 171, 71\u201389 (2009)","journal-title":"Multi-Objective Memetic Algorithm"},{"key":"2_CR13","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0377-2217(00)00242-3","volume":"134","author":"K Katayama","year":"2001","unstructured":"Katayama, K., Narihisa, H.: Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem. Eur. J. Oper. Res. 134, 103\u2013119 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"2_CR14","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/s10878-014-9734-0","volume":"28","author":"G Kochenberger","year":"2014","unstructured":"Kochenberger, G., Hao, J.-K., Glover, F., Lewis, M., L\u00fc, Z., Wang, H., Wang, Y.: The unconstrained binary quadratic programming problem: a survey. J. Comb. Optim. 28, 58\u201381 (2014)","journal-title":"J. Comb. Optim."},{"key":"2_CR15","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.asoc.2013.11.008","volume":"16","author":"A Liefooghe","year":"2014","unstructured":"Liefooghe, A., Verel, S., Hao, J.-K.: A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming. Appl. Soft Comput. 16, 10\u201319 (2014)","journal-title":"Appl. Soft Comput."},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-319-15934-8_12","volume-title":"Evolutionary Multi-Criterion Optimization","author":"A 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: Gaspar-Cunha, A., Henggeler Antunes, C., Coello, C.C. (eds.) EMO 2015. LNCS, vol. 9018, pp. 171\u2013186. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-15934-8_12"},{"issue":"3","key":"2_CR17","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1016\/S0377-2217(98)00359-2","volume":"119","author":"A Lodi","year":"1999","unstructured":"Lodi, A., Allemand, K., Liebling, T.M.: An evolutionary heuristic for quadratic 0\u20131 programming. Eur. J. Oper. Res. 119(3), 662\u2013670 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"2_CR18","doi-asserted-by":"crossref","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."},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-642-12139-5_14","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"Z L\u00fc","year":"2010","unstructured":"L\u00fc, Z., Hao, J.-K., Glover, F.: A study of memetic search with multi-parent combination for UBQP. In: Cowling, P., Merz, P. (eds.) EvoCOP 2010. LNCS, vol. 6022, pp. 154\u2013165. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-12139-5_14"},{"key":"2_CR20","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1287\/mnsc.26.3.282","volume":"26","author":"RD McBride","year":"1980","unstructured":"McBride, R.D., Yormark, J.S.: An implicit enumeration algorithm for quadratic integer programming. Manag. Sci. 26, 282\u2013296 (1980)","journal-title":"Manag. Sci."},{"key":"2_CR21","unstructured":"Merz, P., Freisleben, B.: Genetic algorithms for binary quadratic programming. In: Proceedings of The 1st Genetic and Evolutionary Computation Conference (GECCO 1999), pp. 417\u2013424, Orlando, Florida, USA (1999)"},{"key":"2_CR22","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.biosystems.2004.08.002","volume":"78","author":"P Merz","year":"2004","unstructured":"Merz, P., Katayama, K.: Memetic algorithms for the unconstrained binary quadratic programming problem. BioSystems 78, 99\u2013118 (2004)","journal-title":"BioSystems"},{"key":"2_CR23","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1023\/B:ANOR.0000039522.58036.68","volume":"131","author":"G Palubeckis","year":"2004","unstructured":"Palubeckis, G.: Multistart tabu search strategies for the unconstrained binary quadratic optimization problem. Ann. Oper. Res. 131, 259\u2013282 (2004)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"2_CR24","doi-asserted-by":"crossref","first-page":"279","DOI":"10.15388\/Informatica.2006.138","volume":"17","author":"G Palubeckis","year":"2006","unstructured":"Palubeckis, G.: Iterated tabu search for the unconstrained binary quadratic optimization problem. Informatica 17(2), 279\u2013296 (2006)","journal-title":"Informatica"},{"key":"2_CR25","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01096724","volume":"4","author":"JB Rosen","year":"1994","unstructured":"Rosen, J.B., Phillips, A.T.: A quadratic assignment formulation of the molecular conformation problem. J. Glob. Optim. 4, 229\u2013241 (1994)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"2_CR26","first-page":"704","volume":"41","author":"A Sutter","year":"1994","unstructured":"Sutter, A., Chardaire, P.: A decomposition method for quadratic zero-zero programming. Manag. Sci. 41(4), 704\u2013712 (1994)","journal-title":"Manag. Sci."},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/978-3-642-15844-5_56","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"Y Wang","year":"2010","unstructured":"Wang, Y., L\u00fc, Z., Hao, J.-K.: A study of multi-parent crossover operators in a memetic algorithm. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6238, pp. 556\u2013565. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-15844-5_56"},{"key":"2_CR28","doi-asserted-by":"crossref","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":["Communications in Computer and Information Science","Bio-inspired Computing \u2013 Theories and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-3614-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,28]],"date-time":"2020-09-28T17:25:47Z","timestamp":1601313947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-3614-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9789811036132","9789811036149"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-3614-9_2","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2016]]}}}