The location routing problem (LRP) integrates operational decisions on vehicle operations with strategic the of facilities or depots from which distribution will take place. In other words, it combines well-known (VRP) facility (FLP). Hence, LRP is an NP-hard combinatorial optimization problem, justifies use metaheuristic approaches whenever large-scale instances need to be solved. this paper, ...

The latency location routing problem (LLRP), a combination of the facility and cumulative capacitated vehicle problem, is recently proposed variant problems. It corresponds to customer-centric in which aim minimize sum arrival times at customers. This paper proposes three novel metaheuristic algorithms solve LLRP. They use simulated annealing framework, after each temperature reduction intensif...

Since mobile user mobility behaviors can vary according to time periods, e.g. office-going/closing and office hours, the location management traffic load for tracking user positions is also a function of time. The transient characteristics of location management traffic vary according to users' initial starting positions. In this paper, we propose a mobile user mobility model considering office...

We propose a new routing protocol suite composed of the Tapestry routing and location protocol over the IP routing protocol(TAP/IP) to increase the probability that a packet delivered by the routing layer will successfully reach it’s destination. This will benefit any transport layer, such as TCP, that uses timeouts to determine when it should retransmit packets. Tapestry is the routing/locatio...