{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:13:15Z","timestamp":1743095595097,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031300349"},{"type":"electronic","value":"9783031300356"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30035-6_1","type":"book-chapter","created":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T06:05:48Z","timestamp":1680156348000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fairer Comparisons for\u00a0Travelling Salesman Problem Solutions Using Hash Functions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7936-9430","authenticated-orcid":false,"given":"Mehdi","family":"El Krari","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3448-3912","authenticated-orcid":false,"given":"Rym Nesrine","family":"Guibadj","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2093-8990","authenticated-orcid":false,"given":"John","family":"Woodward","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1836-6679","authenticated-orcid":false,"given":"Denis","family":"Robilliard","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,31]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Brownlee, A.E., Woodward, J.R., Swan, J.: Metaheuristic design pattern: surrogate fitness functions. In: Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation, pp. 1261\u20131264 (2015)","DOI":"10.1145\/2739482.2768499"},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Brucker, P.: Scheduling Algorithms. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-69516-5","DOI":"10.1007\/978-3-540-69516-5"},{"issue":"9\u201310","key":"1_CR3","doi-asserted-by":"publisher","first-page":"1672","DOI":"10.1016\/j.artint.2011.03.003","volume":"175","author":"S Cai","year":"2011","unstructured":"Cai, S., Su, K., Sattar, A.: Local search with edge weighting and configuration checking heuristics for minimum vertex cover. Artif. Intell. 175(9\u201310), 1672\u20131696 (2011)","journal-title":"Artif. Intell."},{"issue":"6","key":"1_CR4","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes, G.A.: A method for solving traveling-salesman problems. Oper. Res. 6(6), 791\u2013812 (1958)","journal-title":"Oper. Res."},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"El Krari, M., Guibadj, R.N., Woodward, J., Robilliard, D.: Introducing a hash function for the travelling salesman problem for differentiating solutions. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 123\u2013124. GECCO 2021, Association for Computing Machinery, New York, NY, USA (2021). https:\/\/doi.org\/10.1145\/3449726.3459580","DOI":"10.1145\/3449726.3459580"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1214\/09-SS051","volume":"4","author":"MP Fay","year":"2010","unstructured":"Fay, M.P., Proschan, M.A.: Wilcoxon-Mann-Whitney or t-test? on assumptions for hypothesis tests and multiple interpretations of decision rules. Statist. Surv. 4, 1 (2010)","journal-title":"Statist. Surv."},{"issue":"1","key":"1_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1287\/opre.4.1.61","volume":"4","author":"MM Flood","year":"1956","unstructured":"Flood, M.M.: The traveling-salesman problem. Oper. Res. 4(1), 61\u201375 (1956)","journal-title":"Oper. Res."},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Hartung, E., Hoang, H.P., M\u00fctze, T., Williams, A.: Combinatorial generation via permutation languages. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1214\u20131225. SIAM (2020)","DOI":"10.1137\/1.9781611975994.74"},{"issue":"2\u20133","key":"1_CR9","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10589-005-3057-0","volume":"33","author":"M Hifi","year":"2006","unstructured":"Hifi, M., Michrafy, M., Sbihi, A.: A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem. Comput. Optim. Appl. 33(2\u20133), 271\u2013285 (2006)","journal-title":"Comput. Optim. Appl."},{"key":"1_CR10","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic local search: Foundations and applications. Elsevier (2004)"},{"issue":"1","key":"1_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"TC Koopmans","year":"1957","unstructured":"Koopmans, T.C., Beckmann, M.: Assignment problems and the location of economic activities. Econometrica 25(1), 53\u201376 (1957)","journal-title":"Econometrica"},{"key":"1_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04726-2","volume-title":"Foundations of Genetic Programming","author":"WB Langdon","year":"2013","unstructured":"Langdon, W.B., Poli, R.: Foundations of Genetic Programming. Springer Science & Business Media, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-662-04726-2"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Larra\u00f1aga, P., Kuijpers, C., Murga, R., Inza, I., Dizdarevic, S.: Genetic algorithms for the travelling salesman problem: A review of representations and operators. Artif. Intell. Rev. Int. Surv. Tutor. J. 13(2), 129\u2013170 (1999)","DOI":"10.1023\/A:1006529012972"},{"issue":"2","key":"1_CR14","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","volume":"176","author":"EM Loiola","year":"2007","unstructured":"Loiola, E.M., de Abreu, N.M.M., Boaventura-Netto, P.O., Hahn, P., Querido, T.: A survey for the quadratic assignment problem. Eur. J. Oper. Res. 176(2), 657\u2013690 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Mann, H.B., Whitney, D.R.: On a test of whether one of two random variables is stochastically larger than the other. Ann. Math. Statist. 50\u201360 (1947)","DOI":"10.1214\/aoms\/1177730491"},{"key":"1_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07807-5","volume-title":"How To Solve It: Modern Heuristics","author":"Z Michalewicz","year":"2013","unstructured":"Michalewicz, Z., Fogel, D.B.: How To Solve It: Modern Heuristics. Springer Science & Business Media, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-662-07807-5"},{"issue":"2","key":"1_CR17","first-page":"71","volume":"5","author":"W Pierskalla","year":"1967","unstructured":"Pierskalla, W.: The tri-substitution method for the three-dimensional assignment problem. Can. Oper. Res. Soc. J. 5(2), 71 (1967)","journal-title":"Can. Oper. Res. Soc. J."},{"issue":"4","key":"1_CR18","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB-a traveling salesman problem library. ORSA J. Comput. 3(4), 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"T\u00falio A.M., T., Thibaut, V., Tony, W.: Heuristics for vehicle routing problems Sequence or set optimization? Comput. Oper. Res. 105, 118\u2013131 (2019)","DOI":"10.1016\/j.cor.2018.12.023"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF02022565","volume":"41","author":"DL Woodruff","year":"1993","unstructured":"Woodruff, D.L., Zemel, E.: Hashing vectors for Tabu search. Ann. Oper. Res. 41, 123\u2013137 (1993)","journal-title":"Ann. Oper. Res."},{"key":"1_CR21","doi-asserted-by":"publisher","unstructured":"Woodward, J.R., Bai, R.: Canonical representation genetic programming. In: Proceedings of the First ACM\/SIGEVO Summit on Genetic and Evolutionary Computation, pp. 585\u2013592. GEC 2009, Association for Computing Machinery, New York, NY, USA (2009). https:\/\/doi.org\/10.1145\/1543834.1543914","DOI":"10.1145\/1543834.1543914"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30035-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,4]],"date-time":"2023-04-04T23:14:17Z","timestamp":1680650057000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30035-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031300349","9783031300356"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30035-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"31 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoCOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brno","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2023\/evocop\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}