{"id":"https://openalex.org/W3187594464","doi":"https://doi.org/10.1109/cec45853.2021.9504975","title":"Fast Heuristics for Traveling Salesman Problems with Multiple Flying Sidekicks","display_name":"Fast Heuristics for Traveling Salesman Problems with Multiple Flying Sidekicks","publication_year":2021,"publication_date":"2021-06-28","ids":{"openalex":"https://openalex.org/W3187594464","doi":"https://doi.org/10.1109/cec45853.2021.9504975","mag":"3187594464"},"language":"en","primary_location":{"id":"doi:10.1109/cec45853.2021.9504975","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec45853.2021.9504975","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Congress on Evolutionary Computation (CEC)","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/A5031002887","display_name":"Gustavo Delazeri","orcid":"https://orcid.org/0000-0001-9439-3113"},"institutions":[{"id":"https://openalex.org/I130442723","display_name":"Universidade Federal do Rio Grande do Sul","ror":"https://ror.org/041yk2d64","country_code":"BR","type":"education","lineage":["https://openalex.org/I130442723"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Gustavo Delazeri","raw_affiliation_strings":["Instituto de Inform\u00e1tica, Universidade Federal do Rio Grande do Sul, Porto Alegre, Brazil"],"affiliations":[{"raw_affiliation_string":"Instituto de Inform\u00e1tica, Universidade Federal do Rio Grande do Sul, Porto Alegre, Brazil","institution_ids":["https://openalex.org/I130442723"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086717490","display_name":"Marcus Ritt","orcid":"https://orcid.org/0000-0001-7894-1634"},"institutions":[{"id":"https://openalex.org/I130442723","display_name":"Universidade Federal do Rio Grande do Sul","ror":"https://ror.org/041yk2d64","country_code":"BR","type":"education","lineage":["https://openalex.org/I130442723"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Marcus Ritt","raw_affiliation_strings":["Instituto de Inform\u00e1tica, Universidade Federal do Rio Grande do Sul, Porto Alegre, Brazil"],"affiliations":[{"raw_affiliation_string":"Instituto de Inform\u00e1tica, Universidade Federal do Rio Grande do Sul, Porto Alegre, Brazil","institution_ids":["https://openalex.org/I130442723"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5031002887"],"corresponding_institution_ids":["https://openalex.org/I130442723"],"apc_list":null,"apc_paid":null,"fwci":0.593,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.73422485,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1365","last_page":"1371"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9983999729156494,"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.9983999729156494,"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/T12288","display_name":"Optimization and Search Problems","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12546","display_name":"Smart Parking Systems Research","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.8495088219642639},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.8128631114959717},{"id":"https://openalex.org/keywords/drone","display_name":"Drone","score":0.7989335656166077},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7207502126693726},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6204625964164734},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5790749788284302},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5229374170303345},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5098930597305298},{"id":"https://openalex.org/keywords/truck","display_name":"Truck","score":0.5079799294471741},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.5026969909667969},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47335028648376465},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.4258878231048584},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.39833855628967285},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.15559867024421692},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1464809775352478},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10293987393379211},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.10081478953361511}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8495088219642639},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8128631114959717},{"id":"https://openalex.org/C59519942","wikidata":"https://www.wikidata.org/wiki/Q650665","display_name":"Drone","level":2,"score":0.7989335656166077},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7207502126693726},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6204625964164734},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5790749788284302},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5229374170303345},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5098930597305298},{"id":"https://openalex.org/C52121051","wikidata":"https://www.wikidata.org/wiki/Q43193","display_name":"Truck","level":2,"score":0.5079799294471741},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.5026969909667969},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47335028648376465},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.4258878231048584},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.39833855628967285},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.15559867024421692},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1464809775352478},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10293987393379211},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.10081478953361511},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec45853.2021.9504975","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec45853.2021.9504975","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5199999809265137,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1977319619","https://openalex.org/W2017708378","https://openalex.org/W2056295481","https://openalex.org/W2121863487","https://openalex.org/W2139688603","https://openalex.org/W2222122796","https://openalex.org/W2915338839","https://openalex.org/W2969952159","https://openalex.org/W3084064394","https://openalex.org/W4214717370","https://openalex.org/W6689051861","https://openalex.org/W6941249815"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W2359992618","https://openalex.org/W4376138746","https://openalex.org/W2362402143","https://openalex.org/W2361554335","https://openalex.org/W4220987199","https://openalex.org/W2189435634","https://openalex.org/W2592478754","https://openalex.org/W2055574289","https://openalex.org/W942307408"],"abstract_inverted_index":{"Speedy":[0],"delivery":[1,22,59],"of":[2,11,31,60,91],"products":[3],"is":[4,64],"important":[5],"for":[6,57,98,111,118],"customers":[7,49,67],"and":[8,27,50,79,101,128],"the":[9,12,58,73,87,143],"optimization":[10],"last":[13],"mile":[14],"has":[15,23,46],"particular":[16],"challenges.":[17],"In":[18,34,137],"recent":[19],"years":[20],"drone-supported":[21],"become":[24],"increasingly":[25],"feasible":[26],"therefore":[28],"a":[29,39,44,96,107,129],"topic":[30],"intense":[32],"research.":[33],"this":[35,99],"paper":[36],"we":[37,140],"address":[38],"traveling":[40],"salesman":[41],"problem":[42],"where":[43],"truck":[45,74],"to":[47,65,68,85,121,125,133],"serve":[48],"can":[51],"use":[52],"drones":[53,120],"as":[54],"flying":[55],"sidekicks":[56],"parcels.":[61],"The":[62],"goal":[63],"assign":[66],"be":[69],"either":[70],"served":[71],"by":[72,76],"or":[75],"some":[77],"drone":[78],"schedule":[80],"all":[81],"events":[82],"in":[83,152],"order":[84],"minimize":[86],"total":[88],"completion":[89],"time":[90],"whole":[92],"operation.":[93],"We":[94],"propose":[95],"heuristic":[97,117],"problem,":[100],"introduce":[102],"several":[103],"novel":[104],"components,":[105],"including":[106],"multi-armed":[108],"bandit":[109],"selection":[110],"partitioning":[112],"customers,":[113,122],"an":[114],"efficient":[115],"matching-based":[116],"assigning":[119],"local":[123],"searches":[124],"improve":[126],"solutions,":[127],"fast":[130],"greedy":[131],"scheduler":[132],"estimate":[134],"solution":[135],"quality.":[136],"computational":[138],"experiments":[139],"show":[141],"that":[142],"combined":[144],"approach":[145],"finds":[146],"better":[147],"solutions":[148],"than":[149],"current":[150],"methods,":[151],"less":[153],"time.":[154]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}