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

Abstract This paper introduces the multi-depot open location routing problem (MD-OLRP) with a heterogeneous fixed fleet. The is inspired by collection of company which collects raw materials from different suppliers coordinating several carriers. Each carrier has Moreover, there cost for contracting each vehicle and variable associated distance traveled. empty haul return to vehicles depot not ...

Solving the Inventory Location-Routing Problem can been seen as an approach to optimize both a supply chain design and its operations costs. Assumptions consider that vehicles might visit more than one retailer per route and that inventory management decisions are included for a multi-depot, multi-retailer system with storage capacity over a discrete time planning horizon. The problem is to det...

A approximation algorithm for an optimization problem runs in polynomial time for all instances and is guaranteed to deliver solutions with bounded optimality gap. We derive such algorithms for different variants of capacitated location routing, an important generalization of vehicle routing where the cost of opening the depots from which vehicles operate is taken into account. Our results orig...

Privacy is needed in ad hoc networks. In order to provide anonymous routing protocol in MANETs the location of source and destination can be concealed by using “notify and go” mechanism and broadcasting. In this paper, we address some of the issues arising in MANETs by using an anonymous routing protocol. Location Based Anonymous Routing Protocol partitions the network into zones for anonymity ...

in a logistic system, decisions on location of depot, vehicle routing and assignment of routes to vehicles should be considered simultaneously. the location-routing problems are defined to find the optimal number and locations of depots, and at the same time with the distribution routes for the vehicles. because of the complexity and the time consuming computation, this problem belongs to a cla...