A capacitated location-routing problem (CLRP) is one of the new areas of research in distribution management. It consists of two problems; locating of facilities and routing of the vehicle with a specific capacity. The purpose of the CLRP is to open a set of stores, allocate customers to established deposits, and then design vehicle tours in order to minimize the total cost. In this paper, a ne...

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

Due to the recent worries about environment, transportation companies are incentivized use Alternative Fuel Vehicles (AFVs) instead of conventional ones. However, due limited AFV driving range and since Stations (AFSs) usually not widespread on territory, routes AFVs have be properly planned in order prevent them from remaining without sufficient fuel reach depot or closest station. The Green V...

Amongst the most important features of supply chain management are those related to interconnecting various companies within a supply network. While the performance of these interconnections is greatly influenced by information technology and information management we still face another important issue regarding logistics performance which is transportation, routing, and network design. In this...

The Capacitated Vehicle Routing problem is a generalization of the Traveling Salesman problem in which a set of clients must be visited by a collection of capacitated tours. Each tour can visit at most Q clients and must start and end at a specified depot. We present the first approximation scheme for Capacitated Vehicle Routing for non-Euclidean metrics. Specifically we give a quasi-polynomial...

We present a general framework for modeling routing problems based on formulating them as a traditional location problem called the Capacitated Concentrator Location Problem. We apply this framework to two classical routing problems: the Capacitated Vehicle Routing Problem and Inventory-Routing Problem. In the former case, the heuristic is proven to be asymptotically optimal for any distributio...