A Genetic Algorithm on Inventory Routing Problem

• Main Author: Nevin Aydın
• Format: Article
• Language: English
• Published: University Library System, University of Pittsburgh 2014-03-01
• Series: Emerging Markets Journal
• Online Access: http://emaj.pitt.edu/ojs/index.php/emaj/article/view/31

Inventory routing problem can be defined as forming the routes to serve to the retailers from the manufacturer, deciding on the quantity of the shipment to the retailers and deciding on the timing of the replenishments. The difference of inventory routing problems from vehicle routing problems is the consideration of the inventory positions of retailers and supplier, and making the decision accordingly. Inventory routing problems are complex in nature and they can be solved either theoretically or using a heuristics method. Metaheuristics is an emerging class of heuristics that can be applied to combinatorial optimization problems. In this paper, we provide the relationship between vendor-managed inventory and inventory routing problem. The proposed genetic for solving vehicle routing problem is described in detail.