This article proposes a stochastic vehicle routing problem within the frame-wok of chance constrained programming where one or more parameters are presumed to be random variables with known distribution function. 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 ...

Motivated by the fixed routes problem, where the objective is to design a set of routes to be operated unchanged over a period of time, we study the vehicle routing problem with stochastic demands. An algorithm is developed based on a stochastic programming model with recourse. Computational experiments show that the algorithm compares favorably to existing algorithms. This research was support...

O objetivo deste estudo é desenvolver uma solução para o problema de distribuição proposto pelos jogos matemáticos 2017-2018, organizado conjuntamente pela Federação Francesa Jogos Matemáticos e Empresa Modelagem Matemática. Conhecido na literatura como um produção-estoque-distribuição-roteamento (PIDRP), este otimização combinatória NP-difícil, ainda pouco explorado literatura. Esta pesquisa b...

The article presents a study on a biobjective generalization of the inventory routing problem, an important optimization problem found in logistical networks in which aspects of inventory management and vehicle routing intersect. A compact solution representation and a heuristic optimization approach are presented, and experimental investigations involving novel benchmark instances are carried ...

The Inventory Routing Problem (IRP) involves the distribution of one or more products from a supplier to a set of customers over a discrete planning horizon. The version treated here, the so-called Vendor Managed Inventory Routing Problem (VMIRP), is the Inventory Routing problem arising when the replenishment policy is decided a priori. We consider two replenishment policies. The first is know...

In the stochastic and dynamic multi-stage vehicle routing problem, a set of vehicles collectively transports and services demands which require service at multiple spatially separated locations. Arrival times and service locations of individual demands are not known until the demand’s arrival, and vehicles are assumed to have infinite capacity and to travel with bounded velocity. The objective ...