IDEAS home Printed from https://ideas.repec.org/a/ids/ijsoma/v37y2020i3p407-425.html
   My bibliography  Save this article

Ant lion optimisation algorithm for two stage supply chain network associated with fixed charges

Author

Listed:
  • P. Manimaran
  • M.K. Marichelvam

Abstract

In this paper, an effective ant lion optimisation (ALO) algorithm is proposed for two stage supply chain network associated with fixed charge transportation problem (FCTP) which is strongly NP-hard. In a FCTP, fixed cost is incurred for every route, along with the variable cost that is proportional to the amount shipped. In some circumstances, the variable cost is associated with quadratic variables in which the cost function will be nonlinear. The aim of this paper is to determine the least cost transportation plan that minimises the total variable and fixed costs while satisfying the supply and demand requirements of each plant and customer. The performance of the proposed ALO is compared in terms of total cost with other algorithms addressed in the literature such as genetic algorithm, simulated annealing and ant colony optimisation. The computational results reveal that the proposed ALO provides better solutions.

Suggested Citation

  • P. Manimaran & M.K. Marichelvam, 2020. "Ant lion optimisation algorithm for two stage supply chain network associated with fixed charges," International Journal of Services and Operations Management, Inderscience Enterprises Ltd, vol. 37(3), pages 407-425.
    • Handle: RePEc:ids:ijsoma:v:37:y:2020:i:3:p:407-425
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=111035
    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:ijsoma:v:37:y:2020:i:3:p:407-425. 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=150 .

    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.