IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v204y2018icp214-226.html
   My bibliography  Save this article

A two-stage supply chain problem with fixed costs: An ant colony optimization approach

Author

Listed:
  • Hong, Jiangtao
  • Diabat, Ali
  • Panicker, Vinay V.
  • Rajagopalan, Sridharan

Abstract

This paper focuses on a distribution-allocation problem in a two-stage supply chain with fixed costs. The problem is intended to determine a supply chain configuration of manufacturing plants, distributors, and retailers in the distribution network. The problem is formulated as an integer-programming model. The mathematical model incorporates unit transportation costs between entities and two types of fixed costs, including fixed cost for transportation routes and fixed cost for opening facilities. The objective of the model is to minimise the total costs of supply chain operation incurred in allocating the retailers to a distribution centre and the distribution centres to a manufacturing plant. An Ant Colony Optimization (ACO)-based heuristic is developed for solving the model. The heuristic is tested on various problem sizes generated. All the problem instances are solved using solver LINGO to evaluate the robustness of the ACO-based algorithm. The ACO-based heuristic emerges as a computationally efficient algorithm. Solutions can be obtained using the ACO-based heuristic within a reasonable computational time with a gap of about 10% on average from the optimal solutions.

Suggested Citation

  • Hong, Jiangtao & Diabat, Ali & Panicker, Vinay V. & Rajagopalan, Sridharan, 2018. "A two-stage supply chain problem with fixed costs: An ant colony optimization approach," International Journal of Production Economics, Elsevier, vol. 204(C), pages 214-226.
    • Handle: RePEc:eee:proeco:v:204:y:2018:i:c:p:214-226
    DOI: 10.1016/j.ijpe.2018.07.019
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527318302846
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2018.07.019?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    References listed on IDEAS

    as
    1. Sun, Minghe & Aronson, Jay E. & McKeown, Patrick G. & Drinka, Dennis, 1998. "A tabu search heuristic procedure for the fixed charge transportation problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 441-456, April.
    2. Kowalski, Krzysztof & Lev, Benjamin, 2008. "On step fixed-charge transportation problem," Omega, Elsevier, vol. 36(5), pages 913-917, October.
    3. Qu, Wendy W. & Bookbinder, James H. & Iyogun, Paul, 1999. "An integrated inventory-transportation system with modified periodic policy for multiple products," European Journal of Operational Research, Elsevier, vol. 115(2), pages 254-269, June.
    4. Vidal, Carlos J. & Goetschalckx, Marc, 1997. "Strategic production-distribution models: A critical review with emphasis on global supply chain models," European Journal of Operational Research, Elsevier, vol. 98(1), pages 1-18, April.
    5. Roba W. Salem & Mohamed Haouari, 2017. "A simulation-optimisation approach for supply chain network design under supply and demand uncertainties," International Journal of Production Research, Taylor & Francis Journals, vol. 55(7), pages 1845-1861, April.
    6. Adlakha, Veena & Kowalski, Krzysztof & Vemuganti, R.R. & Lev, Benjamin, 2007. "More-for-less algorithm for fixed-charge transportation problems," Omega, Elsevier, vol. 35(1), pages 116-127, February.
    7. Conde, Eduardo, 2007. "Minmax regret location-allocation problem on a network under uncertainty," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1025-1039, June.
    8. Thanh, Phuong Nga & Bostel, Nathalie & Péton, Olivier, 2012. "A DC programming heuristic applied to the logistics network design problem," International Journal of Production Economics, Elsevier, vol. 135(1), pages 94-105.
    9. Garcia-Martinez, C. & Cordon, O. & Herrera, F., 2007. "A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP," European Journal of Operational Research, Elsevier, vol. 180(1), pages 116-148, July.
    10. Poorzahedy, Hossain & Rouhani, Omid M., 2007. "Hybrid meta-heuristic algorithms for solving network design problem," European Journal of Operational Research, Elsevier, vol. 182(2), pages 578-596, October.
    11. Adlakha, Veena & Kowalski, Krzysztof, 1999. "On the fixed-charge transportation problem," Omega, Elsevier, vol. 27(3), pages 381-388, June.
    12. Barnes-Schuster, Dawn & Bassok, Yehuda & Anupindi, Ravi, 2006. "Optimizing delivery lead time/inventory placement in a two-stage production/distribution system," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1664-1684, November.
    13. Socha, Krzysztof & Dorigo, Marco, 2008. "Ant colony optimization for continuous domains," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1155-1173, March.
    14. Chan, Felix T. S. & Chung, S. H. & Wadhwa, Subhash, 2005. "A hybrid genetic algorithm for production and distribution," Omega, Elsevier, vol. 33(4), pages 345-355, August.
    15. Adlakha, Veena & Kowalski, Krzysztof, 2003. "A simple heuristic for solving small fixed-charge transportation problems," Omega, Elsevier, vol. 31(3), pages 205-211, June.
    16. Jawahar, N. & Balaji, A.N., 2009. "A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge," European Journal of Operational Research, Elsevier, vol. 194(2), pages 496-537, April.
    17. Li, Hongyan & Hendry, Linda & Teunter, Ruud, 2009. "A strategic capacity allocation model for a complex supply chain: Formulation and solution approach comparison," International Journal of Production Economics, Elsevier, vol. 121(2), pages 505-518, October.
    18. V.P. Vinay & R. Sridharan, 2012. "Development and analysis of heuristic algorithms for a two-stage supply chain allocation problem with a fixed transportation cost," International Journal of Services and Operations Management, Inderscience Enterprises Ltd, vol. 12(2), pages 244-268.
    19. Seyed Mohsen Mousavi & Ardeshir Bahreininejad & S. Nurmaya Musa & Farazila Yusof, 2017. "A modified particle swarm optimization for solving the integrated location and inventory control problems in a two-echelon supply chain network," Journal of Intelligent Manufacturing, Springer, vol. 28(1), pages 191-206, January.
    20. K. Antony Arokia Durai Raj & Chandrasekharan Rajendran, 2009. "Fast heuristic algorithms to solve a single-stage Fixed-Charge Transportation Problem," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 6(3), pages 304-329.
    21. G. Kannan & P. Senthil & P. Sasikumar & V.P. Vinay, 2008. "A Nelder and Mead Methodology for Solving Small Fixed-Charge Transportation Problems," International Journal of Information Systems and Supply Chain Management (IJISSCM), IGI Global, vol. 1(4), pages 60-72, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Abdul Salam Khan & Qazi Salman Khalid & Khawar Naeem & Rafiq Ahmad & Razaullah Khan & Waqas Saleem & Catalin Iulian Pruncu, 2021. "Application of Exact and Multi-Heuristic Approaches to a Sustainable Closed Loop Supply Chain Network Design," Sustainability, MDPI, vol. 13(5), pages 1-25, February.
    2. Zoubida Benmamoun & Khaoula Khlie & Mohammad Dehghani & Youness Gherabi, 2024. "WOA: Wombat Optimization Algorithm for Solving Supply Chain Optimization Problems," Mathematics, MDPI, vol. 12(7), pages 1-61, April.
    3. Ahmed Mostafa & Kamal Moustafa & Raafat Elshaer, 2023. "Impact of Fixed Cost Increase on the Optimization of Two-Stage Sustainable Supply Chain Networks," Sustainability, MDPI, vol. 15(18), pages 1-15, September.
    4. Jahani, Hamed & Abbasi, Babak & Sheu, Jiuh-Biing & Klibi, Walid, 2024. "Supply chain network design with financial considerations: A comprehensive review," European Journal of Operational Research, Elsevier, vol. 312(3), pages 799-839.
    5. Shaoren Wang & Yenchun Jim Wu & Ruiting Li, 2022. "An Improved Genetic Algorithm for Location Allocation Problem with Grey Theory in Public Health Emergencies," IJERPH, MDPI, vol. 19(15), pages 1-18, August.
    6. José M. Ferrer & M. Teresa Ortuño & Gregorio Tirado, 2020. "A New Ant Colony-Based Methodology for Disaster Relief," Mathematics, MDPI, vol. 8(4), pages 1-23, April.
    7. Ovidiu Cosma & Petrică C. Pop & Cosmin Sabo, 2020. "An Efficient Hybrid Genetic Approach for Solving the Two-Stage Supply Chain Network Design Problem with Fixed Costs," Mathematics, MDPI, vol. 8(5), pages 1-20, May.
    8. Prajapati, Dhirendra & Pratap, Saurabh & Zhang, Mengdi & Lakshay, & Huang, George Q., 2022. "Sustainable forward-reverse logistics for multi-product delivery and pickup in B2C E-commerce towards the circular economy," International Journal of Production Economics, Elsevier, vol. 253(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Adlakha, Veena & Kowalski, Krzysztof & Wang, Simi & Lev, Benjamin & Shen, Wenjing, 2014. "On approximation of the fixed charge transportation problem," Omega, Elsevier, vol. 43(C), pages 64-70.
    2. Jawahar, N. & Balaji, A.N., 2009. "A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge," European Journal of Operational Research, Elsevier, vol. 194(2), pages 496-537, April.
    3. J R Montoya-Torres & A Aponte & P Rosas, 2011. "Applying GRASP to solve the multi-item three-echelon uncapacitated facility location problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(2), pages 397-406, February.
    4. A. N. Balaji & J. Mukund Nilakantan & Izabela Nielsen & N. Jawahar & S. G. Ponnambalam, 2019. "Solving fixed charge transportation problem with truck load constraint using metaheuristics," Annals of Operations Research, Springer, vol. 273(1), pages 207-236, February.
    5. Adlakha, Veena & Kowalski, Krzysztof & Lev, Benjamin, 2010. "A branching method for the fixed charge transportation problem," Omega, Elsevier, vol. 38(5), pages 393-397, October.
    6. Lev, Benjamin & Kowalski, Krzysztof, 2011. "Modeling fixed-charge problems with polynomials," Omega, Elsevier, vol. 39(6), pages 725-728, December.
    7. Mojtaba Akbari & Saber Molla-Alizadeh-Zavardehi & Sadegh Niroomand, 2020. "Meta-heuristic approaches for fixed-charge solid transportation problem in two-stage supply chain network," Operational Research, Springer, vol. 20(1), pages 447-471, March.
    8. Ma, Hong & Miao, Zhaowei & Lim, Andrew & Rodrigues, Brian, 2011. "Crossdocking distribution networks with setup cost and time window constraint," Omega, Elsevier, vol. 39(1), pages 64-72, January.
    9. V. Adlakha & K. Kowalski, 2015. "Fractional Polynomial Bounds for the Fixed Charge Problem," Journal of Optimization Theory and Applications, Springer, vol. 164(3), pages 1026-1038, March.
    10. Safaei, Mehdi, 2014. "An integrated multi-objective model for allocating the limited sources in a multiple multi-stage lean supply chain," Economic Modelling, Elsevier, vol. 37(C), pages 224-237.
    11. Kowalski, Krzysztof & Lev, Benjamin, 2008. "On step fixed-charge transportation problem," Omega, Elsevier, vol. 36(5), pages 913-917, October.
    12. Erika Buson & Roberto Roberti & Paolo Toth, 2014. "A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem," Operations Research, INFORMS, vol. 62(5), pages 1095-1106, October.
    13. Saleem Ramadan & Imad Ramadan, 2012. "Hybrid Two-Stage Algorithm for Solving Transportation Problem," Modern Applied Science, Canadian Center of Science and Education, vol. 6(4), pages 1-12, April.
    14. Ram Kumar P N, 2013. "On Modeling The Step Fixed-Charge Transportation Problem," Working papers 134, Indian Institute of Management Kozhikode.
    15. Adlakha, Veena & Kowalski, Krzysztof, 2003. "A simple heuristic for solving small fixed-charge transportation problems," Omega, Elsevier, vol. 31(3), pages 205-211, June.
    16. Gurwinder Singh & Amarinder Singh, 2021. "Solving fixed-charge transportation problem using a modified particle swarm optimization algorithm," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 12(6), pages 1073-1086, December.
    17. Kowalski, Krzysztof & Lev, Benjamin & Shen, Wenjing & Tu, Yan, 2014. "A fast and simple branching algorithm for solving small scale fixed-charge transportation problem," Operations Research Perspectives, Elsevier, vol. 1(1), pages 1-5.
    18. N H Moin & S Salhi, 2007. "Inventory routing problems: a logistical overview," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(9), pages 1185-1194, September.
    19. Linda Zhang & Carman Lee & Shuzhu Zhang, 2016. "An integrated model for strategic supply chain design: Formulation and ABC-based solution approach," Post-Print hal-01744868, HAL.
    20. Jesús Sáez Aguado, 2009. "Fixed Charge Transportation Problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems," Annals of Operations Research, Springer, vol. 172(1), pages 45-69, November.

    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:eee:proeco:v:204:y:2018:i:c:p:214-226. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    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.