Record Details

A Genetic Algorithm on Inventory Routing Problem

Emerging Markets Journal

View Archive Info
 
 
Field Value
 
Title A Genetic Algorithm on Inventory Routing Problem
 
Creator Aydın, Nevin
 
Description 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.
 
Publisher University Library System, University of Pittsburgh
 
Contributor Inventory routing problem, genetic algorithm
 
Date 2014-03-05
 
Type info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
 
Format application/pdf
 
Identifier http://emaj.pitt.edu/ojs/index.php/emaj/article/view/31
10.5195/emaj.2014.31
 
Source EMAJ: Emerging Markets Journal; Vol 3, No 3 (2014); 59-66
2158-8708
2159-242X
 
Language eng
 
Relation http://emaj.pitt.edu/ojs/index.php/emaj/article/view/31/205