{"id":"https://openalex.org/W2054495636","doi":"https://doi.org/10.1109/icnc.2012.6234747","title":"The continuous selective generalized traveling salesman problem: An efficient ant colony system","display_name":"The continuous selective generalized traveling salesman problem: An efficient ant colony system","publication_year":2012,"publication_date":"2012-05-01","ids":{"openalex":"https://openalex.org/W2054495636","doi":"https://doi.org/10.1109/icnc.2012.6234747","mag":"2054495636"},"language":"en","primary_location":{"id":"doi:10.1109/icnc.2012.6234747","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2012.6234747","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 8th International Conference on Natural Computation","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/A5045241871","display_name":"Mou Lian-ming","orcid":null},"institutions":[{"id":"https://openalex.org/I4210117337","display_name":"Neijiang Normal University","ror":"https://ror.org/02bc8tz70","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210117337"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Mou Lian-Ming","raw_affiliation_strings":["School of Mathematics and Information Science, Key Laboratory of Numerical Simulation of Sichuan Province, Neijiang Normal University, Neijiang, China","School of Mathematics and Information Science//Key Laboratory of Numerical Simulation of Sichuan Province, Neijiang Normal University, 641100, China"],"affiliations":[{"raw_affiliation_string":"School of Mathematics and Information Science, Key Laboratory of Numerical Simulation of Sichuan Province, Neijiang Normal University, Neijiang, China","institution_ids":["https://openalex.org/I4210117337"]},{"raw_affiliation_string":"School of Mathematics and Information Science//Key Laboratory of Numerical Simulation of Sichuan Province, Neijiang Normal University, 641100, China","institution_ids":["https://openalex.org/I4210117337"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5045241871"],"corresponding_institution_ids":["https://openalex.org/I4210117337"],"apc_list":null,"apc_paid":null,"fwci":0.857,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.79077835,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"18","issue":null,"first_page":"1242","last_page":"1246"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9991999864578247,"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.9991999864578247,"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.9952999949455261,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9864000082015991,"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.9804055690765381},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6481523513793945},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6444036364555359},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6370014548301697},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6243062615394592},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.5264407396316528},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.4458405375480652},{"id":"https://openalex.org/keywords/extremal-optimization","display_name":"Extremal optimization","score":0.43222135305404663},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.431861937046051},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3029484450817108},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.2539565861225128},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.04960468411445618}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9804055690765381},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6481523513793945},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6444036364555359},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6370014548301697},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6243062615394592},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.5264407396316528},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.4458405375480652},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.43222135305404663},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.431861937046051},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3029484450817108},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2539565861225128},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.04960468411445618},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnc.2012.6234747","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2012.6234747","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 8th International Conference on Natural Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W108694910","https://openalex.org/W180214381","https://openalex.org/W1492852957","https://openalex.org/W1801390969","https://openalex.org/W1801849579","https://openalex.org/W2008656089","https://openalex.org/W2018269848","https://openalex.org/W2023947722","https://openalex.org/W2070484240","https://openalex.org/W2081878758","https://openalex.org/W2089196696","https://openalex.org/W2150367356","https://openalex.org/W2150455295","https://openalex.org/W2154929945","https://openalex.org/W2163428398","https://openalex.org/W2164188042","https://openalex.org/W2166166917","https://openalex.org/W2996586376","https://openalex.org/W6629532490","https://openalex.org/W6638374120","https://openalex.org/W6682418992"],"related_works":["https://openalex.org/W3001379520","https://openalex.org/W2549218906","https://openalex.org/W2146364482","https://openalex.org/W3013791021","https://openalex.org/W2123233098","https://openalex.org/W2133004095","https://openalex.org/W1604040598","https://openalex.org/W4246557197","https://openalex.org/W2191054341","https://openalex.org/W2972533512"],"abstract_inverted_index":{"The":[0],"Generalized":[1,26],"Traveling":[2,9,27],"Salesman":[3,10,28],"Problem":[4,11,29],"(GTSP)":[5],"extends":[6],"the":[7,32,41,49,62,66,82,85,95,101,106],"classical":[8],"(TSP)":[12],"and":[13,31,64,105],"has":[14],"many":[15],"interesting":[16],"applications.":[17],"In":[18],"this":[19,78],"paper":[20],"we":[21,47],"propose":[22],"a":[23,37,70],"Continuous":[24],"Selective":[25],"(CSGTSP),":[30],"existing":[33],"GTSP":[34],"is":[35,75,111],"only":[36],"special":[38],"case":[39],"of":[40,68,84],"CSGTSP.":[42,57,86],"To":[43],"solving":[44],"it":[45],"effectively,":[46],"extend":[48],"ant":[50],"colony":[51],"system":[52],"method":[53,79,97],"from":[54],"TSP":[55],"to":[56,59,81],"Meanwhile,":[58],"speed":[60],"up":[61],"convergence":[63],"improve":[65],"quality":[67],"solution,":[69],"constrained":[71],"local":[72,108],"searching":[73,109],"technique":[74,110],"introduced":[76],"into":[77],"according":[80],"characteristic":[83],"Experimental":[87],"results":[88],"on":[89],"numerous":[90],"TSPLIB":[91],"instances":[92],"show":[93],"that":[94],"proposed":[96],"can":[98],"deal":[99],"with":[100],"CSGTSP":[102],"fairly":[103],"well,":[104],"developed":[107],"significantly":[112],"effective.":[113]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}