An optimal model of dynamic lot-sizing with transportation decision and an improved ACO algorithm
by Yingjun Li; Zhixiang Chen
International Journal of Industrial and Systems Engineering (IJISE), Vol. 22, No. 2, 2016

Abstract: In this paper, an optimal model of multi-item single-level dynamic lot-sizing considering transportation decision in manufacturing system is studied. In the model, it is assumed that the freight cost is proportional to the number of containers, and the objective is to minimise total cost of the setup cost, holding cost and freight cost. Since the model is a mixed integer programming and it is a NP hard problem. An improved ant colony optimisation (ACO) algorithm is proposed. The algorithm is the trade-off between the solution quality and computational time. The computational result shows that the proposed algorithm is feasible and efficient based on solution quality and computation time compared with Lingo optimisation software. Computation examples show that the algorithm has advantage over software Lingo11.

Online publication date: Thu, 31-Dec-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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