![]() Samir Labib, Nader ![]() ![]() ![]() in Sensors (2019), 19(21), 22 The rapid adoption of Internet of Things (IoT) has encouraged the integration of new connected devices such as Unmanned Aerial Vehicles (UAVs) to the ubiquitous network. UAVs promise a pragmatic solution ... [more ▼] The rapid adoption of Internet of Things (IoT) has encouraged the integration of new connected devices such as Unmanned Aerial Vehicles (UAVs) to the ubiquitous network. UAVs promise a pragmatic solution to the limitations of existing terrestrial IoT infrastructure as well as bring new means of delivering IoT services through a wide range of applications. Owning to their potential, UAVs are expected to soon dominate the low-altitude airspace over populated cities. This introduces new research challenges such as the safe management of UAVs operation under high traffic demands. This paper proposes a novel way of structuring the uncontrolled, low-altitude airspace, with the aim of addressing the complex problem of UAV traffic management at an abstract level. The work, hence, introduces a model of the airspace as a weighted multilayer network of nodes and airways and presents a set of experimental simulation results using three UAV traffic management heuristics. [less ▲] Detailed reference viewed: 258 (51 UL)![]() Changaival, Boonyarit ![]() ![]() in Proceedings of the Genetic and Evolutionary Computation Conference (2019) Detailed reference viewed: 192 (17 UL)![]() Guzek, Mateusz ![]() ![]() ![]() in IEEE Cloud Computing (2015), 2(2), Detailed reference viewed: 284 (29 UL)![]() ; Bouvry, Pascal ![]() in 4OR: a quarterly journal of operations research (2014), 12(4), 403-406 In Blazewich et al. (4OR-Q J Oper Res 12(1):35–48, 2014), an Internet shopping problem with price-sensitive discounts was introduced, in which a customer wants to buy a given set of products in a given ... [more ▼] In Blazewich et al. (4OR-Q J Oper Res 12(1):35–48, 2014), an Internet shopping problem with price-sensitive discounts was introduced, in which a customer wants to buy a given set of products in a given set of Internet shops. This problem is an extension of the original Internet shopping optimization problem (ISOP) presented in Blazewich et al. (Int J Appl Math Comput Sci 20(2):385–390, 2010). For each Internet shop, standard prices for the products are given as well as a concave increasing discounting function of the total standard and delivery price. The problem is to buy all the required products at the minimum total discounted price. Among other results, approximability issues were shortly discussed. This note extends this discussion and corrects a flaw in Blazewich et al. (4OR-Q J Oper Res 12(1):35–48, 2014). [less ▲] Detailed reference viewed: 132 (4 UL)![]() ; Bouvry, Pascal ![]() in 4OR: a quarterly journal of operations research (2014), 12(1), 35-48 A customer would like to buy a given set of products in a given set of Internet shops. For each Internet shop, standard prices for the products are known as well as a concave increasing discounting ... [more ▼] A customer would like to buy a given set of products in a given set of Internet shops. For each Internet shop, standard prices for the products are known as well as a concave increasing discounting function of total standard and delivery price. The problem is to buy all the required products at the minimum total discounted price. Computational complexity of various special cases is established. Properties of optimal solutions are proved and polynomial time and exponential time solution algorithms based on these properties are designed. Two heuristic algorithms are suggested and computationally tested. [less ▲] Detailed reference viewed: 144 (2 UL)![]() Musial, Jedrzej ![]() Doctoral thesis (2013) Detailed reference viewed: 81 (2 UL) |
||