{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T19:39:22Z","timestamp":1760729962038},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"8-9","license":[{"start":{"date-parts":[[2008,7,26]],"date-time":"2008-07-26T00:00:00Z","timestamp":1217030400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2009,7]]},"DOI":"10.1007\/s00500-008-0355-3","type":"journal-article","created":{"date-parts":[[2008,7,25]],"date-time":"2008-07-25T06:57:42Z","timestamp":1216969062000},"page":"905-917","source":"Crossref","is-referenced-by-count":32,"title":["A memetic algorithm for the optimal winner determination problem"],"prefix":"10.1007","volume":"13","author":[{"given":"Dalila","family":"Boughaci","sequence":"first","affiliation":[]},{"given":"Bela\u00efd","family":"Benhamou","sequence":"additional","affiliation":[]},{"given":"Habiba","family":"Drias","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,7,26]]},"reference":[{"key":"355_CR1","doi-asserted-by":"crossref","unstructured":"Andersson A, Tenhunen M, Ygge F (2000) Integer programming for combinatorial auction winner determination. In: Proceedings of 4th international conference on multi-agent systems. IEEE Computer Society Press, New York, pp 39\u201346","DOI":"10.1109\/ICMAS.2000.858429"},{"issue":"2","key":"355_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) Genetics and random keys for sequencing and optimization. ORSA J Comput 6(2): 154\u2013160","journal-title":"ORSA J Comput"},{"issue":"2","key":"355_CR3","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1504\/IJIEM.2005.007639","volume":"3","author":"D Boughaci","year":"2005","unstructured":"Boughaci D, Drias H (2005) Taboo Search as an Intelligent Agent for Bid Evaluation. Int J Internet Enter Manage (IJIEM) 3(2): 170\u2013186","journal-title":"Int J Internet Enter Manage (IJIEM)"},{"key":"355_CR4","unstructured":"Boughaci D, Drias H, Benhamou B (2004) Solving Max-SAT problems using a mimetic evolutionary metaheuristic. In: Proceedings of 2004 IEEE CIS 2004, pp 480\u2013484"},{"issue":"3","key":"355_CR5","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/A:1011291030731","volume":"15","author":"E Burke","year":"2001","unstructured":"Burke E, Cowling P, DeCausmaecker Berghe GV (2001) A memetic approach to the nurse rostering problem. Appl Intell 15(3): 199\u2013214","journal-title":"Appl Intell"},{"issue":"1","key":"355_CR6","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/TSMCB.2006.883271","volume":"37","author":"A Caponio","year":"2007","unstructured":"Caponio A, Cascella GL, Neri F, Salvatore N, Sumner M (2007) A fast adaptive memetic algorithm for online and offline control design of pmsm drives. IEEE Trans Syst Man Cybern B 37(1): 28\u201341","journal-title":"IEEE Trans Syst Man Cybern B"},{"key":"355_CR7","volume-title":"Agent-mediated electronic commerce II. Lecture Notes in AI, vol 1788","author":"J Collins","year":"2000","unstructured":"Collins J, Sundareswara R, Gini M, Mobasher B (2000) Bid selection strategies for multi-agent contracting in the presence of scheduling constraints. In: Moukas A, Sierra C, Ygge F (eds) Agent-mediated electronic commerce II. Lecture Notes in AI, vol 1788. Springer, Heidelberg"},{"key":"355_CR8","volume-title":"The selfish gene","author":"R Dawkins","year":"1976","unstructured":"Dawkins R (1976) The selfish gene. Oxford University Press, Oxford"},{"issue":"1","key":"355_CR9","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/S0377-2217(00)00140-5","volume":"132","author":"PM Franca","year":"2001","unstructured":"Franca PM, Mendes A, Moscato P (2001) A memetic algorithm for the total tardiness single machine scheduling problem. Eur J Oper Res 132(1): 224\u2013242","journal-title":"Eur J Oper Res"},{"key":"355_CR10","unstructured":"Fujishima Y, Leyton-Brown K, Shoham Y (1999) Taming the computational complexity of combinatorial auctions: optimal and approximate approaches. In: Sixteenth international joint conference on artificial intelligence, pp 48\u201353"},{"key":"355_CR11","unstructured":"Guo Y, Lim A, Rodrigues B, Zhu Y, (2004) Heuristics for a brokering set packing problem. In: Proceedings of eighth international symposium on artificial intelligence and mathematics, pp 10\u201314"},{"issue":"8","key":"355_CR12","doi-asserted-by":"crossref","first-page":"2179","DOI":"10.1016\/j.cor.2005.01.007","volume":"33","author":"Y Guo","year":"2006","unstructured":"Guo Y, Lim A, Rodrigues B, Zhu Y (2006) Heuristics for a bidding problem. Comp Oper Res 33(8): 2179\u20132188","journal-title":"Comp Oper Res"},{"key":"355_CR13","doi-asserted-by":"crossref","unstructured":"Hart William E, Krasnogor N, Smith JE (eds) (2005) Recent Advances in Memetic Algorithms. In: Series: studies in fuzziness and soft computing, vol 166","DOI":"10.1007\/3-540-32363-5"},{"issue":"3\u20134","key":"355_CR14","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1023\/B:AIRE.0000036262.43475.22","volume":"21","author":"A\u00a0 Holland","year":"2004","unstructured":"Holland A\u00a0, \u00a0O\u2019sullivan B (2004) Towards fast vickrey pricing using constraint programming. Artif Intell Rev 21(3\u20134): 335\u2013352","journal-title":"Artif Intell Rev"},{"key":"355_CR15","unstructured":"Hoos HH (2002) An Adaptive Noise Mechanism for WalkSAT. In: Proceedings of the 19 th national conference on artificial intelligence AAAI\/IAAI 2002, pp 655\u2013660"},{"key":"355_CR16","unstructured":"Hoos HH, Boutilier C (2000) Solving combinatorial auctions using stochastic local search. In: Proceedings of the 17th national conference on artificial intelligence, pp 22\u201329"},{"key":"355_CR17","unstructured":"Lau HC, Goh YG (2002) An intelligent brokering system to support multi-agent web-based 4th-party logistics. In: Proceedings of the 14th international conference on tools with artificial intelligence, 2002, pp 54\u201361"},{"key":"355_CR18","first-page":"1246","volume":"1","author":"H Ishibuchi","year":"2004","unstructured":"Ishibuchi H, Narukawa K (2004) Some issues on the implementation of local search in evolutionary multi-objective optimization. Proc GECCO 1: 1246\u20131258","journal-title":"Proc GECCO"},{"issue":"2","key":"355_CR19","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1109\/TEVC.2003.810752","volume":"7","author":"H Ishibuchi","year":"2003","unstructured":"Ishibuchi H, Yoshida T, Murata T (2003) \u2019Balance between genetic search and local search in memetic algorithms for multi-objective permutation flowshop scheduling. IEEE Trans Evolut Comput 7(2): 204\u2013223","journal-title":"IEEE Trans Evolut Comput"},{"key":"355_CR20","doi-asserted-by":"crossref","unstructured":"Leyton-Brown K, Pearson M, Shoham Y (2000a) Towards a universal test suite for combinatorial auction algorithms. In: ACM conference on electronic commerce, pp 66\u201376","DOI":"10.1145\/352871.352879"},{"key":"355_CR21","unstructured":"Leyton-Brown K, Tennenholtz M, Shoham Y (2000b)\u00a0An algorithm for multi-unit combinatorial auctions. In: Proceedings of the 17th national conference on artificial intelligence, Austin, Games-2000, Bilbao, and ISMP-2000, Atlanta"},{"key":"355_CR22","first-page":"699","volume":"25","author":"R McAfee","year":"1987","unstructured":"McAfee R, McMillan PJ (1987) Auctions and bidding. J Econ Lit 25: 699\u2013738","journal-title":"J Econ Lit"},{"key":"355_CR23","unstructured":"Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. In: Caltech concurrent computation program, C3P Report 826"},{"issue":"2","key":"355_CR24","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1109\/TCBB.2007.070202","volume":"4","author":"F Neri","year":"2007","unstructured":"Neri F, Toivanen J, Cascella G, Yew-Soon Ong (2007) An adaptive multimeme algorithm for designing HIV multidrug therapies. IEEE\/ACM Trans Comput Biol Bioinf 4(2): 264\u2013278","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"key":"355_CR25","doi-asserted-by":"crossref","unstructured":"Nisan N (2000) Bidding and allocation in combinatorial auctions. In: Proceedings of ACM conference on electronic commerce (EC\u201900). ACM SIGecom, ACM Press, Minneapolis, October, pp 1\u201312","DOI":"10.1145\/352871.352872"},{"issue":"1","key":"355_CR26","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1109\/TSMCB.2005.856143","volume":"36","author":"YS Ong","year":"2006","unstructured":"Ong YS, Lim MH, Zhu N, Wong KW (2006) Classification of adaptive memetic algorithms: a comparative study. IEEE Trans Syst Man Cybern B 36(1): 141\u2013152","journal-title":"IEEE Trans Syst Man Cybern B"},{"key":"355_CR27","doi-asserted-by":"crossref","unstructured":"Ong YS, Krasnogor N, Ishibuchi H (eds) (2007) Special Issue on Memetic Algorithms. IEEE Trans Syst Man Cybern B 37(1)","DOI":"10.1109\/TSMCB.2006.883274"},{"issue":"8","key":"355_CR28","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","volume":"44","author":"MH Rothkopf","year":"1998","unstructured":"Rothkopf MH, Pekee A, Ronald M (1998) Computationally manageable combinatorial auctions. Manag Sci 44(8): 1131\u20131147","journal-title":"Manag Sci"},{"issue":"1\u20132","key":"355_CR29","first-page":"1","volume":"135","author":"T Sandholm","year":"1999","unstructured":"Sandholm T (1999) Algorithms for optimal winner determination in combinatorial auctions. Artif Intell 135(1\u20132): 1\u201354","journal-title":"Artif Intell"},{"key":"355_CR30","doi-asserted-by":"crossref","unstructured":"Sandholm T (2006) Optimal winner determination algorithms. In: Cramton P et al (ed) Combinatorial auctions. MIT Press, Cambridge","DOI":"10.7551\/mitpress\/9780262033428.003.0015"},{"key":"355_CR31","unstructured":"Sandholm T, Suri S, (2000) Improved optimal algorithm for combinatorial auctions and generalizations. In: Proceedings of the 17th national conference on artificial intelligence, pp 90\u201397"},{"key":"355_CR32","unstructured":"Sandholm T, Suri S, Gilpin A, Levine D (2001) CABoB: a fast optimal algorithm for combinatorial auctions. In: Proceedings of the international joint conferences on artificial intelligence, pp 1102\u20131108"},{"issue":"1","key":"355_CR33","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/TSMCB.2006.883268","volume":"37","author":"M Tang","year":"2007","unstructured":"Tang M, Yao X (2007) A memetic algorithm for VLSI floorplanning. IEEE Trans Syst Man Cybern B 37(1): 62\u201369","journal-title":"IEEE Trans Syst Man Cybern B"},{"issue":"9","key":"355_CR34","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1007\/s00500-006-0139-6","volume":"11","author":"J Tang","year":"2007","unstructured":"Tang J, Lim MH, Ong YS (2007) Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems. Soft Comput 11(9): 873\u2013888","journal-title":"Soft Comput"},{"key":"355_CR35","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1287\/ijoc.15.3.284.16077","volume":"15","author":"S Vries de","year":"2003","unstructured":"Vries de S, Vohra R (2003) Combinatorial auctions a survey. INFORMS J Comput 15: 284\u2013309","journal-title":"INFORMS J Comput"},{"issue":"10","key":"355_CR36","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1007\/s00500-006-0145-8","volume":"11","author":"Z Zhou","year":"2007","unstructured":"Zhou Z, Ong YS, Lim MH, Lee BS (2007) Memetic algorithm using multi-surrogates for computationally expensive optimization problems. Soft Comput 11(10): 957\u2013971","journal-title":"Soft Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-008-0355-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-008-0355-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-008-0355-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:39:55Z","timestamp":1559093995000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-008-0355-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,26]]},"references-count":36,"journal-issue":{"issue":"8-9","published-print":{"date-parts":[[2009,7]]}},"alternative-id":["355"],"URL":"https:\/\/doi.org\/10.1007\/s00500-008-0355-3","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,26]]}}}