IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v104y2021ics0305048321001018.html
   My bibliography  Save this article

An improved heuristic approach for the interval immune transportation problem

Author

Listed:
  • Carrabs, Francesco
  • Cerulli, Raffaele
  • D’Ambrosio, Ciriaco
  • Della Croce, Federico
  • Gentili, Monica

Abstract

We study the problem of determining the bounds of the optimal cost of a transportation problem when the capacity of the suppliers and the demand of the customers vary over an interval. We consider transportation costs such that the transportation paradox does not arise. We design a new heuristic approach based on some polyhedral properties of the problem and provide a novel integer linear programming mathematical formulation to solve it exactly. Our computational results, carried out on benchmark instances from the literature and on some new instances, show that our heuristic algorithm greatly outperforms the best solution approaches currently used.

Suggested Citation

  • Carrabs, Francesco & Cerulli, Raffaele & D’Ambrosio, Ciriaco & Della Croce, Federico & Gentili, Monica, 2021. "An improved heuristic approach for the interval immune transportation problem," Omega, Elsevier, vol. 104(C).
    • Handle: RePEc:eee:jomega:v:104:y:2021:i:c:s0305048321001018
    DOI: 10.1016/j.omega.2021.102492
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048321001018
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2021.102492?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. Juman, Z.A.M.S. & Hoque, M.A., 2014. "A heuristic solution technique to attain the minimal total cost bounds of transporting a homogeneous product with varying demands and supplies," European Journal of Operational Research, Elsevier, vol. 239(1), pages 146-156.
    2. D’Ambrosio, C. & Gentili, M. & Cerulli, R., 2020. "The optimal value range problem for the Interval (immune) Transportation Problem," Omega, Elsevier, vol. 95(C).
    3. Elif Garajová & Milan Hladík & Miroslav Rada, 2019. "Interval linear programming under transformations: optimal solutions and optimal value range," 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. 27(3), pages 601-614, September.
    4. J W Chinneck & K Ramadan, 2000. "Linear programming with interval coefficients," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 51(2), pages 209-220, February.
    5. Liu, Shiang-Tai, 2003. "The total cost bounds of the transportation problem with varying demand and supply," Omega, Elsevier, vol. 31(4), pages 247-251, August.
    6. Wlodzimierz Szwarc, 1971. "The transportation paradox," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 18(2), pages 185-202, June.
    7. Xie, Fanrong & Butt, Muhammad Munir & Li, Zuoan & Zhu, Linzhi, 2017. "An upper bound on the minimal total cost of the transportation problem with varying demands and supplies," Omega, Elsevier, vol. 68(C), pages 105-118.
    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. Elif Garajová & Miroslav Rada, 2023. "Interval transportation problem: feasibility, optimality and the worst optimal value," 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(3), pages 769-790, September.

    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. Elif Garajová & Miroslav Rada, 2023. "Interval transportation problem: feasibility, optimality and the worst optimal value," 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(3), pages 769-790, September.
    2. D’Ambrosio, C. & Gentili, M. & Cerulli, R., 2020. "The optimal value range problem for the Interval (immune) Transportation Problem," Omega, Elsevier, vol. 95(C).
    3. Xie, Fanrong & Butt, Muhammad Munir & Li, Zuoan & Zhu, Linzhi, 2017. "An upper bound on the minimal total cost of the transportation problem with varying demands and supplies," Omega, Elsevier, vol. 68(C), pages 105-118.
    4. Jana Novotná & Milan Hladík & Tomáš Masařík, 2020. "Duality Gap in Interval Linear Programming," Journal of Optimization Theory and Applications, Springer, vol. 184(2), pages 565-580, February.
    5. Figueroa–García, Juan Carlos & Hernández, Germán & Franco, Carlos, 2022. "A review on history, trends and perspectives of fuzzy linear programming," Operations Research Perspectives, Elsevier, vol. 9(C).
    6. Md. Ashraful Babu & M. A. Hoque & Md. Sharif Uddin, 2020. "A heuristic for obtaining better initial feasible solution to the transportation problem," OPSEARCH, Springer;Operational Research Society of India, vol. 57(1), pages 221-245, March.
    7. Firoz Ahmad & Ahmad Yusuf Adhami, 2019. "Total cost measures with probabilistic cost function under varying supply and demand in transportation problem," OPSEARCH, Springer;Operational Research Society of India, vol. 56(2), pages 583-602, June.
    8. Andrej Kastrin & Janez Povh & Lidija Zadnik Stirn & Janez Žerovnik, 2021. "Methodologies and applications for resilient global development from the aspect of SDI-SOR special issues of CJOR," 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. 29(3), pages 773-790, September.
    9. Soyster, A.L. & Murphy, F.H., 2013. "A unifying framework for duality and modeling in robust linear programs," Omega, Elsevier, vol. 41(6), pages 984-997.
    10. Kowalski, Krzysztof & Lev, Benjamin, 2008. "On step fixed-charge transportation problem," Omega, Elsevier, vol. 36(5), pages 913-917, October.
    11. Zhou, Feng & Huang, Gordon H. & Chen, Guo-Xian & Guo, Huai-Cheng, 2009. "Enhanced-interval linear programming," European Journal of Operational Research, Elsevier, vol. 199(2), pages 323-333, December.
    12. Giove, Silvio & Funari, Stefania & Nardelli, Carla, 2006. "An interval portfolio selection problem based on regret function," European Journal of Operational Research, Elsevier, vol. 170(1), pages 253-264, April.
    13. B. Luo & I. Maqsood & G. Huang, 2007. "Planning water resources systems with interval stochastic dynamic programming," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 21(6), pages 997-1014, June.
    14. Gurupada Maity & Sankar Kumar Roy & Jose Luis Verdegay, 2019. "Time Variant Multi-Objective Interval-Valued Transportation Problem in Sustainable Development," Sustainability, MDPI, vol. 11(21), pages 1-15, November.
    15. Fanrong Xie & Anuj Sharma & Zuoan Li, 2022. "An alternate approach to solve two-level priority based assignment problem," Computational Optimization and Applications, Springer, vol. 81(2), pages 613-656, March.
    16. Hocine, Amine & Kouaissah, Noureddine, 2020. "XOR analytic hierarchy process and its application in the renewable energy sector," Omega, Elsevier, vol. 97(C).
    17. Wu, Hsien-Chung, 2009. "The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions," European Journal of Operational Research, Elsevier, vol. 196(1), pages 49-60, July.
    18. Wei Peng & Rene V. Mayorga, 2017. "A Fuzzy-stochastic Approach for Binary Linear Programming under Uncertainties," Journal of Mathematics Research, Canadian Center of Science and Education, vol. 9(3), pages 95-111, June.
    19. Sankar Kumar Roy & Gurupada Maity & Gerhard-Wilhelm Weber, 2017. "Multi-objective two-stage grey transportation problem using utility function with goals," 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. 25(2), pages 417-439, June.
    20. Gaiqiang Yang & Ping Guo & Mo Li & Shiqi Fang & Liudong Zhang, 2016. "An Improved Solving Approach for Interval-Parameter Programming and Application to an Optimal Allocation of Irrigation Water Problem," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 30(2), pages 701-729, January.

    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:jomega:v:104:y:2021:i:c:s0305048321001018. 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/wps/find/journaldescription.cws_home/375/description#description .

    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.