Content Vol. 4 N 5, 2018

Pages 87 - 101

A Hybrid Ant Colony applied to Inventory Routing Problem; Noufissa Cheikh, Mohamed El Merouani; Inter. J. Acad. Stud.; 4(6):(2018)87-101

We focus our study on Inventory Routing Problem (IRP), one of the most important issues treated which dates back more than 30 years and is a well-known NP-hard problem and that involves the integration and coordination of inventory management and transportation. We consider a finite horizon where a fleet of capacitated homogeneous vehicles, housed at the warehouse, transports various products from the warehouse to meet the demand specified by the customers in each period. The demand for each product is stochastic and time varying and each customer request a distinct product. The inventory holding cost is product specific and is incurred at the customer sites. At the stage of considered planning, we have a dual purpose; minimizing the total transportation and inventory holding cost while ensuring each customer's demand is met over the planning horizon. So the problem is formulated as a mixed-integer programming (MIP) model, and we use the optimization methodology based on ant behaviors which named the Ant Colony Optimization (ACO). The proposed algorithm is coupled to a local search algorithm to improve the solutions generated by the ants.

Key words:
Routing Problem, Fleet, Ant Colony Optimization.

User login