{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T09:07:37Z","timestamp":1760346457353,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319190839"},{"type":"electronic","value":"9783319190846"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19084-6_19","type":"book-chapter","created":{"date-parts":[[2015,5,28]],"date-time":"2015-05-28T14:43:01Z","timestamp":1432824181000},"page":"218-222","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Biased Random-Key Genetic Algorithm for the Multiple Knapsack Assignment Problem"],"prefix":"10.1007","author":[{"given":"Eduardo","family":"Lalla-Ruiz","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,29]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6, 154\u2013160 (1994)","journal-title":"ORSA J. Comput."},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1023\/A:1014852026591","volume":"6","author":"M Ericsson","year":"2002","unstructured":"Ericsson, M., Resende, M.G.C., Pardalos, P.M.: A genetic algorithm for the weight setting problem in OSPF routing. J. Comb. Optim. 6, 299\u2013333 (2002)","journal-title":"J. Comb. Optim."},{"issue":"5123","key":"19_CR3","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1126\/science.8346439","volume":"261","author":"S Forrest","year":"1993","unstructured":"Forrest, S.: Genetic algorithms: principles of natural selection applied to computation. Science 261(5123), 872\u2013878 (1993)","journal-title":"Science"},{"key":"19_CR4","volume-title":"Genetic Algorithms in Search Optimization and Machine Learning","author":"GE Goldberg","year":"1989","unstructured":"Goldberg, G.E.: Genetic Algorithms in Search Optimization and Machine Learning. Addison Wesley, Reading (1989)"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10732-010-9143-1","volume":"17","author":"JF Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.C.: Biased random-key genetic algorithms for combinatorial optimization. J. Heuristics 17, 487\u2013525 (2011)","journal-title":"J. Heuristics"},{"key":"19_CR6","volume-title":"Adaptation in Natural and Artificial Systems","author":"JH Holland","year":"1975","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems. MIT Press, Boston (1975)"},{"issue":"2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1016\/j.ejor.2014.02.014","volume":"237","author":"S Kataoka","year":"2014","unstructured":"Kataoka, S., Yamada, T.: Upper and lower bounding procedures for the multiple knapsack assignment problem. Eur. J. Oper. Res. 237(2), 440\u2013447 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"19_CR8","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/S0377-2217(98)00120-9","volume":"114","author":"D Pisinger","year":"1999","unstructured":"Pisinger, D.: An exact algorithm for large multiple knapsack problems. Eur. J. Oper. Res. 114(3), 528\u2013541 (1999)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"19_CR9","first-page":"551","volume":"35","author":"M Sniedovich","year":"2006","unstructured":"Sniedovich, M., Vo\u00df, S.: The corridor method: a dynamic programming inspired metaheuristic. Control Cybern. 35(3), 551\u2013578 (2006)","journal-title":"Control Cybern."},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-1-4615-1507-4_27","volume-title":"Essays and Surveys in Metaheuristics","author":"E Taillard","year":"2002","unstructured":"Taillard, E., Vo\u00df, S.: POPMUSIC - Partial optimization metaheuristic under special intensification conditions. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 613\u2013629. Kluwer, Boston (2002)"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19084-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:17:46Z","timestamp":1676942266000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19084-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319190839","9783319190846"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19084-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"29 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}