IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v15y2024i11d10.1007_s13198-024-02527-0.html
   My bibliography  Save this article

An effective evolutionary algorithm for solving uncertain fixed charge transportation problem with damageable items

Author

Listed:
  • Rajeev Das

    (Chandigarh University)

  • Kedar Nath Das

    (National Institute of Technology)

  • Saurabh Mallik

    (National Institute of Technology)

Abstract

This paper aims to showcase the potential application of the metaheuristic approach Quadratic Approximation based Jaya (JaQA) in addressing a single-objective uncertain Fixed Charge Transportation Problem with Damageable items (FCTPD). The incorporation of uncertainties and damage rates for items adds realism to the selected problem model. Subsequently, a comprehensive examination of the FCTPD model is conducted, considering both expected value and chance-constrained cases based on uncertainty theory. Equivalent deterministic formulations are considered for these scenarios. The performance of JaQA is comprehensively benchmarked on a set of ten popular benchmarks of single-objective fixed charge transportation problems (FCTP) from the OR library. In addition to this, it is also evaluated on the deterministic forms of the expected value and chance-constrained cases, and the computational results are compared with other widely recognized approaches such as Jaya algorithm, Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) for five numerical instances A thorough investigation of statistical, convergence, and sensitivity analysis are presented to shed light on the efficacy and stability levels of JaQA over its counterparts. The simulation outcomes and exhaustive statistical analysis show that for all the problems considered, JaQA performed better out of GA, PSO, and Jaya. More specifically, it indicated that the utilization of JaQA provided significant profit maximization of the transportation system, thereby ensuring a promising value of the optimal solution.

Suggested Citation

  • Rajeev Das & Kedar Nath Das & Saurabh Mallik, 2024. "An effective evolutionary algorithm for solving uncertain fixed charge transportation problem with damageable items," 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. 15(11), pages 5231-5245, November.
    • Handle: RePEc:spr:ijsaem:v:15:y:2024:i:11:d:10.1007_s13198-024-02527-0
    DOI: 10.1007/s13198-024-02527-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-024-02527-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s13198-024-02527-0?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. 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. 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.
    3. Bertazzi, Luca & Maggioni, Francesca, 2018. "A stochastic multi-stage fixed charge transportation problem: Worst-case analysis of the rolling horizon approach," European Journal of Operational Research, Elsevier, vol. 267(2), pages 555-569.
    4. Warren M. Hirsch & George B. Dantzig, 1968. "The fixed charge problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 15(3), pages 413-424, September.
    5. Gbeminiyi John Oyewole & Olufemi Adetunji, 2021. "A Hybrid Algorithm To Solve The Fixed Charge Solid Location And Transportation Problem," Engineering Heritage Journal (GWK), Zibeline International Publishing, vol. 5(1), pages 1-11, March.
    6. Zhu, Kai & Ji, Kaiyuan & Shen, Jiayu, 2021. "A fixed charge transportation problem with damageable items under uncertain environment," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 581(C).
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. Ling Gai & Ying Jin & Binyuan Zhang, 2022. "An integrated method for hybrid distribution with estimation of demand matching degree," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2782-2808, November.
    3. Gaudioso, Manlio & Monaco, Maria Flavia & Sammarra, Marcello, 2021. "A Lagrangian heuristics for the truck scheduling problem in multi-door, multi-product Cross-Docking with constant processing time," Omega, Elsevier, vol. 101(C).
    4. Esmaeil Akhondi-Bajegani & F. Jolai & S. Ali Torabi, 2024. "A new mathematical model for designing and improving the performance of a home health care logistics network," Annals of Operations Research, Springer, vol. 340(2), pages 1189-1220, September.
    5. 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.
    6. Alex Scott & Chris Parker & Christopher W. Craighead, 2017. "Service Refusals in Supply Chains: Drivers and Deterrents of Freight Rejection," Transportation Science, INFORMS, vol. 51(4), pages 1086-1101, November.
    7. Shyamali Ghosh & Karl-Heinz Küfer & Sankar Kumar Roy & Gerhard-Wilhelm Weber, 2023. "Type-2 zigzag uncertain multi-objective fixed-charge solid transportation problem: time window vs. preservation technology," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 31(1), pages 337-362, March.
    8. Bertazzi, Luca & Moezi, Sarem Deilami & Maggioni, Francesca, 2021. "The value of integration of full container load, less than container load and air freight shipments in vendor–managed inventory systems," International Journal of Production Economics, Elsevier, vol. 241(C).
    9. Aurelija Burinskienė, 2021. "Designing a Multi-Stage Transport System Serving e-Commerce Activity," Sustainability, MDPI, vol. 13(11), pages 1-19, May.
    10. Alexey Sorokin & Vladimir Boginski & Artyom Nahapetyan & Panos M. Pardalos, 2013. "Computational risk management techniques for fixed charge network flow problems with uncertain arc failures," Journal of Combinatorial Optimization, Springer, vol. 25(1), pages 99-122, January.
    11. Cavagnini, Rossana & Bertazzi, Luca & Maggioni, Francesca, 2022. "A rolling horizon approach for a multi-stage stochastic fixed-charge transportation problem with transshipment," European Journal of Operational Research, Elsevier, vol. 301(3), pages 912-922.
    12. Huang, Kai & An, Kun & Correia, Gonçalo Homem de Almeida, 2020. "Planning station capacity and fleet size of one-way electric carsharing systems with continuous state of charge functions," European Journal of Operational Research, Elsevier, vol. 287(3), pages 1075-1091.
    13. Gambella, Claudio & Maggioni, Francesca & Vigo, Daniele, 2019. "A stochastic programming model for a tactical solid waste management problem," European Journal of Operational Research, Elsevier, vol. 273(2), pages 684-694.
    14. Aristide Mingozzi & Roberto Roberti, 2018. "An Exact Algorithm for the Fixed Charge Transportation Problem Based on Matching Source and Sink Patterns," Transportation Science, INFORMS, vol. 52(2), pages 229-238, March.
    15. Amy B. Gore & Mary E. Kurz & Matthew J. Saltzman & Blake Splitter & William C. Bridges & Neil J. Calkin, 2022. "Clemson University’s Rotational Attendance Plan During COVID-19," Interfaces, INFORMS, vol. 52(6), pages 553-567, November.
    16. Raj Kumar Bera & Shyamal Kumar Mondal, 2022. "A multi-objective transportation problem with cost dependent credit period policy under Gaussian fuzzy environment," Operational Research, Springer, vol. 22(4), pages 3147-3182, September.
    17. Shen, Jiayu & Shi, Jianxin & Gao, Lingceng & Zhang, Qiang & Zhu, Kai, 2023. "Uncertain green product supply chain with government intervention," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 208(C), pages 136-156.
    18. Lara, Cristiana L. & Koenemann, Jochen & Nie, Yisu & de Souza, Cid C., 2023. "Scalable timing-aware network design via lagrangian decomposition," European Journal of Operational Research, Elsevier, vol. 309(1), pages 152-169.
    19. Gao, Cai & Yan, Chao & Zhang, Zili & Hu, Yong & Mahadevan, Sankaran & Deng, Yong, 2014. "An amoeboid algorithm for solving linear transportation problem," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 398(C), pages 179-186.
    20. Kayacık, Sezen Ece & Basciftci, Beste & Schrotenboer, Albert H. & Ursavas, Evrim, 2025. "Partially adaptive multistage stochastic programming," European Journal of Operational Research, Elsevier, vol. 321(1), pages 192-207.

    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:spr:ijsaem:v:15:y:2024:i:11:d:10.1007_s13198-024-02527-0. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.