increasing of the distribution efficiency is one of the most objectives of an integrated logistic system developed as a new management philosophy in the past few decades. the problem is examind in two parts: facilities location problem (flp) for long policies and vehicle routing problem (vrp) to meet the customer demand. these two components can be solved separately; however, this solution may ...

In this paper, we study the location routing problem with replenishment facilities (LRPRF), an extension of the location routing problem (LRP) where the vehicles can replenish at some replenishment facilities. Vehicles leave the depot with load on-board, serve customers until out of load, and then either return to a replenishment facility to reload or return to the depot, completing their route...

the capacitated location-routing problem (clrp) is a new research area in logistics and distribution management. this problem combines two difficult problems: the facility location problem (flp) and vehicle routing problem (vrp). the goal of the clrp is to open a subset of depots, assign the customers into open facilities, and then design vehicle tours in order to minimize the total cost. the t...

In this work we introduce a green inventory routing problem termed the Stochastic Inventory Routing Problem on Electric Roads (S-IRP-ER), in which hybrid vehicle navigates road network with charging opportunities some sections, to cover non-stationary stochastic demand of single product for set retailers network. We model using isochrone graphs represent real an graph nodes are located such tha...

A mixed 0-1 integer programming model of Combined Location Routing and Inventory Problem (CLRIP) with fuzzy random demand has been proposed in B2C E-commerce distribution environment. Demands of customers and distribution centers have been assumed to be fuzzy random variables.

In this article, we study an Inventory Routing Problem with deterministic customer demand in a two-tier supply chain. The chain network consists of supplier using single vehicle given capacity to deliver product type multiple customers. We are interested population-based algorithms solve our problem. A Memetic Algorithm (MA) is developed based on the Genetic (GA) and Variable Neighborhood Searc...