Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Daniel Schermer"'
Publikováno v:
Networks. 76:164-186
Publikováno v:
Computers & Operations Research. 109:134-158
With the goal of integrating drones in last-mile delivery, the Vehicle Routing Problem with Drones (VRPD) uses a fleet of vehicles, each of them equipped with a set of drones, for serving a set of customers with minimal makespan. In this paper, we pr
Publikováno v:
Transportation Research Part C: Emerging Technologies. 106:166-204
In this work, we are interested in studying the Vehicle Routing Problem with Drones (VRPD). Given a fleet of trucks, where each truck carries a given number of drones, the objective consists in designing feasible routes and drone operations such that
Publikováno v:
HICSS
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9783030218027
WCGO
WCGO
In this paper, we introduce the Traveling Salesman Drone Station Location Problem (TSDSLP). The TSDSLP exhibits features of the Traveling Salesman, Facility Location, and Parallel Machine Scheduling problems. More precisely, given a truck located at
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7c4a6e64f3c296be51aebd1fa8f15ada
https://doi.org/10.1007/978-3-030-21803-4_111
https://doi.org/10.1007/978-3-030-21803-4_111
Autor:
Daniel Schermer
Publikováno v:
Operations Research Proceedings ISBN: 9783030184995
OR
OR
Recently, there has been a surge of interest, from both practitioners and academic researchers, that concerns the utilization of drones for civil applications. In this work, we are interested in studying the Vehicle Routing Problem with Drones (VRPD)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8688d3b780a52271b9254628171712fc
https://doi.org/10.1007/978-3-030-18500-8_3
https://doi.org/10.1007/978-3-030-18500-8_3
Publikováno v:
Intelligent Information and Database Systems ISBN: 9783319754161
ACIIDS (1)
ACIIDS (1)
The Vehicle Routing Problem (VRP) and its variants are well-studied problems in Operations Research. They are related to many real-world applications. Recently, several companies like Amazon, UPS, and Deutsche Post AG showed interest in the integrati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c1a5710f8459783110df6366c3b29f86
https://doi.org/10.1007/978-3-319-75417-8_33
https://doi.org/10.1007/978-3-319-75417-8_33
Publikováno v:
Computational Science and Its Applications – ICCSA 2017 ISBN: 9783319623948
ICCSA (2)
ICCSA (2)
In this paper, we are interested in a recent variant of the Traveling Salesman Problem (TSP) in which the Knapsack Problem (KP) is integrated. In the literature, this problem is called Traveling Thief Problem (TTP). Interested by the inherent computa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::825c3d75d4bb77dd850624049f8626a6
https://doi.org/10.1007/978-3-319-62395-5_45
https://doi.org/10.1007/978-3-319-62395-5_45
Publikováno v:
SSCI
The Art Gallery Problem (AGP) is one of the classic problems in Computational Geometry. For a given art gallery, represented by a polygon, the AGP seeks for the minimum number of guards that are necessary for overseeing the entire polygon. Many varia