{"id":"https://openalex.org/W2038234006","doi":"https://doi.org/10.1080/10556780701550026","title":"New policies for the dynamic traveling salesman problem","display_name":"New policies for the dynamic traveling salesman problem","publication_year":2007,"publication_date":"2007-12-01","ids":{"openalex":"https://openalex.org/W2038234006","doi":"https://doi.org/10.1080/10556780701550026","mag":"2038234006"},"language":"en","primary_location":{"id":"doi:10.1080/10556780701550026","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780701550026","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"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/I4210095193","display_name":"Istituto Nazionale di Fisica Nucleare, Sezione di Lecce","ror":"https://ror.org/00qrf6g60","country_code":"IT","type":"facility","lineage":["https://openalex.org/I160013858","https://openalex.org/I4210095193"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Gianpaolo Ghiani","raw_affiliation_strings":["Dipartimento di Ingegneria dell\u2019Innovazione , Universit di Lecce , Via per Arnesano, 73100, Lecce, Italy","Dipartimento di Ingegneria dell'Innovazione, Universit di Lecce, Lecce, Italy#TAB#"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria dell\u2019Innovazione , Universit di Lecce , Via per Arnesano, 73100, Lecce, Italy","institution_ids":["https://openalex.org/I4210095193"]},{"raw_affiliation_string":"Dipartimento di Ingegneria dell'Innovazione, Universit di Lecce, Lecce, Italy#TAB#","institution_ids":["https://openalex.org/I4210095193"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064465441","display_name":"Antonella Quaranta","orcid":null},"institutions":[{"id":"https://openalex.org/I4210095193","display_name":"Istituto Nazionale di Fisica Nucleare, Sezione di Lecce","ror":"https://ror.org/00qrf6g60","country_code":"IT","type":"facility","lineage":["https://openalex.org/I160013858","https://openalex.org/I4210095193"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Antonella Quaranta","raw_affiliation_strings":["Dipartimento di Ingegneria dell\u2019Innovazione , Universit di Lecce , Via per Arnesano, 73100, Lecce, Italy ; Dipartimento di Matematica , Universit di Lecce , Via per Arnesano, 73100, Lecce, Italy","Dipartimento di Ingegneria dell'Innovazione, Universit di Lecce, Lecce, Italy,Dipartimento di Matematica, Universit di Lecce, Lecce, Italy#TAB#"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria dell\u2019Innovazione , Universit di Lecce , Via per Arnesano, 73100, Lecce, Italy ; Dipartimento di Matematica , Universit di Lecce , Via per Arnesano, 73100, Lecce, Italy","institution_ids":["https://openalex.org/I4210095193"]},{"raw_affiliation_string":"Dipartimento di Ingegneria dell'Innovazione, Universit di Lecce, Lecce, Italy,Dipartimento di Matematica, Universit di Lecce, Lecce, Italy#TAB#","institution_ids":["https://openalex.org/I4210095193"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039886917","display_name":"Chefi Triki","orcid":"https://orcid.org/0000-0002-8750-2470"},"institutions":[{"id":"https://openalex.org/I4210095193","display_name":"Istituto Nazionale di Fisica Nucleare, Sezione di Lecce","ror":"https://ror.org/00qrf6g60","country_code":"IT","type":"facility","lineage":["https://openalex.org/I160013858","https://openalex.org/I4210095193"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Chefi Triki","raw_affiliation_strings":["Dipartimento di Matematica , Universit di Lecce , Via per Arnesano, 73100, Lecce, Italy","Dipartimento di Matematica, Universit di Lecce, Lecce, Italy#TAB#"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica , Universit di Lecce , Via per Arnesano, 73100, Lecce, Italy","institution_ids":["https://openalex.org/I4210095193"]},{"raw_affiliation_string":"Dipartimento di Matematica, Universit di Lecce, Lecce, Italy#TAB#","institution_ids":["https://openalex.org/I4210095193"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5039886917"],"corresponding_institution_ids":["https://openalex.org/I4210095193"],"apc_list":null,"apc_paid":null,"fwci":0.9626,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.77924643,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"22","issue":"6","first_page":"971","last_page":"983"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T11942","display_name":"Transportation and Mobility Innovations","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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.9437047243118286},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.6245359778404236},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6159348487854004},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6045774221420288},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5770462155342102},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.4993882179260254},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4740062654018402},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4663250744342804},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.4496798515319824},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.43536365032196045},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.4293251633644104},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.3472296893596649},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27457183599472046},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.162310391664505},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.11610808968544006}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9437047243118286},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.6245359778404236},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6159348487854004},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6045774221420288},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5770462155342102},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.4993882179260254},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4740062654018402},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4663250744342804},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.4496798515319824},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.43536365032196045},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.4293251633644104},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3472296893596649},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27457183599472046},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.162310391664505},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.11610808968544006},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556780701550026","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780701550026","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W379668180","https://openalex.org/W598555709","https://openalex.org/W620344865","https://openalex.org/W1498585390","https://openalex.org/W1526340092","https://openalex.org/W1531600130","https://openalex.org/W1546822455","https://openalex.org/W1552828154","https://openalex.org/W1569990960","https://openalex.org/W1570617517","https://openalex.org/W1585652832","https://openalex.org/W1587044468","https://openalex.org/W1966197373","https://openalex.org/W1971739135","https://openalex.org/W1982973504","https://openalex.org/W1983688269","https://openalex.org/W1984143531","https://openalex.org/W1993966762","https://openalex.org/W2008806816","https://openalex.org/W2014068360","https://openalex.org/W2039275657","https://openalex.org/W2079487902","https://openalex.org/W2085495522","https://openalex.org/W2090939957","https://openalex.org/W2094965226","https://openalex.org/W2109997134","https://openalex.org/W2112686410","https://openalex.org/W2113529358","https://openalex.org/W2129557546","https://openalex.org/W2139295133","https://openalex.org/W2147111279","https://openalex.org/W2157376161","https://openalex.org/W2166635235","https://openalex.org/W2617045890","https://openalex.org/W2913711002","https://openalex.org/W3139501620"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2359992618","https://openalex.org/W2361554335","https://openalex.org/W4220987199","https://openalex.org/W2171568915","https://openalex.org/W2362402143","https://openalex.org/W2265604726","https://openalex.org/W2033053473","https://openalex.org/W8433631"],"abstract_inverted_index":{"The":[0],"dynamic":[1],"traveling":[2,11],"salesman":[3,12],"problem":[4,13],"is":[5],"a":[6,20,63],"variant":[7],"of":[8,38,67],"the":[9,33,40,43,59,78],"classical":[10],"in":[14,19,42,55,74],"which":[15],"service":[16],"requests":[17],"arrive":[18],"random":[21],"fashion.":[22],"In":[23,45],"this":[24],"paper":[25],"we":[26,47],"propose":[27],"three":[28,79],"new":[29],"routing":[30],"policies":[31,51,80],"minimizing":[32],"expected":[34],"total":[35],"waiting":[36],"time":[37],"all":[39],"demands":[41],"system.":[44],"particular,":[46],"show":[48],"that":[49],"two":[50],"are":[52],"asymptotically":[53],"optimal":[54],"heavy":[56],"traffic,":[57],"whereas":[58],"third":[60],"one":[61],"has":[62],"constant":[64],"factor":[65],"guarantee":[66],"two.":[68],"We":[69],"also":[70],"perform":[71],"extensive":[72],"simulations":[73],"order":[75],"to":[76],"compare":[77],"under":[81],"various":[82],"arrival":[83],"rates.":[84]},"counts_by_year":[{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":14},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}