stochastic approach to vehicle routing problem: development and theories abstract in this article, a chance constrained (ccp) formulation of the vehicle routing problem (vrp) is proposed. the reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. knowing that reliable computer software for lar...

We establish a duality theory for a broad class of deterministic inventory control problems on continuous spaces that includes the classical joint replenishment problem and inventory routing. Using this theory, we establish the existence of an optimal policy, which has been an open question. We show how a primal-dual pair of infinite dimensional linear programs encode both cyclic and non-cyclic...

• A Multi-Vehicle Cyclic Inventory Routing Problem (MV-CIRP) is studied. MV-CIRP the extension of Single-Vehicle CIRP (SV-CIRP). mixed integer nonlinear programming model formulated. Simulated Annealing algorithm proposed to solve both SV-CIRP and MV-CIRP. This paper presents a new variant which aims determine subset customers be visited, appropriate number vehicles used, corresponding cycle ti...

In order to be competitive companies need to take advantage of synergetic interactions between different decision areas. Two of these are related to the distribution and inventory management processes. Inventory-Routing Problems (IRPs) arise when inventory and routing decisions must be taken simultaneously, which yields a difficult combinatorial optimization problem. In this paper, we propose a...

Logistic activities, from a certain point of view, are often structured around two concepts, the transportation of goods and the management of the same goods. Of course, these two activities are highly interlinked. It is possible to combine at the same time the problem of defining the amount of goods that have to be shipped (the Inventory Management problem – the quantity decision) and the rout...