{"id":"https://openalex.org/W1982255473","doi":"https://doi.org/10.1109/icnc.2012.6234622","title":"A novel ant colony system for solving the one-commodity traveling salesman problem with selective pickup and delivery","display_name":"A novel ant colony system for solving the one-commodity traveling salesman problem with selective pickup and delivery","publication_year":2012,"publication_date":"2012-05-01","ids":{"openalex":"https://openalex.org/W1982255473","doi":"https://doi.org/10.1109/icnc.2012.6234622","mag":"1982255473"},"language":"en","primary_location":{"id":"doi:10.1109/icnc.2012.6234622","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2012.6234622","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":"Lian-Ming Mou","raw_affiliation_strings":["Key Laboratory of Numerical Simulation of Sichuan Province, Neijiang Normal University, China"],"affiliations":[{"raw_affiliation_string":"Key Laboratory of Numerical Simulation of Sichuan Province, Neijiang Normal University, China","institution_ids":["https://openalex.org/I4210117337"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071941602","display_name":"Xili Dai","orcid":"https://orcid.org/0000-0001-5526-8934"},"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":false,"raw_author_name":"Xi-Li Dai","raw_affiliation_strings":["College of Mathematics and Information Science, Neijiang Normal University, China"],"affiliations":[{"raw_affiliation_string":"College of Mathematics and Information Science, Neijiang Normal University, China","institution_ids":["https://openalex.org/I4210117337"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5045241871"],"corresponding_institution_ids":["https://openalex.org/I4210117337"],"apc_list":null,"apc_paid":null,"fwci":3.424,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.91643386,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"8","issue":null,"first_page":"1096","last_page":"1101"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9984999895095825,"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.9984999895095825,"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.998199999332428,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9674270153045654},{"id":"https://openalex.org/keywords/pickup","display_name":"Pickup","score":0.8704240918159485},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.6892427206039429},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.6431224346160889},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.6401465535163879},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6037006974220276},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5671627521514893},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5521202087402344},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5391069054603577},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.5130401849746704},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.5001287460327148},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33081334829330444},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21720030903816223}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9674270153045654},{"id":"https://openalex.org/C2776221269","wikidata":"https://www.wikidata.org/wiki/Q572648","display_name":"Pickup","level":3,"score":0.8704240918159485},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.6892427206039429},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.6431224346160889},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.6401465535163879},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6037006974220276},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5671627521514893},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5521202087402344},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5391069054603577},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.5130401849746704},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.5001287460327148},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33081334829330444},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21720030903816223},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"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/icnc.2012.6234622","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2012.6234622","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":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.6700000166893005}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W201772748","https://openalex.org/W314129576","https://openalex.org/W1967496036","https://openalex.org/W1980495840","https://openalex.org/W1986971574","https://openalex.org/W1991149726","https://openalex.org/W2031736545","https://openalex.org/W2046876986","https://openalex.org/W2072003508","https://openalex.org/W2091343503","https://openalex.org/W2150455295","https://openalex.org/W2154929945","https://openalex.org/W2166166917","https://openalex.org/W4210451910","https://openalex.org/W6610985388"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2359992618","https://openalex.org/W2361554335","https://openalex.org/W4220987199","https://openalex.org/W2171568915","https://openalex.org/W2362402143","https://openalex.org/W2265604726","https://openalex.org/W2033053473","https://openalex.org/W2277326438"],"abstract_inverted_index":{"The":[0,27],"one-commodity":[1,16],"traveling":[2,18],"salesman":[3,19],"problem":[4,20],"with":[5],"selective":[6],"pickup":[7],"and":[8,22,65,85],"delivery":[9],"(1-TSP-SELPD)":[10],"is":[11,29,90,113],"a":[12,86],"generalization":[13],"of":[14,59,82],"the":[15,41,45,57,61,76,80,83,117],"pickup-and-delivery":[17],"(1-PDTSP)":[21],"has":[23],"many":[24],"interesting":[25],"applications.":[26],"1-TSP-SELPD":[28],"known":[30],"to":[31,38,52,55,74,79,96,116],"be":[32],"an":[33],"NP-hard.":[34],"In":[35],"this":[36,72,94],"paper,":[37],"solve":[39],"effectively":[40],"1-TSP-SELPD,":[42,84],"we":[43],"extend":[44],"ant":[46],"colony":[47],"system":[48],"method":[49,73,95,112],"from":[50,105],"TSP":[51],"1-TSP-SELPD.":[53],"Meanwhile,":[54],"improve":[56],"quality":[58],"solution,":[60],"constrained":[62],"local":[63,100],"searching":[64,67],"neighborhood":[66],"technique":[68,89],"are":[69],"introduced":[70,92],"into":[71,93,99],"accelerate":[75],"convergence":[77],"according":[78],"characteristic":[81],"novel":[87],"mutation":[88],"also":[91],"avoid":[97],"falling":[98],"minima.":[101],"Experimental":[102],"results":[103],"gathered":[104],"extensive":[106],"simulations":[107],"confirm":[108],"that":[109],"our":[110],"proposed":[111],"significantly":[114],"superior":[115],"state-of-the-art":[118],"methods.":[119]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}