{"id":"https://openalex.org/W4412508509","doi":"https://doi.org/10.1609/socs.v18i1.35989","title":"Bi-Objective Search for the Traveling Salesman Problem with Time Windows and Vacant Penalties","display_name":"Bi-Objective Search for the Traveling Salesman Problem with Time Windows and Vacant Penalties","publication_year":2025,"publication_date":"2025-07-19","ids":{"openalex":"https://openalex.org/W4412508509","doi":"https://doi.org/10.1609/socs.v18i1.35989"},"language":"en","primary_location":{"id":"doi:10.1609/socs.v18i1.35989","is_oa":true,"landing_page_url":"https://doi.org/10.1609/socs.v18i1.35989","pdf_url":"https://ojs.aaai.org/index.php/SOCS/article/download/35989/38144","source":{"id":"https://openalex.org/S4387284494","display_name":"Proceedings of the International Symposium on Combinatorial Search","issn_l":"2832-9163","issn":["2832-9163","2832-9171"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Symposium on Combinatorial Search","raw_type":"journal-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://ojs.aaai.org/index.php/SOCS/article/download/35989/38144","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011120967","display_name":"Shizhe Zhao","orcid":null},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shizhe Zhao","raw_affiliation_strings":["Shanghai Jiao Tong University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051287098","display_name":"Yunan Wu","orcid":"https://orcid.org/0000-0001-9387-664X"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yancheng Wu","raw_affiliation_strings":["Shanghai Jiao Tong University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018561143","display_name":"Zhongqiang Ren","orcid":"https://orcid.org/0000-0003-2880-8653"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhongqiang Ren","raw_affiliation_strings":["Shanghai Jiao Tong University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University","institution_ids":["https://openalex.org/I183067930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I183067930"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12594563,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":null,"first_page":"171","last_page":"179"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9911999702453613,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9911999702453613,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9900000095367432,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9842000007629395,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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.8295968770980835},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.5732027292251587},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5265855193138123},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.48845353722572327},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41134870052337646},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.3567989468574524},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.246689110994339}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8295968770980835},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.5732027292251587},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5265855193138123},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.48845353722572327},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41134870052337646},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3567989468574524},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.246689110994339}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1609/socs.v18i1.35989","is_oa":true,"landing_page_url":"https://doi.org/10.1609/socs.v18i1.35989","pdf_url":"https://ojs.aaai.org/index.php/SOCS/article/download/35989/38144","source":{"id":"https://openalex.org/S4387284494","display_name":"Proceedings of the International Symposium on Combinatorial Search","issn_l":"2832-9163","issn":["2832-9163","2832-9171"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Symposium on Combinatorial Search","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1609/socs.v18i1.35989","is_oa":true,"landing_page_url":"https://doi.org/10.1609/socs.v18i1.35989","pdf_url":"https://ojs.aaai.org/index.php/SOCS/article/download/35989/38144","source":{"id":"https://openalex.org/S4387284494","display_name":"Proceedings of the International Symposium on Combinatorial Search","issn_l":"2832-9163","issn":["2832-9163","2832-9171"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Symposium on Combinatorial Search","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G220987343","display_name":null,"funder_award_id":"62403313","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320309612","display_name":"Natural Science Foundation of Shanghai","ror":null},{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4412508509.pdf","grobid_xml":"https://content.openalex.org/works/W4412508509.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W2359992618","https://openalex.org/W4376138746","https://openalex.org/W2362402143","https://openalex.org/W2361554335","https://openalex.org/W4220987199","https://openalex.org/W2308371765","https://openalex.org/W2171568915","https://openalex.org/W2265604726","https://openalex.org/W2495211334"],"abstract_inverted_index":{"This":[0],"paper":[1,76],"investigates":[2],"a":[3,16,20,102,108],"Traveling":[4],"Salesman":[5],"Problem":[6],"with":[7,82],"Time":[8],"Windows":[9],"and":[10,40,56,67,107,119,130],"Vacant":[11],"Penalties":[12],"(TSP-TW-VP),":[13],"which":[14],"plans":[15],"path":[17,120],"to":[18,89],"service":[19],"set":[21],"of":[22],"machines":[23],"at":[24],"different":[25,143],"locations":[26],"within":[27],"their":[28],"respective":[29],"time":[30,39],"windows":[31],"while":[32],"minimizing":[33],"two":[34],"objective":[35,117],"functions:":[36],"the":[37,57,61,73,116,126,136],"finish":[38],"penalty":[41],"for":[42,94,138],"machine":[43],"vacancy.":[44],"There":[45],"is":[46,68,87],"often":[47],"no":[48],"single":[49],"solution":[50],"that":[51,86,125],"optimizes":[52],"both":[53,115],"objectives":[54],"simultaneously,":[55],"problem":[58],"thus":[59],"seeks":[60],"Pareto-optimal":[62,92],"solutions.":[63],"TSP-TW-VP":[64],"generalizes":[65],"TSP-TW":[66],"therefore":[69],"NP-hard.":[70],"To":[71],"solve":[72],"problem,":[74],"this":[75],"develops":[77],"an":[78],"algorithm":[79],"called":[80],"Search":[81],"Look-Ahead":[83],"Pruning":[84],"(S-LAP)":[85],"guaranteed":[88],"find":[90],"all":[91],"solutions":[93],"TSP-TW-VP.":[95],"S-LAP":[96],"gains":[97],"computational":[98],"efficiency":[99],"by":[100],"introducing":[101],"novel":[103],"look-ahead":[104,128],"pruning":[105,129],"rule,":[106],"fast":[109,131],"dominance":[110,132],"checking":[111],"method":[112],"based":[113],"on":[114],"functions":[118],"history.":[121],"Experimental":[122],"results":[123],"show":[124],"proposed":[127],"can":[133],"speed":[134],"up":[135],"search":[137],"2-8":[139],"times":[140],"over":[141],"4":[142],"datasets.":[144]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}