IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v27y2010i04ns021759591000279x.html
   My bibliography  Save this article

Capacitated Two-Stage Time Minimization Transportation Problem

Author

Listed:
  • VIKAS SHARMA

    (Department of Mathematics, Panjab University, Chandigarh-160014, India)

  • KALPANA DAHIYA

    (UIET, Panjab University, Chandigarh-160014, India)

  • VANITA VERMA

    (Department of Mathematics, Panjab University, Chandigarh-160014, India)

Abstract

A capacitated two-stage time minimization transportation problem is considered in this paper, in which the total availability of a homogeneous product at various sources is more than the total requirement of the same at destinations. Unlike the conventional imbalanced time minimization transportation problem, in the current problem, transportation takes place in two stages such that the minimum requirement of the destinations is satisfied in the first stage and the surplus amount is transported in the second stage. Each time the transportation from sources to destinations is done in parallel and the capacity on each route (source destination link) remains fixed, i.e., the total amount transported in both the stages cannot exceed its upper bound. In each stage, the objective is to minimize the shipment time and the overall goal is to find a solution that minimizes the sum of first and second stage times.

Suggested Citation

  • Vikas Sharma & Kalpana Dahiya & Vanita Verma, 2010. "Capacitated Two-Stage Time Minimization Transportation Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 27(04), pages 457-476.
    • Handle: RePEc:wsi:apjorx:v:27:y:2010:i:04:n:s021759591000279x
    DOI: 10.1142/S021759591000279X
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S021759591000279X
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S021759591000279X?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.

    Citations

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


    Cited by:

    1. Singh, Gurwinder & Singh, Amarinder, 2023. "Extension of Particle Swarm Optimization algorithm for solving two-level time minimization transportation problem," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 204(C), pages 727-742.
    2. Kavita Gupta & Ritu Arora, 2017. "More for less method to minimize the unit transportation cost of a capacitated transportation problem with bounds on rim conditions," OPSEARCH, Springer;Operational Research Society of India, vol. 54(3), pages 460-474, September.
    3. Prabhjot Kaur & Anuj Sharma & Vanita Verma & Kalpana Dahiya, 2022. "An alternate approach to solve two-level hierarchical time minimization transportation problem," 4OR, Springer, vol. 20(1), pages 23-61, March.
    4. Fanrong Xie & Zuoan Li, 2022. "An iterative solution technique for capacitated two-stage time minimization transportation problem," 4OR, Springer, vol. 20(4), pages 637-684, December.

    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:wsi:apjorx:v:27:y:2010:i:04:n:s021759591000279x. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.