{"id":"https://openalex.org/W2626431333","doi":"https://doi.org/10.1109/tits.2017.2706720","title":"Variable Neighborhood Search for a Colored Traveling Salesman Problem","display_name":"Variable Neighborhood Search for a Colored Traveling Salesman Problem","publication_year":2017,"publication_date":"2017-06-14","ids":{"openalex":"https://openalex.org/W2626431333","doi":"https://doi.org/10.1109/tits.2017.2706720","mag":"2626431333"},"language":"en","primary_location":{"id":"doi:10.1109/tits.2017.2706720","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tits.2017.2706720","pdf_url":null,"source":{"id":"https://openalex.org/S144771191","display_name":"IEEE Transactions on Intelligent Transportation Systems","issn_l":"1524-9050","issn":["1524-9050","1558-0016"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Intelligent Transportation Systems","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/A5043539737","display_name":"Xianghu Meng","orcid":"https://orcid.org/0000-0002-2010-5841"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xianghu Meng","raw_affiliation_strings":["Ministry of Education Key Laboratory of Measurement and Control of Complex Engineering Systems, Southeast University, Nanjing, China"],"affiliations":[{"raw_affiliation_string":"Ministry of Education Key Laboratory of Measurement and Control of Complex Engineering Systems, Southeast University, Nanjing, China","institution_ids":["https://openalex.org/I76569877"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100696862","display_name":"Jun Li","orcid":"https://orcid.org/0000-0002-5272-9130"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jun Li","raw_affiliation_strings":["Ministry of Education Key Laboratory of Measurement and Control of Complex Engineering Systems, Southeast University, Nanjing, China"],"affiliations":[{"raw_affiliation_string":"Ministry of Education Key Laboratory of Measurement and Control of Complex Engineering Systems, Southeast University, Nanjing, China","institution_ids":["https://openalex.org/I76569877"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102220146","display_name":"Xianzhong Dai","orcid":null},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xianzhong Dai","raw_affiliation_strings":["Ministry of Education Key Laboratory of Measurement and Control of Complex Engineering Systems, Southeast University, Nanjing, China"],"affiliations":[{"raw_affiliation_string":"Ministry of Education Key Laboratory of Measurement and Control of Complex Engineering Systems, Southeast University, Nanjing, China","institution_ids":["https://openalex.org/I76569877"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101843262","display_name":"Jianping Dou","orcid":"https://orcid.org/0000-0001-7465-2034"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jianping Dou","raw_affiliation_strings":["School of Mechanical Engineering, Southeast University, Nanjing, China"],"affiliations":[{"raw_affiliation_string":"School of Mechanical Engineering, Southeast University, Nanjing, China","institution_ids":["https://openalex.org/I76569877"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5043539737"],"corresponding_institution_ids":["https://openalex.org/I76569877"],"apc_list":null,"apc_paid":null,"fwci":6.4299,"has_fulltext":false,"cited_by_count":82,"citation_normalized_percentile":{"value":0.96802088,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"19","issue":"4","first_page":"1018","last_page":"1026"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9991999864578247,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9966999888420105,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8784340620040894},{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.6981240510940552},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.6168756484985352},{"id":"https://openalex.org/keywords/colored","display_name":"Colored","score":0.5852099657058716},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.579275369644165},{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.57154381275177},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.560279905796051},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5552736520767212},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5306495428085327},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.510125458240509},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49226418137550354},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.4486614465713501},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.442468523979187},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.43724802136421204},{"id":"https://openalex.org/keywords/nearest-neighbour-algorithm","display_name":"Nearest neighbour algorithm","score":0.4256395101547241},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.4162607789039612},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39021235704421997},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.30778536200523376},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.19978371262550354}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8784340620040894},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.6981240510940552},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.6168756484985352},{"id":"https://openalex.org/C2778307483","wikidata":"https://www.wikidata.org/wiki/Q5149038","display_name":"Colored","level":2,"score":0.5852099657058716},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.579275369644165},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.57154381275177},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.560279905796051},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5552736520767212},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5306495428085327},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.510125458240509},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49226418137550354},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.4486614465713501},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.442468523979187},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.43724802136421204},{"id":"https://openalex.org/C184879717","wikidata":"https://www.wikidata.org/wiki/Q1374523","display_name":"Nearest neighbour algorithm","level":3,"score":0.4256395101547241},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.4162607789039612},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39021235704421997},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.30778536200523376},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.19978371262550354},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"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/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tits.2017.2706720","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tits.2017.2706720","pdf_url":null,"source":{"id":"https://openalex.org/S144771191","display_name":"IEEE Transactions on Intelligent Transportation Systems","issn_l":"1524-9050","issn":["1524-9050","1558-0016"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Intelligent Transportation Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.699999988079071,"id":"https://metadata.un.org/sdg/11"}],"awards":[{"id":"https://openalex.org/G1129330169","display_name":null,"funder_award_id":"BK20161427","funder_id":"https://openalex.org/F4320322769","funder_display_name":"Natural Science Foundation of Jiangsu Province"},{"id":"https://openalex.org/G1794076854","display_name":null,"funder_award_id":"61374069","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G450398396","display_name":null,"funder_award_id":"51575108","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G7802480523","display_name":null,"funder_award_id":"61374148","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320322769","display_name":"Natural Science Foundation of Jiangsu Province","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W141805818","https://openalex.org/W187767610","https://openalex.org/W1965969360","https://openalex.org/W1973770389","https://openalex.org/W1987283446","https://openalex.org/W1989432959","https://openalex.org/W2002730737","https://openalex.org/W2006236904","https://openalex.org/W2007442224","https://openalex.org/W2010334716","https://openalex.org/W2013348860","https://openalex.org/W2016653941","https://openalex.org/W2037938479","https://openalex.org/W2061594663","https://openalex.org/W2062361991","https://openalex.org/W2067732008","https://openalex.org/W2073288620","https://openalex.org/W2077144156","https://openalex.org/W2083115206","https://openalex.org/W2086453346","https://openalex.org/W2096305430","https://openalex.org/W2105293629","https://openalex.org/W2106378689","https://openalex.org/W2119217175","https://openalex.org/W2125171869","https://openalex.org/W2135181410","https://openalex.org/W2149368520","https://openalex.org/W2150572822","https://openalex.org/W2157943411","https://openalex.org/W2172264744","https://openalex.org/W2314579004","https://openalex.org/W6607571859","https://openalex.org/W6668666529"],"related_works":["https://openalex.org/W4376138746","https://openalex.org/W4220987199","https://openalex.org/W2171568915","https://openalex.org/W2361554335","https://openalex.org/W8433631","https://openalex.org/W1984036937","https://openalex.org/W2033053473","https://openalex.org/W2093665022","https://openalex.org/W1595757466","https://openalex.org/W2033851048"],"abstract_inverted_index":{"A":[0,113,186],"colored":[1],"traveling":[2,13],"salesman":[3,14,21],"problem":[4,40,80],"(CTSP)":[5],"is":[6,22,84,117,131,177,208,216,226],"a":[7,24,56,85,136,172,191],"generalization":[8,86],"of":[9,78,87,109,124,143,201],"the":[10,39,46,79,88,92,103,121,149,155,159,183,198,202,211,219,223],"well-known":[11],"multiple":[12],"problem.":[15],"In":[16],"our":[17],"prior":[18,160],"CTSP,":[19,59],"each":[20,28,67],"allocated":[23],"particular":[25],"color":[26,48,115],"and":[27,94,97,190,205,218],"city,":[29],"carrying":[30],"1,":[31],"2,":[32],"or":[33],"all":[34,72,127],"salesmen's":[35,73],"colors":[36,63,74],"depending":[37],"on":[38],"types,":[41],"allows":[42],"any":[43],"salesmen":[44],"with":[45,106],"same":[47],"to":[49,71,101,119,126,154,181,196,230],"visit":[50],"exactly":[51],"once.":[52],"This":[53],"paper":[54,134],"presents":[55,135],"more":[57],"common":[58],"in":[60],"which":[61],"city":[62,68,114,187],"are":[64,194],"diverse,":[65],"i.e.,":[66,91],"has":[69],"one":[70],"while":[75],"other":[76],"elements":[77],"keeps":[81],"unchanged.":[82],"It":[83],"existing":[89],"CTSPs,":[90],"radial":[93],"serial":[95],"ones,":[96],"can":[98,163],"be":[99,164],"used":[100],"model":[102],"scheduling":[104],"problems":[105],"different":[107],"accessibility":[108,122],"jobs":[110],"toward":[111],"executors.":[112],"matrix":[116],"introduced":[118,195],"describe":[120],"difference":[123],"cities":[125],"salesmen.":[128],"Since":[129],"CTSP":[130],"NP-hard,":[132],"this":[133],"variable":[137],"neighborhood":[138,199],"search":[139],"(VNS)":[140],"approach,":[141],"instead":[142],"computationally":[144],"intractable":[145],"exact":[146],"solutions.":[147],"First,":[148],"repetitive":[150],"solution":[151,204],"space":[152,200],"due":[153],"dual-chromosome":[156],"encoding":[157],"for":[158,210],"genetic":[161],"algorithms":[162],"entirely":[165],"avoided":[166],"by":[167,179],"using":[168],"direct-route":[169],"encoding.":[170],"Then,":[171],"two-stage":[173],"greedy":[174],"initialization":[175],"algorithm":[176],"utilized":[178],"VNS":[180,225],"generate":[182],"initial":[184],"solution.":[185],"removal":[188],"mechanism":[189],"reinsertion":[192],"operation":[193],"change":[197],"current":[203],"2-opt":[206],"method":[207],"adopted":[209],"local":[212],"search.":[213],"Extensive":[214],"simulation":[215],"conducted":[217],"results":[220],"show":[221],"that":[222],"proposed":[224],"an":[227],"efficient":[228],"heuristics":[229],"solve":[231],"CTSP.":[232]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":13},{"year":2021,"cited_by_count":18},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}