IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v229y2025icp611-635.html
   My bibliography  Save this article

Two-phase time minimization transportation problem with the restricted flow

Author

Listed:
  • Kaur, Supinder
  • Dahiya, Kalpana
  • Sharma, Anuj

Abstract

Motivated by the hierarchical structure within transportation systems, this paper explores a two-phase time minimization transportation problem with restricted flow (2p−TPF). In this problem, the transportation of products occurs in two distinct phases due to the partition of source–destination links into two separate levels: Level-1 and Level-2 links, with a specified amount of commodity being transported in each phase. For the transportation of a specific quantity of goods during the first phase, only Level-1 links are utilized. Following this, during the second phase of transportation, only Level-2 links are utilized. Transportation is carried out concurrently via numerous source–destination links relevant to each phase. This paper proposes an iterative algorithm (Algorithm-TPF) to find an optimal solution for a two-phase time minimization transportation problem that minimizes the sum of Phase-1 and Phase-2 transportation times. The proposed algorithm solves a solid time minimization transportation problem∖its restricted version at each iteration. Various theoretical results are proven to support the convergence of the algorithm. Numerical examples of various sizes are provided to support the theoretical results. Computational experiments conducted on randomly generated instances demonstrate the algorithm’s efficiency and convergence. The proposed algorithm offers an alternative method for solving two-phase time minimization transportation problems.

Suggested Citation

  • Kaur, Supinder & Dahiya, Kalpana & Sharma, Anuj, 2025. "Two-phase time minimization transportation problem with the restricted flow," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 229(C), pages 611-635.
    • Handle: RePEc:eee:matcom:v:229:y:2025:i:c:p:611-635
    DOI: 10.1016/j.matcom.2024.09.030
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475424003859
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2024.09.030?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:eee:matcom:v:229:y:2025:i:c:p:611-635. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.