IDEAS home Printed from https://ideas.repec.org/a/ids/ijisen/v22y2016i2p121-144.html
   My bibliography  Save this article

An optimal model of dynamic lot-sizing with transportation decision and an improved ACO algorithm

Author

Listed:
  • Yingjun Li
  • Zhixiang Chen

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.

Suggested Citation

  • Yingjun Li & Zhixiang Chen, 2016. "An optimal model of dynamic lot-sizing with transportation decision and an improved ACO algorithm," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 22(2), pages 121-144.
    • Handle: RePEc:ids:ijisen:v:22:y:2016:i:2:p:121-144
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=73959
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijisen:v:22:y:2016:i:2:p:121-144. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=188 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.