IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v62y2025i1d10.1007_s12597-024-00799-5.html
   My bibliography  Save this article

Two-level solid transportation problem

Author

Listed:
  • Supinder Kaur

    (Panjab University)

  • Ekta Jain

    (Panjab University)

  • Kalpana Dahiya

    (University Institute of Engineering and Technology, Panjab University)

Abstract

Motivated by the hierarchical system in transportation problems, this paper discusses a two-level time minimization solid transportation problem (2l-STP) in which the transportation of different kinds of products is done in two phases depending upon the preferences of various transportation links. Due to the hierarchical structure of the transportation system, the whole set of source-destination links is divided into two disjoint sets namely Level-1 (preferred links) and Level-2 (non-preferred links). To solve the problem, an iterative algorithm is proposed that solves a restricted solid transportation problem at each iteration. The proposed algorithm uses the technique of sensitivity analysis to solve intermediate restricted problems which makes the algorithm computationally efficient. A two-dimensional two-level transportation problem is discussed as a special case of two-level solid transportation problem. The study is supported by theoretical results and numerical examples.

Suggested Citation

  • Supinder Kaur & Ekta Jain & Kalpana Dahiya, 2025. "Two-level solid transportation problem," OPSEARCH, Springer;Operational Research Society of India, vol. 62(1), pages 423-447, March.
    • Handle: RePEc:spr:opsear:v:62:y:2025:i:1:d:10.1007_s12597-024-00799-5
    DOI: 10.1007/s12597-024-00799-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-024-00799-5
    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/s12597-024-00799-5?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.

    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:opsear:v:62:y:2025:i:1:d:10.1007_s12597-024-00799-5. 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: 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.