IDEAS home Printed from https://ideas.repec.org/a/igg/joris0/v8y2017i4p76-89.html
   My bibliography  Save this article

Multi-Objective Artificial Bee Colony Algorithm for Multi-Echelon Supply Chain Optimization Problem: An Indian Case Study

Author

Listed:
  • Mayank Gupta

    (Indian Institute of Technology, Department of Mechanical Engineering, Guwahati, India)

  • Anirban Kundu

    (Indian Institute of Technology, Department of Mechanical Engineering, Delhi, India)

  • Vipul Gupta

    (Haub School of Business, Saint Joseph's University, Philadelphia, PA, USA)

Abstract

Supply Chain Management has become an integrated part of today's industries. Advancement in technology in this field is the key to the successful operation of businesses. Many techniques and algorithms have a risen dealing with the challenging problems of present industry. In this paper, we have deployed an Artificial Bee Colony algorithm to solve a multi-echelon, multi-objective supply chain problem. Also, we have explained the working of the algorithm while applying it to our problem through various mathematical formulations to get a set of results.

Suggested Citation

  • Mayank Gupta & Anirban Kundu & Vipul Gupta, 2017. "Multi-Objective Artificial Bee Colony Algorithm for Multi-Echelon Supply Chain Optimization Problem: An Indian Case Study," International Journal of Operations Research and Information Systems (IJORIS), IGI Global, vol. 8(4), pages 76-89, October.
    • Handle: RePEc:igg:joris0:v:8:y:2017:i:4:p:76-89
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJORIS.2017100105
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:joris0:v:8:y:2017:i:4:p:76-89. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.