{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T21:19:15Z","timestamp":1794345555291,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540716143","type":"print"},{"value":"9783540716150","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-71615-0_18","type":"book-chapter","created":{"date-parts":[[2007,4,18]],"date-time":"2007-04-18T14:51:34Z","timestamp":1176907894000},"page":"198-209","source":"Crossref","is-referenced-by-count":6,"title":["An Analysis of Problem Difficulty for a Class of Optimisation Heuristics"],"prefix":"10.1007","author":[{"given":"Enda","family":"Ridge","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Kudenko","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1-2","key":"18_CR1","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-003-0440-4","volume":"97","author":"D. Applegate","year":"2003","unstructured":"Applegate, D., Bixby, R., Chvatal, V., Cook, W.: Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. Mathematical Programming Series B97(1-2), 91\u2013153 (2003)","journal-title":"Mathematical Programming Series B"},{"key":"18_CR2","first-page":"331","volume-title":"Proceedings of the Twelfth International Conference on Artificial Intelligence, vol. 1","author":"P. Cheeseman","year":"1991","unstructured":"Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the Really Hard Problems Are. In: Proceedings of the Twelfth International Conference on Artificial Intelligence, vol. 1, pp. 331\u2013337. Morgan Kaufmann Publishers, San Francisco (1991)"},{"issue":"1","key":"18_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation\u00a01(1), 53\u201366 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"18_CR4","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)"},{"key":"18_CR5","unstructured":"Fischer, T., St\u00fctzle, T., Hoos, H., Merz, P.: An Analysis Of The Hardness Of TSP Instances For Two High Performance Algorithms. In: Proceedings of the Sixth Metaheuristics International Conference, pp. 361\u2013367 (2005)"},{"issue":"1","key":"18_CR6","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K. Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research\u00a0126(1), 106\u2013130 (2000)","journal-title":"European Journal of Operational Research"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Johnson, D.S.: A Theoretician\u2019s Guide to the Experimental Analysis of Algorithms. In: Goldwasser, Johnson, and McGeoch (eds.) Proceedings of the Fifth and Sixth DIMACS Implementation Challenges, pp. 215\u2013250. American Mathematical Society (2002)","DOI":"10.1090\/dimacs\/059\/11"},{"key":"18_CR8","volume-title":"Design and Analysis of Experiments","author":"D.C. Montgomery","year":"2005","unstructured":"Montgomery, D.C.: Design and Analysis of Experiments, 6th edn. John Wiley and Sons Inc., New York (2005)","edition":"6"},{"issue":"8","key":"18_CR9","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T. St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T., Hoos, H.H.: Max-Min Ant System. Future Generation Computer Systems\u00a016(8), 889\u2013914 (2000)","journal-title":"Future Generation Computer Systems"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/978-3-540-31996-2_12","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"J.I. Hemert van","year":"2005","unstructured":"van Hemert, J.I.: Property Analysis of Symmetric Travelling Salesman Problem Instances Acquired Through Evolution. In: Raidl, G.R., Gottlieb, J. (eds.) EvoCOP 2005. LNCS, vol.\u00a03448, pp. 122\u2013131. Springer, Heidelberg (2005)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1007\/3-540-45712-7_63","volume-title":"Parallel Problem Solving from Nature - PPSN VII","author":"M. Zlochin","year":"2002","unstructured":"Zlochin, M., Dorigo, M.: Model based search for combinatorial optimization: A comparative study. In: Guerv\u00f3s, J.J.M., Adamidis, P.A., Beyer, H.-G., Fern\u00e1ndez-Villaca\u00f1as, J.-L., Schwefel, H.-P. (eds.) Parallel Problem Solving from Nature - PPSN VII. LNCS, vol.\u00a02439, pp. 651\u2013661. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71615-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T10:24:45Z","timestamp":1683800685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71615-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540716143","9783540716150"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71615-0_18","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-540-71615-0","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}