{"id":"https://openalex.org/W7154681542","doi":"https://doi.org/10.48550/arxiv.2604.14745","title":"On the Use of Iterative Problem Solving for the Traveling Salesperson Problem with Changing Time Window Constraints","display_name":"On the Use of Iterative Problem Solving for the Traveling Salesperson Problem with Changing Time Window Constraints","publication_year":2026,"publication_date":"2026-04-16","ids":{"openalex":"https://openalex.org/W7154681542","doi":"https://doi.org/10.48550/arxiv.2604.14745"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.14745","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.14745","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.14745","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036572807","display_name":"Hy Nguyen","orcid":"https://orcid.org/0009-0008-7092-3106"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nguyen, Hy","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043643421","display_name":"Thanh Nguyen Pham","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pham, Thanh Nguyen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012908766","display_name":"Helen Yuliana Angmalisang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Angmalisang, Helen Yuliana","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5118856146","display_name":"Liam Wigney","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wigney, Liam","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5133914857","display_name":"Frank Neumann","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Neumann, Frank","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.3515999913215637,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.3515999913215637,"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.2522999942302704,"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/T11704","display_name":"Mobile Crowdsensing and Crowdsourcing","score":0.04879999905824661,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6521000266075134},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6328999996185303},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.6205000281333923},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.5012999773025513},{"id":"https://openalex.org/keywords/iterative-refinement","display_name":"Iterative refinement","score":0.40939998626708984},{"id":"https://openalex.org/keywords/window","display_name":"Window (computing)","score":0.3822999894618988},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.3630000054836273},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.35569998621940613},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.3400999903678894}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6891999840736389},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6521000266075134},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6328999996185303},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.6205000281333923},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5903000235557556},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.5012999773025513},{"id":"https://openalex.org/C2779982483","wikidata":"https://www.wikidata.org/wiki/Q6094420","display_name":"Iterative refinement","level":2,"score":0.40939998626708984},{"id":"https://openalex.org/C2778751112","wikidata":"https://www.wikidata.org/wiki/Q835016","display_name":"Window (computing)","level":2,"score":0.3822999894618988},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3630000054836273},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.35569998621940613},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34619998931884766},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.3400999903678894},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.3345000147819519},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.3215999901294708},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.3100999891757965},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2955999970436096},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.2930000126361847},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.2890999913215637},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.2802000045776367},{"id":"https://openalex.org/C2776175482","wikidata":"https://www.wikidata.org/wiki/Q1195816","display_name":"Transfer (computing)","level":2,"score":0.27570000290870667},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.26269999146461487},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.25949999690055847},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.2574999928474426},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.25279998779296875}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.14745","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.14745","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.14745","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.14745","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"many":[1],"real-world":[2],"settings,":[3],"problem":[4,31],"instances":[5],"that":[6,113,144],"need":[7],"to":[8],"be":[9,22],"solved":[10,72],"are":[11],"quite":[12],"similar,":[13],"and":[14,99,133,155],"knowledge":[15],"from":[16,70,117],"previous":[17,123],"optimization":[18],"runs":[19],"can":[20],"potentially":[21],"utilized.":[23],"We":[24,74,103],"explore":[25],"this":[26,76],"for":[27],"the":[28,42,118,122,126,145,152],"Traveling":[29],"Salesperson":[30],"with":[32,67,109,161],"time":[33,101],"windows":[34],"(TSPTW),":[35],"which":[36,83],"often":[37],"arises":[38],"in":[39,82,151],"settings":[40],"where":[41],"travel-time":[43],"matrix":[44],"is":[45,87,148],"fixed":[46],"but":[47],"time-window":[48,97],"constraints":[49],"change":[50],"across":[51],"related":[52,91],"tasks.":[53,73],"Existing":[54],"TSPTW":[55],"studies,":[56],"however,":[57],"have":[58],"not":[59],"systematically":[60],"compared":[61],"solving":[62],"such":[63],"task":[64,116],"sequences":[65],"independently":[66],"sequential":[68],"transfer":[69],"previously":[71],"address":[75],"gap":[77],"using":[78,125],"a":[79,105,136],"multi-task":[80],"benchmark":[81],"each":[84,115],"base":[85],"instance":[86],"expanded":[88],"into":[89],"five":[90],"tasks":[92],"under":[93,135,158],"two":[94],"environments:":[95],"partial":[96],"expansion":[98],"swap-additive":[100,159],"reassignment.":[102],"compare":[104],"standard":[106],"from-scratch":[107],"protocol":[108,112,147],"an":[110],"iterative":[111,146],"initializes":[114],"best":[119],"tour":[120],"of":[121],"task,":[124],"popular":[127],"local":[128],"search":[129],"approaches":[130],"LNS,":[131],"VNS,":[132],"LKH-3":[134],"common":[137],"penalized-score":[138],"objective.":[139],"Our":[140],"experimental":[141],"results":[142],"show":[143],"consistently":[149],"superior":[150],"progressive-relaxation":[153],"setting":[154],"generally":[156],"competitive":[157],"changes,":[160],"improvements":[162],"increasing":[163],"on":[164],"more":[165],"difficult":[166],"instances.":[167]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-18T00:00:00"}