{"id":"https://openalex.org/W4313825608","doi":"https://doi.org/10.3390/a16010040","title":"Solving the Parallel Drone Scheduling Traveling Salesman Problem via Constraint Programming","display_name":"Solving the Parallel Drone Scheduling Traveling Salesman Problem via Constraint Programming","publication_year":2023,"publication_date":"2023-01-08","ids":{"openalex":"https://openalex.org/W4313825608","doi":"https://doi.org/10.3390/a16010040"},"language":"en","primary_location":{"id":"doi:10.3390/a16010040","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a16010040","pdf_url":"https://www.mdpi.com/1999-4893/16/1/40/pdf?version=1674010354","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/16/1/40/pdf?version=1674010354","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017492288","display_name":"Roberto Montemanni","orcid":"https://orcid.org/0000-0002-0229-0465"},"institutions":[{"id":"https://openalex.org/I122346577","display_name":"University of Modena and Reggio Emilia","ror":"https://ror.org/02d4c4y02","country_code":"IT","type":"education","lineage":["https://openalex.org/I122346577"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Roberto Montemanni","raw_affiliation_strings":["Department of Sciences and Methods for Engineering, University of Modena and Reggio Emilia, Via Amendola 2, 42122 Reggio Emilia, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Sciences and Methods for Engineering, University of Modena and Reggio Emilia, Via Amendola 2, 42122 Reggio Emilia, Italy","institution_ids":["https://openalex.org/I122346577"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086489073","display_name":"Mauro Dell\u2019Amico","orcid":"https://orcid.org/0000-0002-3283-6131"},"institutions":[{"id":"https://openalex.org/I122346577","display_name":"University of Modena and Reggio Emilia","ror":"https://ror.org/02d4c4y02","country_code":"IT","type":"education","lineage":["https://openalex.org/I122346577"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Mauro Dell\u2019Amico","raw_affiliation_strings":["Department of Sciences and Methods for Engineering, University of Modena and Reggio Emilia, Via Amendola 2, 42122 Reggio Emilia, Italy","Interdepartmental Center En&Tech, University of Modena and Reggio Emilia, Capannone 19 Tecnopolo, Piazza Europa 1, 42122 Reggio Emilia, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Sciences and Methods for Engineering, University of Modena and Reggio Emilia, Via Amendola 2, 42122 Reggio Emilia, Italy","institution_ids":["https://openalex.org/I122346577"]},{"raw_affiliation_string":"Interdepartmental Center En&Tech, University of Modena and Reggio Emilia, Capannone 19 Tecnopolo, Piazza Europa 1, 42122 Reggio Emilia, Italy","institution_ids":["https://openalex.org/I122346577"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5017492288"],"corresponding_institution_ids":["https://openalex.org/I122346577"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":5.9745,"has_fulltext":true,"cited_by_count":30,"citation_normalized_percentile":{"value":0.96210209,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":"16","issue":"1","first_page":"40","last_page":"40"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9990000128746033,"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.9990000128746033,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9927999973297119,"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"}},{"id":"https://openalex.org/T11133","display_name":"UAV Applications and Optimization","score":0.9926000237464905,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9459949135780334},{"id":"https://openalex.org/keywords/drone","display_name":"Drone","score":0.818806529045105},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7173120975494385},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6467068791389465},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6432248950004578},{"id":"https://openalex.org/keywords/truck","display_name":"Truck","score":0.6039649248123169},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.5712249875068665},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5500687956809998},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.5189711451530457},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.48967745900154114},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4732052683830261},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.45048049092292786},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.4475581645965576},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4405501186847687},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4254128932952881},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16379493474960327},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.1552637219429016},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.12848788499832153},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11998122930526733},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.10308590531349182},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.10188287496566772},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08120471239089966}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9459949135780334},{"id":"https://openalex.org/C59519942","wikidata":"https://www.wikidata.org/wiki/Q650665","display_name":"Drone","level":2,"score":0.818806529045105},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7173120975494385},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6467068791389465},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6432248950004578},{"id":"https://openalex.org/C52121051","wikidata":"https://www.wikidata.org/wiki/Q43193","display_name":"Truck","level":2,"score":0.6039649248123169},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.5712249875068665},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5500687956809998},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.5189711451530457},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.48967745900154114},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4732052683830261},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.45048049092292786},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.4475581645965576},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4405501186847687},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4254128932952881},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16379493474960327},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.1552637219429016},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.12848788499832153},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11998122930526733},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.10308590531349182},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.10188287496566772},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08120471239089966},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a16010040","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a16010040","pdf_url":"https://www.mdpi.com/1999-4893/16/1/40/pdf?version=1674010354","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:iris.unimore.it:11380/1295146","is_oa":true,"landing_page_url":"https://hdl.handle.net/11380/1295146","pdf_url":"https://iris.unimore.it/bitstream/11380/1295146/2/algorithms-16-00040-v2.pdf","source":{"id":"https://openalex.org/S4306400718","display_name":"IRIS UNIMORE (University of Modena and Reggio Emilia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122346577","host_organization_name":"University of Modena and Reggio Emilia","host_organization_lineage":["https://openalex.org/I122346577"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:doaj.org/article:a8100c6b05bd43d0b94a820ffc3a1898","is_oa":true,"landing_page_url":"https://doaj.org/article/a8100c6b05bd43d0b94a820ffc3a1898","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 16, Iss 1, p 40 (2023)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/16/1/40/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a16010040","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 16; Issue 1; Pages: 40","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a16010040","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a16010040","pdf_url":"https://www.mdpi.com/1999-4893/16/1/40/pdf?version=1674010354","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.8199999928474426}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4313825608.pdf"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1975378161","https://openalex.org/W1977319619","https://openalex.org/W2100014562","https://openalex.org/W2163428398","https://openalex.org/W2296673577","https://openalex.org/W2792557859","https://openalex.org/W2883417042","https://openalex.org/W2986174455","https://openalex.org/W3009770767","https://openalex.org/W3038182563","https://openalex.org/W3162839318","https://openalex.org/W3172588403","https://openalex.org/W3175058681","https://openalex.org/W3182067109","https://openalex.org/W3197830882","https://openalex.org/W3200703255","https://openalex.org/W4225797003","https://openalex.org/W4289080106","https://openalex.org/W4291109519"],"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/W8433631"],"abstract_inverted_index":{"Drones":[0],"are":[1],"currently":[2],"seen":[3],"as":[4,27,162],"a":[5,42,47,52,55,75,132,149],"viable":[6],"way":[7],"of":[8,12,44,57,62,89,122],"improving":[9],"the":[10,34,60,64,71,80,87,94,99,112,123,127,138,163],"distribution":[11],"parcels":[13],"in":[14,21,98],"urban":[15],"and":[16,54,85,104],"rural":[17],"environments,":[18],"while":[19],"working":[20],"coordination":[22],"with":[23,59,157],"traditional":[24],"vehicles,":[25],"such":[26,161],"trucks.":[28],"In":[29],"this":[30],"paper,":[31],"we":[32],"consider":[33],"parallel":[35],"drone":[36],"scheduling":[37],"traveling":[38,158],"salesman":[39,159],"problem,":[40,81],"where":[41],"set":[43],"customers":[45],"requiring":[46],"delivery":[48],"is":[49],"split":[50],"between":[51],"truck":[53],"fleet":[56],"drones,":[58],"aim":[61],"minimizing":[63],"total":[65],"time":[66,115],"required":[67,116],"to":[68,101,110,117,130],"serve":[69,118],"all":[70,137],"customers.":[72],"We":[73,107],"propose":[74],"constraint":[76,145],"programming":[77,146],"model":[78],"for":[79,120,126,136,153],"discuss":[82],"its":[83],"implementation":[84],"present":[86],"results":[88,142],"an":[90],"experimental":[91],"program":[92],"on":[93],"instances":[95,124,139],"previously":[96],"cited":[97],"literature":[100],"validate":[102],"exact":[103],"heuristic":[105],"algorithms.":[106],"were":[108],"able":[109],"decrease":[111],"cost":[113],"(the":[114],"customers)":[119],"some":[121],"and,":[125],"first":[128],"time,":[129],"provide":[131],"demonstrated":[133],"optimal":[134],"solution":[135],"considered.":[140],"These":[141],"show":[143],"that":[144],"can":[147],"be":[148],"very":[150],"effective":[151],"tool":[152],"attacking":[154],"optimization":[155],"problems":[156],"components,":[160],"one":[164],"discussed.":[165]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":11},{"year":2024,"cited_by_count":12},{"year":2023,"cited_by_count":5}],"updated_date":"2026-04-17T18:11:37.981687","created_date":"2023-01-09T00:00:00"}