{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T04:02:36Z","timestamp":1649131356591},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,12,12]],"date-time":"2008-12-12T00:00:00Z","timestamp":1229040000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2010,10]]},"DOI":"10.1007\/s10489-008-0155-6","type":"journal-article","created":{"date-parts":[[2008,12,11]],"date-time":"2008-12-11T17:33:20Z","timestamp":1229016800000},"page":"144-158","source":"Crossref","is-referenced-by-count":3,"title":["The improved adaptive link adjustment evolutionary algorithm for the multiple container packing problem"],"prefix":"10.1007","volume":"33","author":[{"given":"Sang-Moon","family":"Soak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sang-Wook","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moongu","family":"Jeon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,12,12]]},"reference":[{"key":"155_CR1","first-page":"339","volume-title":"Combinatorial optimization","author":"N Christofides","year":"1979","unstructured":"Christofides N, Mingozzi A, Toth P (1979) The 0\u20131 knapsack problem. In: Christofides N, Mingozzi A, Toth P, Sandi C (eds) Combinatorial optimization. Wiley, New York, pp 339\u2013369"},{"key":"155_CR2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"PC Chu","year":"1998","unstructured":"Chu PC, Beasley JE (1998) A genetic algorithm for the multidimensional knapsack problem. J\u00a0Heuristics 4:63\u201386","journal-title":"J\u00a0Heuristics"},{"key":"155_CR3","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10489-007-0062-2","volume":"28","author":"S Lee","year":"2007","unstructured":"Lee S, Soak SM, Kim K, Park H, Jeon M (2007) Statistical properties analysis of real world tournament selection in GAs. Appl Intell 28:195\u2013205","journal-title":"Appl Intell"},{"key":"155_CR4","first-page":"276","volume":"4","author":"S Martello","year":"1980","unstructured":"Martello S, Toth P (1980) Solution of the zero-one multiple knapsack problem. Eur\u00a0J\u00a0Oper Res 4:276\u2013283","journal-title":"Eur\u00a0J\u00a0Oper Res"},{"key":"155_CR5","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/S0377-2217(98)00120-9","volume":"114","author":"D Pisinger","year":"1999","unstructured":"Pisinger D (1999) An exact algorithm for large multiple knapsack problems. Eur J\u00a0Oper Res 114:528\u2013541","journal-title":"Eur J\u00a0Oper Res"},{"key":"155_CR6","doi-asserted-by":"crossref","unstructured":"Raidl GR (1999) A weight-coded genetic algorithm for the multiple container packing problem. In: Proceedings of the 1999 ACM symposium on applied computing, pp 291\u2013296","DOI":"10.1145\/298151.298354"},{"issue":"2","key":"155_CR7","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/335527.335530","volume":"7","author":"GR Raidl","year":"1999","unstructured":"Raidl GR (1999) The multiple container packing problem: A\u00a0genetic algorithm approach with weighted codings. ACM Appl Comput Rev 7(2):22\u201331","journal-title":"ACM Appl Comput Rev"},{"key":"155_CR8","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1007\/BFb0056929","volume-title":"Proceedings of the 5th international conference on parallel problem solving from nature (PPSN\u00a0V)","author":"GR Raidl","year":"1998","unstructured":"Raidl GR, Kodydek G (1998) Genetic algorithms for the multiple container packing problem. In: Proceedings of the 5th international conference on parallel problem solving from nature (PPSN\u00a0V). LNCS, vol\u00a01498. Springer, Berlin, pp\u00a0875\u2013884"},{"issue":"12","key":"155_CR9","doi-asserted-by":"crossref","first-page":"2863","DOI":"10.1093\/ietfec\/e90-a.12.2863","volume":"E90-A","author":"SM Soak","year":"2007","unstructured":"Soak SM (2007) Adaptive link adjustment\u2019 applied to the fixed charge transportation problem. IEICE Trans Fundam Electron Commun Comput Sci E90-A(12):2863\u20132876","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"issue":"10","key":"155_CR10","doi-asserted-by":"crossref","first-page":"4090","DOI":"10.1093\/ietcom\/e88-b.10.4090","volume":"E88-B","author":"SM Soak","year":"2005","unstructured":"Soak SM, Corne D, Ahn BH (2005) A\u00a0new evolutionary algorithm for spanning-tree based communication network design. IEICE Trans Commun E88-B(10):4090\u20134093","journal-title":"IEICE Trans Commun"},{"issue":"2","key":"155_CR11","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1109\/TEVC.2006.871250","volume":"10","author":"SM Soak","year":"2006","unstructured":"Soak SM, Corne D, Ahn BH (2006) The edge-window-decoder representation for tree-based problems. IEEE Trans Evol Comput 10(2):124\u2013144","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"155_CR12","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/j.pnsc.2007.11.007","volume":"18","author":"SM Soak","year":"2008","unstructured":"Soak SM, Lee SW, Yeo GT, Jeon MG (2008) An effective evolutionary algorithm for the multiple container packing problem. Prog Nat Sci 18(3):337\u2013344","journal-title":"Prog Nat Sci"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-008-0155-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-008-0155-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-008-0155-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:25:42Z","timestamp":1559154342000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-008-0155-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12,12]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["155"],"URL":"https:\/\/doi.org\/10.1007\/s10489-008-0155-6","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12,12]]}}}