Showing 1 - 10 of 429
Persistent link: https://www.econbiz.de/10012243822
Persistent link: https://www.econbiz.de/10011503238
In this paper we propose an efficient solving method based on a parallel scatter search algorithm that accelerates the search time to solve the minmax regret location problem. The algorithm was applied in the context of emergency management to locate emergency vehicles stations. A discrete event...
Persistent link: https://www.econbiz.de/10012042964
Persistent link: https://www.econbiz.de/10012132517
Persistent link: https://www.econbiz.de/10011805323
We propose a large neighborhood search (LNS) algorithm to solve the periodic location routing problem (PLRP). The PLRP … combines location and routing decisions over a planning horizon in which customers require visits according to a given …
Persistent link: https://www.econbiz.de/10011190772
Routing Problem by considering the existence of multiple available depots and a time window which must not be violated, that … they call the Multi-Depot Vehicle Routing Problem with Time Window (MDVRPTW), and with respecting a set of criteria …
Persistent link: https://www.econbiz.de/10012042726
. Routing, being most critical issue in their implementation. The dynamic network conditions impose setbacks in the selection of … optimal path. There is exigent requirement to tackle these routing issues in context of these networks. In this paper, the …
Persistent link: https://www.econbiz.de/10012042943
Wireless Sensor Networks (WSNs) became omnipresent in our daily life. As a result, they have emerged as a fruitful research topic, because of their advantages, especially their low cost and easy deployment. However, these attractive merits imply that available resources, especially energy, in...
Persistent link: https://www.econbiz.de/10012043258
nodes, that this new way of routing will help facing a lot of attacks based on sniffing, and other type of attacks like DoS. …
Persistent link: https://www.econbiz.de/10012043375