{"id":"https://openalex.org/W3110955909","doi":"https://doi.org/10.3390/a13120340","title":"Lifting the Performance of a Heuristic for the Time-Dependent Travelling Salesman Problem through Machine Learning","display_name":"Lifting the Performance of a Heuristic for the Time-Dependent Travelling Salesman Problem through Machine Learning","publication_year":2020,"publication_date":"2020-12-14","ids":{"openalex":"https://openalex.org/W3110955909","doi":"https://doi.org/10.3390/a13120340","mag":"3110955909"},"language":"en","primary_location":{"id":"doi:10.3390/a13120340","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13120340","pdf_url":"https://www.mdpi.com/1999-4893/13/12/340/pdf","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/13/12/340/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033820151","display_name":"Gianpaolo Ghiani","orcid":"https://orcid.org/0000-0002-5243-1799"},"institutions":[{"id":"https://openalex.org/I142910587","display_name":"University of Salento","ror":"https://ror.org/03fc1k060","country_code":"IT","type":"education","lineage":["https://openalex.org/I142910587"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Gianpaolo Ghiani","raw_affiliation_strings":["Dipartimento di Ingegneria dell\u2019Innovazione, Universit\u00e0 del Salento, via per Monteroni, 73100 Lecce, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria dell\u2019Innovazione, Universit\u00e0 del Salento, via per Monteroni, 73100 Lecce, Italy","institution_ids":["https://openalex.org/I142910587"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045221076","display_name":"Tommaso Adamo","orcid":"https://orcid.org/0000-0002-9505-5869"},"institutions":[{"id":"https://openalex.org/I142910587","display_name":"University of Salento","ror":"https://ror.org/03fc1k060","country_code":"IT","type":"education","lineage":["https://openalex.org/I142910587"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Tommaso Adamo","raw_affiliation_strings":["Dipartimento di Ingegneria dell\u2019Innovazione, Universit\u00e0 del Salento, via per Monteroni, 73100 Lecce, Italy"],"raw_orcid":"https://orcid.org/0000-0002-9505-5869","affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria dell\u2019Innovazione, Universit\u00e0 del Salento, via per Monteroni, 73100 Lecce, Italy","institution_ids":["https://openalex.org/I142910587"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085242987","display_name":"Pierpaolo Greco","orcid":"https://orcid.org/0000-0002-1948-5808"},"institutions":[{"id":"https://openalex.org/I142910587","display_name":"University of Salento","ror":"https://ror.org/03fc1k060","country_code":"IT","type":"education","lineage":["https://openalex.org/I142910587"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Pierpaolo Greco","raw_affiliation_strings":["Dipartimento di Ingegneria dell\u2019Innovazione, Universit\u00e0 del Salento, via per Monteroni, 73100 Lecce, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria dell\u2019Innovazione, Universit\u00e0 del Salento, via per Monteroni, 73100 Lecce, Italy","institution_ids":["https://openalex.org/I142910587"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049889261","display_name":"Emanuela Guerriero","orcid":"https://orcid.org/0000-0002-8959-5017"},"institutions":[{"id":"https://openalex.org/I142910587","display_name":"University of Salento","ror":"https://ror.org/03fc1k060","country_code":"IT","type":"education","lineage":["https://openalex.org/I142910587"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Emanuela Guerriero","raw_affiliation_strings":["Dipartimento di Ingegneria dell\u2019Innovazione, Universit\u00e0 del Salento, via per Monteroni, 73100 Lecce, Italy"],"raw_orcid":"https://orcid.org/0000-0002-8959-5017","affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria dell\u2019Innovazione, Universit\u00e0 del Salento, via per Monteroni, 73100 Lecce, Italy","institution_ids":["https://openalex.org/I142910587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5033820151"],"corresponding_institution_ids":["https://openalex.org/I142910587"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.1621,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.5647299,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"13","issue":"12","first_page":"340","last_page":"340"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13693","display_name":"Smart Systems and Machine Learning","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T13693","display_name":"Smart Systems and Machine Learning","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12406","display_name":"IoT and GPS-based Vehicle Safety Systems","score":0.9769999980926514,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T14189","display_name":"Intravenous Infusion Technology and Safety","score":0.9765999913215637,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7467081546783447},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7312349677085876},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.703726053237915},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5551714897155762},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4707537293434143},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.46503135561943054},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.45125612616539},{"id":"https://openalex.org/keywords/reuse","display_name":"Reuse","score":0.4329929053783417},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4304882287979126},{"id":"https://openalex.org/keywords/nearest-neighbour-algorithm","display_name":"Nearest neighbour algorithm","score":0.42693421244621277},{"id":"https://openalex.org/keywords/unsupervised-learning","display_name":"Unsupervised learning","score":0.4232166111469269},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4128267168998718},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2618078589439392},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20300841331481934}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7467081546783447},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7312349677085876},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.703726053237915},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5551714897155762},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4707537293434143},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.46503135561943054},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.45125612616539},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.4329929053783417},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4304882287979126},{"id":"https://openalex.org/C184879717","wikidata":"https://www.wikidata.org/wiki/Q1374523","display_name":"Nearest neighbour algorithm","level":3,"score":0.42693421244621277},{"id":"https://openalex.org/C8038995","wikidata":"https://www.wikidata.org/wiki/Q1152135","display_name":"Unsupervised learning","level":2,"score":0.4232166111469269},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4128267168998718},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2618078589439392},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20300841331481934},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a13120340","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13120340","pdf_url":"https://www.mdpi.com/1999-4893/13/12/340/pdf","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:86fcf640e04f4c939e58395b3d83161b","is_oa":true,"landing_page_url":"https://doaj.org/article/86fcf640e04f4c939e58395b3d83161b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 13, Iss 12, p 340 (2020)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/13/12/340/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a13120340","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 13; Issue 12; Pages: 340","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a13120340","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13120340","pdf_url":"https://www.mdpi.com/1999-4893/13/12/340/pdf","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.41999998688697815,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W62590130","https://openalex.org/W164198786","https://openalex.org/W178407265","https://openalex.org/W841791096","https://openalex.org/W1968429519","https://openalex.org/W1981245140","https://openalex.org/W1990021722","https://openalex.org/W2001239606","https://openalex.org/W2035591608","https://openalex.org/W2059305197","https://openalex.org/W2072136110","https://openalex.org/W2077539478","https://openalex.org/W2083519799","https://openalex.org/W2084987997","https://openalex.org/W2089492663","https://openalex.org/W2090486865","https://openalex.org/W2093723113","https://openalex.org/W2093805145","https://openalex.org/W2098156747","https://openalex.org/W2107612355","https://openalex.org/W2127218421","https://openalex.org/W2150969685","https://openalex.org/W2155694204","https://openalex.org/W2233419640","https://openalex.org/W2587562419","https://openalex.org/W2626188202","https://openalex.org/W2733776472","https://openalex.org/W2757821154","https://openalex.org/W2777482433","https://openalex.org/W2809211340","https://openalex.org/W2809723281","https://openalex.org/W2890190333","https://openalex.org/W2896556344","https://openalex.org/W2899631268","https://openalex.org/W2900896126","https://openalex.org/W2901078150","https://openalex.org/W2908995658","https://openalex.org/W2971416083","https://openalex.org/W3044242234","https://openalex.org/W3085938759","https://openalex.org/W4255108251","https://openalex.org/W6674937654"],"related_works":["https://openalex.org/W2990663423","https://openalex.org/W2963876309","https://openalex.org/W1967341325","https://openalex.org/W4300949310","https://openalex.org/W2554237698","https://openalex.org/W3171568022","https://openalex.org/W4311068855","https://openalex.org/W87675801","https://openalex.org/W3113374561","https://openalex.org/W2023878529"],"abstract_inverted_index":{"In":[0,152],"recent":[1],"years,":[2],"there":[3],"have":[4,115,164],"been":[5,165],"several":[6],"attempts":[7],"to":[8,13,40,84,98,101,116,154],"use":[9,131],"machine":[10],"learning":[11],"techniques":[12,36],"improve":[14,41],"the":[15,28,42,45,52,75,85,88,103,136,143,147,156,161,169,174,194],"performance":[16],"of":[17,26,44,77,87,94,158,179,190],"exact":[18],"and":[19,34,120,142,184,204],"approximate":[20],"optimization":[21],"algorithms.":[22],"Along":[23],"this":[24,95,159],"line":[25],"research,":[27],"present":[29],"paper":[30],"shows":[31],"how":[32,100],"supervised":[33],"unsupervised":[35],"can":[37,63],"be":[38,64,117],"used":[39],"quality":[43],"solutions":[46],"generated":[47,171],"by":[48],"a":[49,67,71,78,132],"heuristic":[50,192],"for":[51,168,202,207],"Time-Dependent":[53],"Travelling":[54],"Salesman":[55],"Problem":[56],"with":[57,112,146],"no":[58],"increased":[59],"computing":[60],"time.":[61],"This":[62],"useful":[65],"in":[66,106,109,127],"real-time":[68],"setting":[69],"where":[70],"speed":[72],"update":[73],"(or":[74],"arrival":[76],"new":[79],"customer":[80],"request)":[81],"may":[82],"lead":[83],"reoptimization":[86],"planned":[89],"route.":[90],"The":[91,186],"main":[92],"contribution":[93],"work":[96],"is":[97,125,199],"show":[99,155],"reuse":[102],"information":[104],"gained":[105],"those":[107],"settings":[108],"which":[110],"instances":[111],"similar":[113],"features":[114],"solved":[118],"over":[119,121,193],"again,":[122],"as":[123],"it":[124],"customary":[126],"distribution":[128],"management.":[129],"We":[130],"method":[133],"based":[134,172],"on":[135,173],"nearest":[137,196],"neighbor":[138,197],"procedure":[139,198],"(supervised":[140],"learning)":[141],"K-means":[144],"algorithm":[145],"Euclidean":[148],"distance":[149],"(unsupervised":[150],"learning).":[151],"order":[153],"effectiveness":[157],"approach,":[160],"computational":[162],"experiments":[163],"carried":[166],"out":[167],"dataset":[170],"real":[175],"travel":[176],"time":[177],"functions":[178],"two":[180],"European":[181],"cities:":[182],"Paris":[183],"London.":[185],"overall":[187],"average":[188],"improvement":[189],"our":[191],"classical":[195],"about":[200,205],"5%":[201],"London,":[203],"4%":[206],"Paris.":[208]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}