In any supply chain, distribution planning of products is of great importance to managers. With effective and flexible distribution planning, mangers can increase the efficiency of time, place, and delivery utility of whole supply chain. In this paper, inventory routing problem (IRP) is applied to distribution planning of perishable products in a supply chain. The studied supply chain is compos...

This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...

This study introduces a green location, routing and inventory problem with customer satisfaction, backup distribution centers and risk of routes in the form of a non-linear mixed integer programming model. In this regard, time window is considered to increase the customer satisfaction of the model and transportation risks is taken into account for the reliability of the system. In addition, dif...

An integrated supply chain operational planning system is a tool that is used to jointly optimize several planning decisions by capturing the additional bene ts of coordination between sequential activities in the chain. In recent years, many companies have set up an integrated planning system and achieved multi-million cost savings. The key to success is an application that is not only able to...

We address the combined problem of allocating a scarce resource among several locations, and planning deliveries using a fleet of vehicles. Demands are random, and holding and shortage costs must be considered in the decision along with transportation costs. We show how to extend some of the available methods for the deterministic vehicle routing problem to this case. Computational results usin...

We consider an application of the inventory routing problem. A fleet of vehicles is devoted to collecting a single product from geographically dispersed sites. Each site has its own accumulation rate and stock capacity. On each visit, the vehicle empties the stock. At the tactical level, the objective is to minimize the fleet size and an estimate of the distance travelled. Moreover, for practic...

We analyze three queueing control problems that model a dynamic stochastic distribution system, where a single capacitated vehicle serves a finite number of retailers in a make-to-stock fashion. The objective in each of these vehicle routing and inventory problems is to minimize the long run average inventory (holding and backordering) and transportation cost. In all three problems, the control...

We solve a rich logistical problem inspired from practice, in which a heterogeneous xed eet of vehicles is used for collecting recyclable waste from large containers over a nite planning horizon. Each container is equipped with a sensor, which communicates its level at the start of the day. Given a history of observations, a forecasting model is used to estimate the point demand forecasts as we...