![]() Changaival, Boonyarit ![]() ![]() in GECCO '20: Genetic and Evolutionary Computation Conference, Companion Volume, Cancún, Mexico, July 8-12, 2020 (2020) Detailed reference viewed: 131 (22 UL)![]() Samir Labib, Nader ![]() ![]() in Samir Labib, Nader; Danoy, Grégoire; Musial, Jedrzej (Eds.) et al 9th ACM Symposium on Design and Analysis of Intelligent Vehicular Networks and Applications (DIVANet '19) (2019, November) Over the recent years, Unmanned Aerial Vehicles' (UAVs) technology developed rapidly. In turn shedding light on a wide range of potential civil and commercial applications ranging from mapping and ... [more ▼] Over the recent years, Unmanned Aerial Vehicles' (UAVs) technology developed rapidly. In turn shedding light on a wide range of potential civil and commercial applications ranging from mapping and surveillance, parcel delivery to more demanding ones that require UAVs to operate in heterogeneous swarms. However, with the great advantages UAVs bring, they are expected to soon dominate the shared, low-altitude airspace over populated cities, introducing multiple new research challenges in safely managing the unprecedented traffic demands. The main contribution of this work is addressing the complex problem of UAV traffic management at an abstract level by proposing a structure for the uncontrolled low-altitude airspace. The paper proposes a model of the airspace as a weighted multilayer network of nodes and airways and presents a set of experimental simulations of UAV traffic for the verification and validation of the model. Finally, the paper outlines our intended future work. [less ▲] Detailed reference viewed: 287 (58 UL)![]() ; Kieffer, Emmanuel ![]() ![]() in Foundations of Computing and Decision Sciences (2019) Detailed reference viewed: 113 (19 UL)![]() ; ; Pecero, Johnatan ![]() in International Journal of Applied Mathematics and Computer Science (2016), 26 Internet shopping has been one of the most common online activities, carried out by millions of users every day. As the number of available offers grows, the difficulty in getting the best one among all ... [more ▼] Internet shopping has been one of the most common online activities, carried out by millions of users every day. As the number of available offers grows, the difficulty in getting the best one among all the shops increases as well. In this paper we propose an integer linear programming (ILP) model and two heuristic solutions, the MinMin algorithm and the cellular processing algorithm, to tackle the Internet shopping optimization problem with delivery costs. The obtained results improve those achieved by the state-of-the-art heuristics, and for small real case scenarios ILP delivers exact solutions in a reasonable amount of time. [less ▲] Detailed reference viewed: 142 (5 UL) |
||