Grouping genetic algorithms for a bi-objective inventory routing problem Online publication date: Wed, 29-Jan-2014
by Abdeljawed Sadok; Jacques Teghem; Habib Chabcoub
International Journal of Multicriteria Decision Making (IJMCDM), Vol. 3, No. 2/3, 2013
Abstract: Inventory routing problems (IRPs) is one of the versions of vehicle routing problems (VRPs), which retains the attention of the researchers. The main idea is to coordinate the distribution plan with the inventory management in a same model. The problem studied is to determine the multi-tours of a homogeneous fleet of vehicles covering a set of sales-points and minimising the distribution and inventory cost per hour. Of course no stock-outs are acceptable at the sales-points. In this paper, we analyse this problem like a bi-objective inventory routing problem in which the transportation cost and the delivery cost are considered separately. Two approaches are proposed to approximate the Pareto front of this bi-objective problem. Both methods are an adaptation of the hybrid grouping genetic algorithm (HGGA) that we proposed for the single objective problem in which a grouping genetic algorithm is combined with a local search. Computational experiments are reported using eight instances for four groups: (25, 50,100 and 200 sales points).
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Multicriteria Decision Making (IJMCDM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook