The two-echelon location routing problem (2E-LRP) arises in freight distribution when goods available at different origins are delivered to their respective destinations via intermediate facilities. literature concerning the 2E-LRP considers capacities of vehicles be scalars, while customer demands additive volumes individual items. However, ignoring real dimensions items and can lead infeasibl...

In this work, a two-echelon location-routing problem with time windows and transportation resource sharing (2E-LRPTWTRS) is solved by selecting facility locations optimizing vehicle routes. The optimal solutions improve the efficiency of logistics network based on geographical distribution service facilities customers. Furthermore, utilization maximized enabling strategies within among differen...

The Capacitated Location-Routing Problem (CLRP) is a NP-hard problem since it generalizes two well known NP-hard problems: the Capacitated Facility Location Problem (CFLP) and the Capacitated Vehicle Routing Problem (CVRP). The Multi-Depot Vehicle Routing Problem (MDVRP) is known to be a NP-hard since it is a generalization of the well known Vehicle Routing Problem (VRP), arising with one depot...

We present an information theoretic analysis of the minimum routing overhead incurred for reliable routing of packets using location-based routing. We formulate the minimum routing overhead problem as a rate-distortion problem and derive a lower bound on the minimum routing overhead incurred. We also characterize the deficit in transport capacity caused by the routing overheads. It is observed ...