One of the important aspects of distribution optimization problems is simultaneously, controlling the inventory while devising the best vehicle routing, which is a famous problem, called inventory-routing problem (IRP). When the lot-sizing decisions are jointed with IRP, the problem will get more complicated called production inventory-routing problem (PIRP). To become closer to the real life p...

Although evolutionary algorithms have often been used to address VRPs and VRPTWs [1], applications to other routing problems such as period routing and inventory routing are less common. In this paper, a versatile hybrid evolutionary algorithm is developed that can be used for cyclic inventory routing and a variety of capacitated and periodic vehicle routing problems. First, a random insertion ...

<p style='text-indent:20px;'>The Multi-Product Inventory-Location-Routing Problem with heterogeneous fleet considers a supply chain, which comprises multiple producers, potential distribution centers (DCs) opening capacity levels and geographically scattered retailers each of has deterministic demand over discrete planning horizon. The goal is determining set DCs their to open, assigning ...

Two types of decisions that directly affect the performance of a distribution system is the vehicle routing and inventory assignment. These problems have been studied separately for many years. The inventory routing problem (IRP) is integration of above mentioned distribution problems. In the other words, IRP assumes each customer maintains a local inventory of a product and consumes a certain ...

Distribution network design (DND) attempts to integrate tactical issues such as inventory policies and/or vehicle routing decisions with strategic ones such as the problem of locating facilities and allocate customers to such facilities. When inventory policy decision making is considered the problem is also known as inventory location modelling (ILM) problem. During the last two decades, mathe...