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

the capacitated vehicle routing problem (cvrp) is a well-known combinatorial optimization problem that holds a central place in logistics management. the vehicle routing is an applied task in the industrial transportation for which an optimal solution will lead us to better services, save more time and ultimately increase in customer satisfaction. this problem is classified into np-hard problem...

In this paper, we present a new mass-flow based Mixed Integer Linear Programming (MILP) formulation for the Inventory Routing Problem (IRP) with explicit energy consumption. The problem is based on a multiperiod single-vehicle IRP with one depot and several customers. Instead of minimizing the distance or inventory cost, the problem takes energy minimization as an objective. In this formulation...