The inventory routing problems (IRP) is an important component of Supply Chain Management. The IRP refers to the coordination of the inventory management and transportation. The solution in IRP gives the optimum vehicle routing while at the same time minimizes the transportation and inventory costs. The problem addressed is of the many-to-one type with finite horizon, multi-periods, multi-suppliers, single assembly plant, where a fleet of capacitated identical vehicles, housed at a depot, transport parts from the suppliers to meet the demand specified by the assembly plant for each period. We propose a hybrid genetic algorithm based on allocation first, route second method to determine an optimal inventory and transportation policy that minimizes the total cost. We introduce two new representations and design corresponding crossover and mutation operators. It is found that a simple representation produces very encouraging results.
[1]
Helena Ramalhinho Dias Lourenço,et al.
Inventory-Routing Model, for a Multi-Period Problem with Stochastic and Deterministic Demand
,
2003
.
[2]
Maged Dessouky,et al.
A genetic algorithm approach to the integrated inventory-distribution problem
,
2006
.
[3]
Richard T. Wong,et al.
An Integrated Inventory Allocation and Vehicle Routing Problem
,
1989,
Transp. Sci..
[4]
Saïd Salhi,et al.
Inventory routing problems: a logistical overview
,
2007,
J. Oper. Res. Soc..
[5]
Awi Federgruen,et al.
A Combined Vehicle Routing and Inventory Allocation Problem
,
1984,
Oper. Res..