Abstract
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.
Highlights
Introduction and MotivationRecently, inventory routing issues face a great deal of attention, because it is seen as a prosperous function of logistics and inventory management
The mechanisms of genetic algorithm are outlined in this research
One of the future research direction is to determine the fitness function since the fitness function that correctly reflects the value of the solution is vital in genetic algorithms
Summary
New articles in this journal are licensed under a Creative Commons Attribution 3.0 United States License. This journal is published by the University Library System of the University of Pittsburgh as part of its D-Scribe Digital Publishing Program, and is cosponsored by the University of Pittsburgh Press. Volume 3 No 3 (2014) | ISSN 2158-8708 (online) | DOI 10.5195/emaj.2014.31 | http://emaj.pitt.edu
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
