{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:40:31Z","timestamp":1759848031394},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T00:00:00Z","timestamp":1281657600000},"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":[[2012,1]]},"DOI":"10.1007\/s10489-010-0248-x","type":"journal-article","created":{"date-parts":[[2010,8,11]],"date-time":"2010-08-11T22:09:18Z","timestamp":1281564558000},"page":"119-135","source":"Crossref","is-referenced-by-count":19,"title":["A memetic algorithm for the quadratic multiple container packing problem"],"prefix":"10.1007","volume":"36","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"}]}],"member":"297","published-online":{"date-parts":[[2010,8,13]]},"reference":[{"key":"248_CR1","unstructured":"Ahuja RK, Orlin JB, Tivari A (1995) A greedy genetic algorithm for the quadratic assignment problem. Working paper 3826-95, Sloan School of Management, MIT"},{"issue":"2","key":"248_CR2","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean JC (1994) Genetic algorithms and random keys for sequencing and optimization. ORSA J Comput 6(2):154\u2013160","journal-title":"ORSA J Comput"},{"key":"248_CR3","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 Heuristics 4:63\u201386","journal-title":"J Heuristics"},{"key":"248_CR4","unstructured":"Granmo O-C, Oommen BJ (2010) Optimal sampling for estimation with constrained resources using a learning automaton-based solution for the nonlinear fractional knapsack problem. App Intell. doi: 10.2007\/s10489-010-0228-1"},{"issue":"3","key":"248_CR5","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1162\/evco.1993.1.3.213","volume":"1","author":"F Gruau","year":"1993","unstructured":"Gruau F, Whitley D (1993) Adding learning to the cellular development of neural networks evolution and the Baldwin effect. Evol Comput 1(3):213\u2013233","journal-title":"Evol Comput"},{"key":"248_CR6","doi-asserted-by":"crossref","unstructured":"Hiley A, Julstrom BA (2006) The quadratic multiple knapsack problem and three heuristic approaches to it. In: Procs. of the genetic and evolutionary computation conference, vol\u00a01, pp\u00a0547\u2013552","DOI":"10.1145\/1143997.1144096"},{"key":"248_CR7","unstructured":"Julstrom BA (1999) Comparing darwinian, baldwinian, and lamarckian search in a genetic algorithm for the 4-cycle problem. Late breaking paper at the 1997 genetic and evolutionary computation conference"},{"key":"248_CR8","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/j.ejor.2007.06.028","volume":"190","author":"SO Kimbrough","year":"2008","unstructured":"Kimbrough SO, Koehler GJ, Lu M, Wood DH (2008) On a Feasible Infeasible Two-Population (FI-2Pop) genetic algorithm for constrained optimization: distance tracing and no free lunch. Eur J Oper Res 190:310\u2013327","journal-title":"Eur J Oper Res"},{"issue":"1","key":"248_CR9","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal JB (1956) On the shortest spanning tree of a graph and the travelling salesman problem. Proc Am Math Soc 7(1):48\u201350","journal-title":"Proc Am Math Soc"},{"key":"248_CR10","unstructured":"Lee S, Soak SM, Kim K, Park H, Jeon M (2007) Statistical properties analysis of real world tournament selection in GAs. In: Applied intelligence, vol\u00a028, pp\u00a0195\u2013205"},{"key":"248_CR11","doi-asserted-by":"crossref","unstructured":"Li Y, Zeng X (2008) Multi-population co-genetic algorithm with double chain-like agents structure for parallel global numerical optimization. Appl Intell","DOI":"10.1007\/s10489-008-0146-7"},{"key":"248_CR12","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1023\/A:1008272531960","volume":"7","author":"A Likas","year":"1997","unstructured":"Likas A, Papageorgiou G, Stafylopatis A (1997) A connectionist approach for solving large constraint satisfaction problems. Appl Intell 7:215\u2013225","journal-title":"Appl Intell"},{"key":"248_CR13","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10489-005-5601-0","volume":"22","author":"A Lim","year":"2005","unstructured":"Lim A, Rodrgues B, Yang Y (2005) 3-D Container packing problem. Appl Intell 22:125\u2013134","journal-title":"Appl Intell"},{"key":"248_CR14","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0950-7051(03)00027-3","volume":"16","author":"A Misevi\u010dius","year":"2003","unstructured":"Misevi\u010dius A (2003) Genetic algorithm hybridized with ruin and recreate procedure: application to the quadratic assignment problem. Knowl-Based Syst 16:261\u2013268","journal-title":"Knowl-Based Syst"},{"key":"248_CR15","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.knosys.2004.03.001","volume":"17","author":"A Misevi\u010dius","year":"2004","unstructured":"Misevi\u010dius A (2004) An improved hybrid genetic algorithm: new results for the quadratic assignment problem. Knowl-Based Syst 17:65\u201373","journal-title":"Knowl-Based Syst"},{"key":"248_CR16","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1007\/BFb0056929","volume-title":"Proc. of the 5th international conference on parallel problem solving from nature (PPSN V)","author":"GR Raidl","year":"1998","unstructured":"Raidl GR, Kodydek G (1998) Genetic algorithms for the multiple container packing problem. In: Proc. of the 5th international conference on parallel problem solving from nature (PPSN V). LNCS vol\u00a01498. Springer, Berlin, pp 875\u2013884"},{"issue":"1","key":"248_CR17","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1162\/106365602317301781","volume":"10","author":"F Rothlauf","year":"2002","unstructured":"Rothlauf F, Goldberg D, Heinzl A (2002) Network random keys\u2014a tree network representation scheme for genetic and evolutionary algorithms. Evol Comput 10(1):75\u201397","journal-title":"Evol Comput"},{"key":"248_CR18","series-title":"LNCS","first-page":"490","volume-title":"BVAI2007","author":"T Sarac","year":"2007","unstructured":"Sarac T, Sipahioglu A (2007) A genetic algorithm for the quadratic multiple knapsack problem. In: BVAI2007. LNCS, vol\u00a04729. Springer, Berlin, pp 490\u2013498"},{"key":"248_CR19","first-page":"143","volume-title":"Evoworkshops","author":"B Schindler","year":"2002","unstructured":"Schindler B, Rothlauf F, Pesch H (2002) Evolution strategies, network random keys, and the one-max tree problem. In: Evoworkshops. Springer, Berlin, pp 143\u2013152"},{"key":"248_CR20","unstructured":"Schumacher C Vose MD Whitely LD The no free lunch and description length. In: Proceedings of genetic and evolutionary computation conference (GECCO-2001), pp\u00a0565\u2013570"},{"key":"248_CR21","series-title":"LNCS","first-page":"210","volume-title":"EvoCOP 2007","author":"A Singh","year":"2007","unstructured":"Singh A, Baghel AS (2007) A new grouping algorithm for the quadratic multiple knapsack problem. In: EvoCOP 2007. LNCS, vol\u00a04446. Springer, Berlin, pp 210\u2013218"},{"key":"248_CR22","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10732-006-3750-x","volume":"12","author":"A Singh","year":"2006","unstructured":"Singh A, Gupta AK (2006) A hybrid heuristic for the maximum clique problem. J Heuristic 12:5\u201322","journal-title":"J Heuristic"},{"issue":"12","key":"248_CR23","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) \u2018Adaptive 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"},{"key":"248_CR24","series-title":"LNAI","first-page":"952","volume-title":"KES 2004","author":"SM Soak","year":"2004","unstructured":"Soak SM, Corne D, Ahn BH (2004) A new encoding for the degree constrained minimum spanning tree problem. In: KES 2004, LNAI, vol.\u00a03213. Springer, Berlin, pp 952\u2013958"},{"issue":"10","key":"248_CR25","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 new evolutionary algorithm for spanning-tree based communication network design. IEICE Trans Commun E88-B(10):4090\u20134093","journal-title":"IEICE Trans Commun"},{"key":"248_CR26","doi-asserted-by":"crossref","unstructured":"Soak SM, Lee SW, Jeon MG (2008) The improved adaptive link adjustment evolutionary algorithm for the multiple container packing problem. Appl Intell. doi: 10.1007\/s10489-008-0155-6","DOI":"10.1007\/s10489-008-0155-6"},{"key":"248_CR27","unstructured":"Soak SM, Lee SW, Yeo GT, Jeon MG An effective evolutionary algorithm for the multiple container packing problem. In: The second international conference on bio-inspired computing: theories and applications (BIC-TA 2007)"},{"key":"248_CR28","unstructured":"Vazquez M, Whitley LD A hybrid genetic algorithm for the quadratic assignment problem. In: Genetic and evolutionary computation conference (GECCO-2000), pp\u00a0169\u2013178"},{"key":"248_CR29","doi-asserted-by":"crossref","unstructured":"Whitley D, Gordon VS, Mathias KE (1994) Lamarckian evolution, the baldwin effect and function optimization. In: Parallel problem solving from nature III, pp\u00a06\u201315","DOI":"10.1007\/3-540-58484-6_245"},{"issue":"1","key":"248_CR30","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Maredady WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67\u201382","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-010-0248-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-010-0248-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-010-0248-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:59:34Z","timestamp":1559397574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-010-0248-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,13]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["248"],"URL":"https:\/\/doi.org\/10.1007\/s10489-010-0248-x","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,13]]}}}