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...