{"id":"https://openalex.org/W3175058681","doi":"https://doi.org/10.1145/3449639.3459342","title":"Ants can solve the parallel drone scheduling traveling salesman problem","display_name":"Ants can solve the parallel drone scheduling traveling salesman problem","publication_year":2021,"publication_date":"2021-06-21","ids":{"openalex":"https://openalex.org/W3175058681","doi":"https://doi.org/10.1145/3449639.3459342","mag":"3175058681"},"language":"en","primary_location":{"id":"doi:10.1145/3449639.3459342","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3449639.3459342","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},"type":"conference-paper","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/A5019169378","display_name":"Quoc Trung Dinh","orcid":null},"institutions":[{"id":"https://openalex.org/I4210124651","display_name":"Phenikaa University","ror":"https://ror.org/03anxx281","country_code":"VN","type":"education","lineage":["https://openalex.org/I4210124651"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Quoc Trung Dinh","raw_affiliation_strings":["Phenikaa University, Ha Dong, Hanoi, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Phenikaa University, Ha Dong, Hanoi, Vietnam","institution_ids":["https://openalex.org/I4210124651"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100539709","display_name":"Duc Dong","orcid":null},"institutions":[{"id":"https://openalex.org/I67868205","display_name":"VNU University of Science","ror":"https://ror.org/05w54hk79","country_code":"VN","type":"education","lineage":["https://openalex.org/I177233841","https://openalex.org/I67868205"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Duc Dong Do","raw_affiliation_strings":["VNU University of Engineering and Technlology, Cau Giay, Hanoi, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"VNU University of Engineering and Technlology, Cau Giay, Hanoi, Vietnam","institution_ids":["https://openalex.org/I67868205"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084304036","display_name":"Minh Ho\u00e0ng H\u00e0","orcid":"https://orcid.org/0000-0002-9923-6309"},"institutions":[{"id":"https://openalex.org/I4210124651","display_name":"Phenikaa University","ror":"https://ror.org/03anxx281","country_code":"VN","type":"education","lineage":["https://openalex.org/I4210124651"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Minh Ho\u00e0ng H\u00e0","raw_affiliation_strings":["Phenikaa University, Ha Dong, Hanoi, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Phenikaa University, Ha Dong, Hanoi, Vietnam","institution_ids":["https://openalex.org/I4210124651"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.91,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.9731323,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"14","last_page":"21"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9993000030517578,"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.9993000030517578,"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/T11133","display_name":"UAV Applications and Optimization","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9810000061988831,"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.8657029867172241},{"id":"https://openalex.org/keywords/drone","display_name":"Drone","score":0.822192907333374},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6961828470230103},{"id":"https://openalex.org/keywords/trips-architecture","display_name":"TRIPS architecture","score":0.6845105886459351},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6667604446411133},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6067960858345032},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5851122736930847},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5408111214637756},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.5218916535377502},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4654432535171509},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.44851332902908325},{"id":"https://openalex.org/keywords/truck","display_name":"Truck","score":0.4482979476451874},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.33260926604270935},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.19309639930725098},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18694791197776794},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.16750529408454895},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.13602164387702942},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11456352472305298},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09107539057731628}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8657029867172241},{"id":"https://openalex.org/C59519942","wikidata":"https://www.wikidata.org/wiki/Q650665","display_name":"Drone","level":2,"score":0.822192907333374},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6961828470230103},{"id":"https://openalex.org/C157085824","wikidata":"https://www.wikidata.org/wiki/Q2384809","display_name":"TRIPS architecture","level":2,"score":0.6845105886459351},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6667604446411133},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6067960858345032},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5851122736930847},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5408111214637756},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.5218916535377502},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4654432535171509},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.44851332902908325},{"id":"https://openalex.org/C52121051","wikidata":"https://www.wikidata.org/wiki/Q43193","display_name":"Truck","level":2,"score":0.4482979476451874},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.33260926604270935},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.19309639930725098},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18694791197776794},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.16750529408454895},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.13602164387702942},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11456352472305298},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09107539057731628},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3449639.3459342","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3449639.3459342","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","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":20,"referenced_works":["https://openalex.org/W602203297","https://openalex.org/W1543940176","https://openalex.org/W1554727768","https://openalex.org/W1575445408","https://openalex.org/W1977319619","https://openalex.org/W2011093339","https://openalex.org/W2090435272","https://openalex.org/W2118051273","https://openalex.org/W2146987494","https://openalex.org/W2148673189","https://openalex.org/W2154929945","https://openalex.org/W2245682929","https://openalex.org/W2883417042","https://openalex.org/W2905789584","https://openalex.org/W2915338839","https://openalex.org/W2963421154","https://openalex.org/W3009770767","https://openalex.org/W3101957802","https://openalex.org/W3119167717","https://openalex.org/W4255673994"],"related_works":["https://openalex.org/W4385871958","https://openalex.org/W1611875833","https://openalex.org/W1997193297","https://openalex.org/W4245157707","https://openalex.org/W1547053391","https://openalex.org/W2908391583","https://openalex.org/W2369428395","https://openalex.org/W1521781013","https://openalex.org/W2981400081","https://openalex.org/W1975009952"],"abstract_inverted_index":{"In":[0],"this":[1],"work,":[2],"we":[3,167],"are":[4,18,38],"interested":[5],"in":[6,156],"studying":[7],"the":[8,36,56,62,66,79,89,111,118,123,139,148,150],"parallel":[9],"drone":[10],"scheduling":[11],"traveling":[12],"salesman":[13],"problem":[14],"(PDSTSP),":[15],"where":[16],"deliveries":[17],"split":[19],"between":[20,46],"a":[21,24,31,49,70,93,97,104,115,127],"truck":[22,29,119],"and":[23,43,48,120,162],"fleet":[25],"of":[26,64,99,158,175],"drones.":[27,124],"The":[28,51],"performs":[30],"common":[32],"delivery":[33],"tour,":[34],"while":[35],"drones":[37],"forced":[39],"to":[40,54,61,77,109,136],"perform":[41],"back":[42,60],"forth":[44],"trips":[45,121],"customers":[47],"depot.":[50],"objective":[52],"is":[53,83,107],"minimize":[55],"completion":[57],"time":[58,161],"coming":[59],"depot":[63],"all":[65,100],"vehicles.":[67],"We":[68,125],"present":[69],"hybrid":[71],"ant":[72],"colony":[73],"optimization":[74],"(HACO)":[75],"metaheuristic":[76],"solve":[78,138],"problem.":[80,140],"Our":[81],"algorithm":[82,152],"based":[84],"on":[85,144],"an":[86],"idea":[87],"from":[88,147],"literature":[90],"that":[91],"represents":[92],"PDSTSP":[94],"solution":[95,163],"as":[96],"permutation":[98],"customers.":[101],"And":[102],"then":[103],"dynamic":[105,129],"programming":[106,130],"used":[108],"decompose":[110],"customer":[112],"sequence":[113],"into":[114],"tour":[116],"for":[117,122],"propose":[126],"new":[128,170],"combined":[131],"with":[132],"other":[133],"problem-tailored":[134],"components":[135],"efficiently":[137],"When":[141],"being":[142],"tested":[143],"benchmark":[145],"instances":[146,177],"literature,":[149],"HACO":[151],"outperforms":[153],"state-of-the-art":[154],"algorithms":[155],"terms":[157],"both":[159],"running":[160],"quality.":[164],"More":[165],"remarkably,":[166],"find":[168],"23":[169],"best":[171],"known":[172],"solutions":[173],"out":[174],"90":[176],"considered.":[178]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}