Inventory routing optimisation using differential evolution with feasibility checking and local search Online publication date: Wed, 18-Sep-2019
by Hu Peng; Changshou Deng; Shunxu Peng
International Journal of Intelligent Information and Database Systems (IJIIDS), Vol. 12, No. 1/2, 2019
Abstract: The inventory routing problem (IRP) is to minimise inventory and transportation costs simultaneously for increasing profitability of the system. However, the two costs are conflicting in most case and hard to solve. As a promising evolutionary algorithm, differential evolution (DE) has been successfully applied to solve many real-world optimisation problems, but we found that it is not used to optimise the IRP. In this paper, for the first time, we utilise the DE algorithm to optimise the one-to-many IRP (DEIR) where a product is shipped from supplier to a set of retailers over a planning period. In the proposed DEIR algorithm, the solution feasible checking method, the local search method and the optimal routing method based on DE are designed to suit the IRP solving. The computational tests have been conducted on 50 benchmark instances. Experimental results and comparison with different parameter settings have proved that the proposed algorithm is competitive.
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 Intelligent Information and Database Systems (IJIIDS):
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