A genetic algorithm on inventory routing problem
Yükleniyor...
Dosyalar
Tarih
2014
Yazarlar
Aydın, Nevin
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
EMAJ
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
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.
Açıklama
Anahtar Kelimeler
Inventory routing problem, Genetic algorithm
Kaynak
Emerging Markets Journal
WoS Q Değeri
Scopus Q Değeri
Cilt
3
Sayı
3
Künye
Aydın, N. (2014). A Genetic Algorithm on Inventory Routing Problem. EMAJ: Emerging Markets Journal, 3(3), 59–66.
