{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,7]],"date-time":"2024-04-07T21:40:28Z","timestamp":1712526028464},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,6,22]],"date-time":"2011-06-22T00:00:00Z","timestamp":1308700800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artif Intell Rev"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s10462-011-9256-4","type":"journal-article","created":{"date-parts":[[2011,6,21]],"date-time":"2011-06-21T09:50:14Z","timestamp":1308649814000},"page":"313-324","source":"Crossref","is-referenced-by-count":3,"title":["Toward understanding the optimization of complex systems"],"prefix":"10.1007","volume":"38","author":[{"given":"Jiming","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Wang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,6,22]]},"reference":[{"key":"9256_CR1","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1038\/nature03602","volume":"435","author":"D Achlioptas","year":"2005","unstructured":"Achlioptas D, Naor A, Peres Y (2005) Rigorous location of phase transitions in hard optimization problems. Nature 435: 759\u2013764","journal-title":"Nature"},{"key":"9256_CR2","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"RK Ahuja","year":"2002","unstructured":"Ahuja RK, Ergun O, Orlin JB, Punnen AP (2002) A survey of very large-scale neighborhood search techniques. Discret Appl Math 123: 75\u2013102","journal-title":"Discret Appl Math"},{"key":"9256_CR3","doi-asserted-by":"crossref","unstructured":"Albert R, Barab\u00e1si AL (2007 August) The architecture of complexity, from network structure to human dynamics. IEEE Control Syst, pp 33\u201342","DOI":"10.1109\/MCS.2007.384127"},{"issue":"5439","key":"9256_CR4","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439): 509\u2013512","journal-title":"Science"},{"key":"9256_CR5","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/S0004-3702(00)00007-2","volume":"119","author":"S Boettcher","year":"2000","unstructured":"Boettcher S, Percus AG (2000) Nature\u2019s way of optimizing. Artif Intell 119: 275\u2013286","journal-title":"Artif Intell"},{"key":"9256_CR6","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1002\/cplx.10072","volume":"8","author":"S Boettcher","year":"2003","unstructured":"Boettcher S, Percus AG (2003) Optimization with extremal dynamics. Complexity 8: 57\u201362","journal-title":"Complexity"},{"issue":"suppl. 3","key":"9256_CR7","doi-asserted-by":"crossref","first-page":"7280","DOI":"10.1073\/pnas.082080899","volume":"99","author":"E Bonabeau","year":"2002","unstructured":"Bonabeau E (2002) Agent-based modeling: methods and techniques for simulating human systems. PNAS 99(suppl. 3): 7280\u20137287","journal-title":"PNAS"},{"key":"9256_CR8","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin S, Page L (1998) The anatomy of a large-scale hypertextual web search engine. Comput Netw ISDN Syst 30: 107\u2013117","journal-title":"Comput Netw ISDN Syst"},{"key":"9256_CR9","unstructured":"Cheesman P, Kanefsky B, Taylor WM (1991) Where the really hard problems Are. Proc IJCAI\u201991, pp 163\u2013169"},{"key":"9256_CR10","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1016\/j.physa.2006.04.052","volume":"371","author":"Y Chen","year":"2006","unstructured":"Chen Y, Zhang P (2006) Optimized annealing of traveling salesman problem from the nth-nearest-neighbor distribution. Phys A 371: 627\u2013632","journal-title":"Phys A"},{"key":"9256_CR11","doi-asserted-by":"crossref","first-page":"27104","DOI":"10.1103\/PhysRevE.72.027104","volume":"72","author":"J Duch","year":"2005","unstructured":"Duch J, Arenas A (2005) Community detection in complex networks using extremal optimization. Phys Rev E 72: 27104","journal-title":"Phys Rev E"},{"key":"9256_CR12","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1126\/science.1136800","volume":"315","author":"BJ Frey","year":"2007","unstructured":"Frey BJ, Dueck D (2007) Clustering by passing messages between data points. Science 315: 972\u2013976","journal-title":"Science"},{"key":"9256_CR13","volume-title":"The traveling salesman problem and its variations","author":"G Gutin","year":"2002","unstructured":"Gutin G, Punnen AP (2002) The traveling salesman problem and its variations. Kluwer Academic Publishers, Netherland"},{"issue":"4","key":"9256_CR14","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1162\/evco.1996.4.4.335","volume":"4","author":"W Hordijk","year":"1997","unstructured":"Hordijk W (1997) A measure of landscapes. Evol Comput 4(4): 335\u2013360","journal-title":"Evol Comput"},{"key":"9256_CR15","doi-asserted-by":"crossref","unstructured":"Jennings NR, Bussmann S (2003 June) Agent-based control systems. IEEE Control Syst Mags, pp 61\u201373","DOI":"10.1007\/3-540-36540-0_6"},{"key":"9256_CR16","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195079517.001.0001","volume-title":"The origins of order: self-organization and selection in evolution","author":"SA Kauffman","year":"1993","unstructured":"Kauffman SA (1993) The origins of order: self-organization and selection in evolution. Oxford University Press, Oxford"},{"key":"9256_CR17","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1427.001.0001","volume-title":"Artificial life: an overview","author":"CG Langton","year":"1995","unstructured":"Langton CG (1995) Artificial life: an overview. The MIT press, Cambridge"},{"issue":"2","key":"9256_CR18","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1109\/TSMCA.2002.1021106","volume":"32","author":"W Li","year":"2002","unstructured":"Li W, Alidaee B (2002) Dynamics of local search heuristics for the traveling salesman problem. IEEE Trans on Syst Man Cybern 32(2): 173\u2013184","journal-title":"IEEE Trans on Syst Man Cybern"},{"key":"9256_CR19","doi-asserted-by":"crossref","DOI":"10.1142\/4399","volume-title":"Autonomous agents and multi-agent systems: explorations in learning, self-organization and adaptive computation","author":"J Liu","year":"2001","unstructured":"Liu J (2001) Autonomous agents and multi-agent systems: explorations in learning, self-organization and adaptive computation. World Scientific Publishing Co., Inc., USA"},{"key":"9256_CR20","doi-asserted-by":"crossref","unstructured":"Liu J (2008) Autonomy-oriented computing: the nature and implications of a paradigm for self-organized computing. Keynote talk at the 4th International conference on natural computation (ICNC\u201908), and the 5th International conference on fuzzy systems and knowledge discovery (FSKD\u201908), October, pp 18\u201320","DOI":"10.1109\/ICNC.2008.872"},{"key":"9256_CR21","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0004-3702(01)00174-6","volume":"136","author":"J Liu","year":"2002","unstructured":"Liu J, Han J, Tang YY (2002) Multi-agent oriented constraint satisfaction. Artif Intell 136: 101\u2013144","journal-title":"Artif Intell"},{"key":"9256_CR22","volume-title":"Autonomy oriented computing: from problem solving to complex systems modeling","author":"J Liu","year":"2005","unstructured":"Liu J, Jin X, Tsui KC (2005) Autonomy oriented computing: from problem solving to complex systems modeling. Kluwer Academic Publishers\/Springer, Heidelberg"},{"key":"9256_CR23","unstructured":"Liu J, Chen YW, Lu YZ, Yang GK (2008) Self-organized combinatorial optimization. HongKong Baptist University, Computer Science, Technical reports: COMP-08-001. http:\/\/www.comp.hkbu.edu.hk\/en\/research\/?content=tech-reports"},{"key":"9256_CR24","doi-asserted-by":"crossref","DOI":"10.4159\/harvard.9780674180758","volume-title":"The Two-dimensional ising model","author":"BM McCoy","year":"1973","unstructured":"McCoy BM, Wu Tai Tsun (1973) The Two-dimensional ising model. Harvard University Press, Cambridge"},{"key":"9256_CR25","doi-asserted-by":"crossref","unstructured":"Mertens S (2002 May\/June) Computational complexity for physicists. Comput Sci Eng, pp 31\u201347","DOI":"10.1109\/5992.998639"},{"issue":"3","key":"9256_CR26","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1162\/1063656041774956","volume":"12","author":"P Merz","year":"2004","unstructured":"Merz P (2004) Advanced fitness landscape analysis and the performance of memetic algorithms. Evol Comput 12(3): 303\u2013325","journal-title":"Evol Comput"},{"key":"9256_CR27","doi-asserted-by":"crossref","first-page":"056126","DOI":"10.1103\/PhysRevE.66.056126","volume":"66","author":"M M\u00e9zard","year":"2002","unstructured":"M\u00e9zard M, Zecchina R (2002) Random K-satisfiability problem: from an analytic solution to an efficient algorithm. Phys Rev E 66: 056126","journal-title":"Phys Rev E"},{"key":"9256_CR28","doi-asserted-by":"crossref","first-page":"812","DOI":"10.1126\/science.1073287","volume":"297","author":"M M\u00e9zard","year":"2002","unstructured":"M\u00e9zard M, Parisi G, Zecchina R (2002) Analytic and algorithmic solution of random satisfiability problems. Science 297: 812\u2013815","journal-title":"Science"},{"key":"9256_CR29","first-page":"95","volume-title":"Computation in cellular automata: a selected review, nonstandard computation","author":"M Mitchell","year":"1998","unstructured":"Mitchell M (1998) Computation in cellular automata: a selected review, nonstandard computation. VCH Verlagsgesellschaft, Weinheim, pp 95\u2013140"},{"key":"9256_CR30","doi-asserted-by":"crossref","first-page":"1194","DOI":"10.1016\/j.artint.2006.10.002","volume":"170","author":"M Mitchell","year":"2006","unstructured":"Mitchell M (2006) Complex systems: network thinking. Artif Intell 170: 1194\u20131212","journal-title":"Artif Intell"},{"key":"9256_CR31","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1038\/22055","volume":"400","author":"R Monasson","year":"1999","unstructured":"Monasson R, Zecchina R, Kirkpatrick S, Selman B, Troyanskyk L (1999) Determining computational complexity from characteristic \u2018phase transitions\u2019. Nature 400: 133\u2013137","journal-title":"Nature"},{"issue":"2","key":"9256_CR32","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"Newman MEJ (2003) The structure and function of complex networks. SIAM Rev 45(2): 167\u2013256","journal-title":"SIAM Rev"},{"issue":"23","key":"9256_CR33","doi-asserted-by":"crossref","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"MEJ Newman","year":"2006","unstructured":"Newman MEJ (2006) Modularity and community structure in networks. PNAS 103(23): 8577\u20138582","journal-title":"PNAS"},{"key":"9256_CR34","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1100.001.0001","volume-title":"Advanced mean field methods: theory and practice","author":"M Opper","year":"2001","unstructured":"Opper M, Saad D (2001) Advanced mean field methods: theory and practice. MIT Press, Cambridge"},{"issue":"25","key":"9256_CR35","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1038\/nature05451","volume":"445","author":"FJ Poelwijk","year":"2007","unstructured":"Poelwijk FJ, Kiviet DJ, Weinreich DM, Tans SJ (2007) Empirical fitness landscapes reveal accessible evolutionary paths. Nature 445(25): 383\u2013386","journal-title":"Nature"},{"issue":"4","key":"9256_CR36","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt G (1991) TSPLIB-a traveling salesman problem library. ORSA J Comput 3(4): 376\u2013384","journal-title":"ORSA J Comput"},{"key":"9256_CR37","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1088\/0034-4885\/70\/3\/R03","volume":"70","author":"E Samanidou","year":"2007","unstructured":"Samanidou E, Zschischang E, Stauffer D, Lux T (2007) Agent-based models of financial markets. Reports Prog Phys 70: 409\u2013450","journal-title":"Reports Prog Phys"},{"key":"9256_CR38","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0004-3702(01)00151-5","volume":"132","author":"D Schuurmans","year":"2001","unstructured":"Schuurmans D, Southey F (2001) Local search characteristics of incomplete SAT procedures. Artif Intell 132: 121\u2013150","journal-title":"Artif Intell"},{"key":"9256_CR39","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1038\/35065725","volume":"410","author":"SH Strogatz","year":"2001","unstructured":"Strogatz SH (2001) Exploring complex networks. Nature 410: 268\u2013276","journal-title":"Nature"},{"key":"9256_CR40","volume-title":"Foundations of constraint satisfaction","author":"EPK Tsang","year":"1993","unstructured":"Tsang EPK (1993) Foundations of constraint satisfaction. Academic Press, London"},{"issue":"18","key":"9256_CR41","doi-asserted-by":"crossref","first-page":"188701","DOI":"10.1103\/PhysRevLett.92.188701","volume":"92","author":"EA Variano","year":"2004","unstructured":"Variano EA, McCoy JH, Lipson H (2004) Networks, dynamics, and modularity. Phys Rev Lett 92(18): 188701","journal-title":"Phys Rev Lett"}],"container-title":["Artificial Intelligence Review"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-011-9256-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10462-011-9256-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-011-9256-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,7]],"date-time":"2024-04-07T21:21:01Z","timestamp":1712524861000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10462-011-9256-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,22]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["9256"],"URL":"https:\/\/doi.org\/10.1007\/s10462-011-9256-4","relation":{},"ISSN":["0269-2821","1573-7462"],"issn-type":[{"value":"0269-2821","type":"print"},{"value":"1573-7462","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,22]]}}}