{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T04:23:31Z","timestamp":1745987011208,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642371974"},{"type":"electronic","value":"9783642371981"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37198-1_19","type":"book-chapter","created":{"date-parts":[[2013,3,5]],"date-time":"2013-03-05T03:03:05Z","timestamp":1362452585000},"page":"214-225","source":"Crossref","is-referenced-by-count":9,"title":["Predicting Genetic Algorithm Performance on the Vehicle Routing Problem Using Information Theoretic Landscape Measures"],"prefix":"10.1007","author":[{"given":"Mario","family":"Ventresca","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beatrice","family":"Ombuki-Berman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Runka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Alander, J.T., Zinchenko, L.A., Sorokin, S.N.: Analysis of fitness landscape properties for evolutionary antenna design. In: IEEE International Conference on Artificial Intelligence Systems, pp. 363\u2013368 (2002)","DOI":"10.1109\/ICAIS.2002.1048128"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Barnett, L.: Netcrawling-Optimal Evolutionary Search with Neutral Networks. In: Congress on Evolutionary Computation, pp. 30\u201337 (2001)","DOI":"10.1109\/CEC.2001.934367"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1287\/trsc.1030.0057","volume":"39","author":"O. Braysy","year":"2005","unstructured":"Braysy, O., Gendreau, M.: Vehicle routing problem with time windows, part ii: Metaheuristics. Transportation Science\u00a039, 119\u2013139 (2005)","journal-title":"Transportation Science"},{"issue":"5","key":"19_CR4","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1504\/IJOR.2008.019165","volume":"3","author":"M. Caramia","year":"2008","unstructured":"Caramia, M., Onori, R.: Experimenting crossover operators to solve the vehicle routing problem with time windows by genetic algorithms. International Journal of Operational Research\u00a03(5), 497\u2013514 (2008)","journal-title":"International Journal of Operational Research"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Czech, Z.J.: Statistical measures of a fitness landscape for the vehicle routing problem. In: IEEE International Symposium on Parallel and Distributed Processing, pp. 1\u20138 (2008)","DOI":"10.1109\/IPDPS.2008.4536369"},{"key":"19_CR6","unstructured":"Czech, Z.J.: A parallel simulated annealing algorithm as a tool for fitness landscape exploration. In: Ros, A. (ed.) Parallel and Distributed Processing, pp. 247\u2013271. In-Tech (2010)"},{"key":"19_CR7","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W. H. Freeman and Company (1979)"},{"key":"19_CR8","unstructured":"Jones, T.: Evolutionary Algorithms, Fitness Landscapes and Search. PhD thesis, University of New Mexico (1995)"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Kubiak, M.: Distance measures and fitness-distance analysis for the capacitated vehicle routing problem. In: Doerner, K.F., Gendreau, M., Greistorfer, P., Gutjahr, W., Hartl, R.F., Reimann, M. (eds.) Metaheuristics. Operations Research Computer Science Interfaces, vol.\u00a039, pp. 345\u2013364. Springer (2007)","DOI":"10.1007\/978-0-387-71921-4_18"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1287\/trsc.1090.0301","volume":"43","author":"G. Laporte","year":"2009","unstructured":"Laporte, G.: Fifty years of vehicle routing. Transportation Science\u00a043, 408\u2013416 (2009)","journal-title":"Transportation Science"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1023\/A:1018979424002","volume":"86","author":"D.C. Mattfeld","year":"1999","unstructured":"Mattfeld, D.C., Bierwirth, C., Kopfer, H.: A search space analysis of the job shop scheduling problem. Annals of Operations Research\u00a086, 441\u2013453 (1999)","journal-title":"Annals of Operations Research"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1007\/BFb0056918","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"P. Merz","year":"1998","unstructured":"Merz, P., Freisleben, B.: Memetic Algorithms and the Fitness Landscape of the Graph Bi-Partitioning Problem. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol.\u00a01498, pp. 765\u2013774. Springer, Heidelberg (1998)"},{"issue":"4","key":"19_CR13","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/4235.887234","volume":"4","author":"P. Merz","year":"2000","unstructured":"Merz, P., Freisleben, B.: Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Transactions on Evolutionary Computation\u00a04(4), 337\u2013352 (2000)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"1","key":"19_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/4235.843491","volume":"4","author":"B. Naudts","year":"2000","unstructured":"Naudts, B., Kallel, L.: A Comparison of Predictive Measures of Problem Difficulty in Evolutionary Algorithms. IEEE Transactions on Evolutionary Computation\u00a04(1), 1\u201316 (2000)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"1","key":"19_CR15","doi-asserted-by":"publisher","first-page":"95","DOI":"10.3844\/ajassp.2010.95.101","volume":"7","author":"H. Nazif","year":"2010","unstructured":"Nazif, H., Lee, L.S.: Optimized crossover genetic algorithm for vehicle routing problem with time windows. American Journal of Applied Sciences\u00a07(1), 95\u2013101 (2010)","journal-title":"American Journal of Applied Sciences"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Ombuki-Berman, B., Ventresca, M.: Search difficulty of two-connected ring-based topological network designs. In: IEEE Symposium on Foundations of Computational Intelligence, pp. 267\u2013274 (2007)","DOI":"10.1109\/FOCI.2007.372179"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1287\/ijoc.1080.0312","volume":"21","author":"J. Potvin","year":"2009","unstructured":"Potvin, J.: State-of-the art review evolutionary algorithms for vehicle routing. INFORMS Journal on Computing\u00a021, 518\u2013548 (2009)","journal-title":"INFORMS Journal on Computing"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Reeves, C.: Direct statistical estimation of GA landscape properties. In: Foundations of Genetic Algorithms 6, pp. 91\u2013107 (2000)","DOI":"10.1016\/B978-155860734-7\/50088-3"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Runka, A., Ombuki-Berman, B., Ventresca, M.: A search space analysis for the waste collection vehicle routing problem with time windows. In: Genetic and Evolutionary Computation Conference, pp. 1813\u20131814 (2009)","DOI":"10.1145\/1569901.1570175"},{"issue":"10","key":"19_CR20","doi-asserted-by":"publisher","first-page":"3143","DOI":"10.1016\/j.cor.2005.11.022","volume":"34","author":"T. Schiavinotto","year":"2007","unstructured":"Schiavinotto, T., Stutzle, T.: A review of metrics on permutations for search landscape analysis. Computers and Operations Research\u00a034(10), 3143\u20133153 (2007)","journal-title":"Computers and Operations Research"},{"issue":"3","key":"19_CR21","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1109\/TSMCB.2008.915539","volume":"38","author":"J. Tavares","year":"2008","unstructured":"Tavares, J., Pereira, B., Costa, E.: Multidimensional knapsack problem: A fitness landscape analysis. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cynernetics\u00a038(3), 604\u2013616 (2008)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cynernetics"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications (2002)","DOI":"10.1137\/1.9780898718515"},{"issue":"1","key":"19_CR23","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1162\/106365600568095","volume":"8","author":"V.K. Vassilev","year":"2000","unstructured":"Vassilev, V.K., Fogarty, T.C., Miller, J.F.: Information Characteristics and the Structure of Landscapes. Evolutionary Computation\u00a08(1), 31\u201360 (2000)","journal-title":"Evolutionary Computation"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Vassilev, V.K., Fogarty, T.C., Miller, J.F.: Fitness Landscapes: from Theory to Application. In: Advances in Evolutionary Computation: Theory and Applications, pp. 3\u201344. Springer (2003)","DOI":"10.1007\/978-3-642-18965-4_1"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Ventresca, M., Ombuki-Berman, B.: Search space analysis of recurrent spiking and continuous-time neural networks. In: IEEE International Joint Conference on Neural Networks, pp. 8947\u20138954 (2006)","DOI":"10.1109\/IJCNN.2006.247076"},{"key":"19_CR26","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF00202749","volume":"63","author":"E. Weinberger","year":"1990","unstructured":"Weinberger, E.: Correlated and Uncorrelated Landscapes and How to Tell the Difference. Biological Cybernetics\u00a063, 325\u2013336 (1990)","journal-title":"Biological Cybernetics"}],"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-642-37198-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T22:56:38Z","timestamp":1745967398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37198-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642371974","9783642371981"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37198-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}