{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:18:40Z","timestamp":1759666720427,"version":"3.40.5"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319135625"},{"type":"electronic","value":"9783319135632"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13563-2_19","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T10:36:25Z","timestamp":1415961385000},"page":"216-227","source":"Crossref","is-referenced-by-count":4,"title":["Evolving Hard and Easy Traveling Salesman Problem Instances: A Multi-objective Approach"],"prefix":"10.1007","author":[{"given":"He","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wencheng","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhilei","family":"Ren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaochen","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Piao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Aarts, E.H., Lenstra, J.K.: Local search in combinatorial optimization. Princeton University Press (2003)","DOI":"10.1515\/9780691187563"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Abbass, H.A., Sarker, R., Newton, C.: PDE: a pareto-frontier differential evolution approach for multi-objective optimization problems. In: Proceedings of the 2001 Congress on Evolutionary Computation, pp. 971\u2013978. IEEE (2001)","DOI":"10.1109\/CEC.2001.934295"},{"key":"19_CR3","unstructured":"Applegate, D., Bixby, R., Chvatal, V., Cook, W.: Concorde tsp solver (2011), http:\/\/www.tsp.gatech.edu\/concorde.html"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Bischl, B., Mersmann, O., Trautmann, H., Preuss, M.: Algorithm selection based on exploratory landscape analysis and cost-sensitive learning. In: Proceedings of the 14th International Conference on Genetic and Evolutionary Computation Conference, pp. 313\u2013320. ACM (2012)","DOI":"10.1145\/2330163.2330209"},{"issue":"1","key":"19_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L. Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Machine Learning\u00a045(1), 5\u201332 (2001)","journal-title":"Machine Learning"},{"issue":"1","key":"19_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF01442131","volume":"4","author":"Y. Censor","year":"1977","unstructured":"Censor, Y.: Pareto optimality in multiobjective problems. Applied Mathematics and Optimization\u00a04(1), 41\u201359 (1977)","journal-title":"Applied Mathematics and Optimization"},{"issue":"1","key":"19_CR7","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.ejor.2006.06.033","volume":"181","author":"L. Chen","year":"2007","unstructured":"Chen, L., Bostel, N., Dejax, P., Cai, J., Xi, L.: A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal. European Journal of Operational Research\u00a0181(1), 40\u201358 (2007)","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"19_CR8","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"G. Croes","year":"1958","unstructured":"Croes, G.: A method for solving traveling-salesman problems. Operations Research\u00a06(6), 791\u2013812 (1958)","journal-title":"Operations Research"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Dorigo, M., Birattari, M.: Ant colony optimization. In: Encyclopedia of Machine Learning, pp. 36\u201339. Springer (2010)","DOI":"10.1007\/978-0-387-30164-8_22"},{"key":"19_CR10","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. WH Freeman & Co., San Francisco (1979)"},{"issue":"1","key":"19_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0304-4076(94)90038-8","volume":"60","author":"W.L. Goffe","year":"1994","unstructured":"Goffe, W.L., Ferrier, G.D., Rogers, J.: Global optimization of statistical functions with simulated annealing. Journal of Econometrics\u00a060(1), 65\u201399 (1994)","journal-title":"Journal of Econometrics"},{"key":"19_CR12","unstructured":"Goldberg, D.E.: Genetic algorithms. Pearson Education India (2006)"},{"key":"19_CR13","unstructured":"He, J., Chen, T., Yao, X.: On the easiest and hardest fitness functions (2012)"},{"issue":"5","key":"19_CR14","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1002\/cplx.6130010511","volume":"1","author":"W.G. Macready","year":"1996","unstructured":"Macready, W.G., Wolpert, D.H.: What makes an optimization problem hard? Complexity\u00a01(5), 40\u201346 (1996)","journal-title":"Complexity"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Mersmann, O., Bischl, B., Trautmann, H., Preuss, M., Weihs, C., Rudolph, G.: Exploratory landscape analysis. In: Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, pp. 829\u2013836. ACM (2011)","DOI":"10.1145\/2001576.2001690"},{"issue":"2","key":"19_CR16","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10472-013-9341-2","volume":"69","author":"O. Mersmann","year":"2013","unstructured":"Mersmann, O., Bischl, B., Trautmann, H., Wagner, M., Bossek, J., Neumann, F.: A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem. Annals of Mathematics and Artificial Intelligence\u00a069(2), 151\u2013182 (2013)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-642-32937-1_7","volume-title":"Parallel Problem Solving from Nature - PPSN XII","author":"C. Qian","year":"2012","unstructured":"Qian, C., Yu, Y., Zhou, Z.-H.: On algorithm-dependent boundary case identification for problem classes. In: Coello, C.A.C., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds.) PPSN 2012, Part I. LNCS, vol.\u00a07491, pp. 62\u201371. Springer, Heidelberg (2012)"},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"J.R. Rice","year":"1976","unstructured":"Rice, J.R.: The algorithm selection problem. Advances in Computers\u00a015, 65\u2013118 (1976)","journal-title":"Advances in Computers"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-13800-3_29","volume-title":"Learning and Intelligent Optimization","author":"K. Smith-Miles","year":"2010","unstructured":"Smith-Miles, K., van Hemert, J., Lim, X.Y.: Understanding TSP difficulty by learning from evolved instances. In: Blum, C., Battiti, R. (eds.) LION 4. LNCS, vol.\u00a06073, pp. 266\u2013280. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Simulated Evolution and Learning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13563-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T17:54:40Z","timestamp":1747158880000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-13563-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319135625","9783319135632"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13563-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}