{"id":"https://openalex.org/W7125907793","doi":"https://doi.org/10.1109/smc58881.2025.11342740","title":"IPPA: Information-guided Pheromone Puzzle Algorithm for CTSP*","display_name":"IPPA: Information-guided Pheromone Puzzle Algorithm for CTSP*","publication_year":2025,"publication_date":"2025-10-05","ids":{"openalex":"https://openalex.org/W7125907793","doi":"https://doi.org/10.1109/smc58881.2025.11342740"},"language":null,"primary_location":{"id":"doi:10.1109/smc58881.2025.11342740","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc58881.2025.11342740","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-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/A5124102882","display_name":"Guo Li","orcid":null},"institutions":[{"id":"https://openalex.org/I28813325","display_name":"Civil Aviation University of China","ror":"https://ror.org/03je71k37","country_code":"CN","type":"education","lineage":["https://openalex.org/I28813325"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Guo Li","raw_affiliation_strings":["Civil Aviation University of China,College of Computer Science and Technology,Tianjin,China,300300"],"affiliations":[{"raw_affiliation_string":"Civil Aviation University of China,College of Computer Science and Technology,Tianjin,China,300300","institution_ids":["https://openalex.org/I28813325"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114100350","display_name":"Xiong Peng","orcid":null},"institutions":[{"id":"https://openalex.org/I28813325","display_name":"Civil Aviation University of China","ror":"https://ror.org/03je71k37","country_code":"CN","type":"education","lineage":["https://openalex.org/I28813325"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiong Peng","raw_affiliation_strings":["Civil Aviation University of China,College of Computer Science and Technology,Tianjin,China,300300"],"affiliations":[{"raw_affiliation_string":"Civil Aviation University of China,College of Computer Science and Technology,Tianjin,China,300300","institution_ids":["https://openalex.org/I28813325"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100339042","display_name":"Lili Liu","orcid":"https://orcid.org/0000-0003-2509-2362"},"institutions":[{"id":"https://openalex.org/I28813325","display_name":"Civil Aviation University of China","ror":"https://ror.org/03je71k37","country_code":"CN","type":"education","lineage":["https://openalex.org/I28813325"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lili Liu","raw_affiliation_strings":["Civil Aviation University of China,College of Transportation Science and Engineering,Tianjin,China,300300"],"affiliations":[{"raw_affiliation_string":"Civil Aviation University of China,College of Transportation Science and Engineering,Tianjin,China,300300","institution_ids":["https://openalex.org/I28813325"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100890097","display_name":"Jianli Ding","orcid":null},"institutions":[{"id":"https://openalex.org/I28813325","display_name":"Civil Aviation University of China","ror":"https://ror.org/03je71k37","country_code":"CN","type":"education","lineage":["https://openalex.org/I28813325"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jianli Ding","raw_affiliation_strings":["Civil Aviation University of China,College of Computer Science and Technology,Tianjin,China,300300"],"affiliations":[{"raw_affiliation_string":"Civil Aviation University of China,College of Computer Science and Technology,Tianjin,China,300300","institution_ids":["https://openalex.org/I28813325"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100626667","display_name":"Jing Li","orcid":"https://orcid.org/0000-0001-5139-938X"},"institutions":[{"id":"https://openalex.org/I28813325","display_name":"Civil Aviation University of China","ror":"https://ror.org/03je71k37","country_code":"CN","type":"education","lineage":["https://openalex.org/I28813325"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jing Li","raw_affiliation_strings":["Civil Aviation University of China,College of Computer Science and Technology,Tianjin,China,300300"],"affiliations":[{"raw_affiliation_string":"Civil Aviation University of China,College of Computer Science and Technology,Tianjin,China,300300","institution_ids":["https://openalex.org/I28813325"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5124102882"],"corresponding_institution_ids":["https://openalex.org/I28813325"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.70435517,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"4647","last_page":"4652"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.6985999941825867,"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.6985999941825867,"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.2451999932527542,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.00839999970048666,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8104000091552734},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6485999822616577},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5874000191688538},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.5740000009536743},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5210000276565552},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.4510999917984009},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.4196000099182129},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4189999997615814}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8104000091552734},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6485999822616577},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5874000191688538},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.5740000009536743},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5572999715805054},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5419999957084656},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5289999842643738},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5210000276565552},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.4510999917984009},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.4196000099182129},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4189999997615814},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4180999994277954},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4068000018596649},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40220001339912415},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.37439998984336853},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.3677000105381012},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.32179999351501465},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.2888999879360199},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.27140000462532043},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2637999951839447},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2554999887943268},{"id":"https://openalex.org/C138600008","wikidata":"https://www.wikidata.org/wiki/Q498144","display_name":"Christofides algorithm","level":4,"score":0.25360000133514404}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/smc58881.2025.11342740","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc58881.2025.11342740","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.724566638469696,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W976211528","https://openalex.org/W1801849579","https://openalex.org/W1978101274","https://openalex.org/W2007287649","https://openalex.org/W2013205100","https://openalex.org/W2054669984","https://openalex.org/W2107941094","https://openalex.org/W2154929945","https://openalex.org/W2471190594","https://openalex.org/W2564567964","https://openalex.org/W2735793097","https://openalex.org/W2753899746","https://openalex.org/W2775332123","https://openalex.org/W3003532379","https://openalex.org/W3112661916","https://openalex.org/W3113228261","https://openalex.org/W4285297595","https://openalex.org/W4406611910"],"related_works":[],"abstract_inverted_index":{"This":[0],"study":[1],"proposes":[2],"an":[3],"Information-guided":[4],"Pheromone":[5],"Puzzle":[6],"Algorithm":[7,78],"(IPPA)":[8],"to":[9,40,68,124,127],"address":[10],"the":[11,87,128,144],"Traveling":[12,89],"Salesman":[13,90],"Problem":[14,91],"(TSP)":[15],"with":[16,82],"enhanced":[17],"scalability,":[18],"convergence":[19],"speed,":[20],"and":[21,32,46,93,110,146,154],"solution":[22],"quality.":[23],"The":[24],"algorithm":[25,132],"integrates":[26],"spectral":[27],"clustering,":[28],"dynamic":[29],"pheromone":[30],"adjustment,":[31],"a":[33,75,80],"sliding":[34],"window":[35],"2-opt":[36],"local":[37,47],"optimization":[38],"strategy":[39],"improve":[41],"both":[42,152],"global":[43],"search":[44],"ability":[45],"refinement.":[48],"To":[49],"evaluate":[50],"its":[51],"performance,":[52],"extensive":[53],"experiments":[54,71],"are":[55,72],"conducted":[56],"on":[57,133],"eight":[58],"Euclidean":[59,115],"TSP":[60,156],"benchmark":[61,116],"datasets,":[62,117],"covering":[63],"city":[64],"sizes":[65],"from":[66],"50":[67],"700.":[69],"Comparative":[70],"performed":[73],"against":[74],"classical":[76],"Genetic":[77],"(GA),":[79],"GA":[81],"affinity":[83],"propagation":[84],"(AP)":[85],"for":[86,150],"Clustered":[88],"(CTSP),":[92],"five":[94],"representative":[95],"Ant":[96],"Colony":[97],"Optimization":[98],"(ACO)":[99],"algorithms.":[100],"Results":[101],"demonstrate":[102],"that":[103],"IPPA":[104,118,149],"consistently":[105],"achieves":[106],"superior":[107],"path":[108],"quality":[109],"faster":[111],"convergence.":[112],"Across":[113],"all":[114],"reduces":[119],"tour":[120],"length":[121],"by":[122],"0.18%":[123],"3.70%":[125],"compared":[126],"best":[129],"performing":[130],"baseline":[131],"each":[134],"instance,":[135],"while":[136],"maintaining":[137],"lower":[138],"computational":[139],"cost.":[140],"These":[141],"results":[142],"validate":[143],"effectiveness":[145],"efficiency":[147],"of":[148],"solving":[151],"small-scale":[153],"large-scale":[155],"instances.":[157]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2026-01-29T00:00:00"}