CAPACITATED TWO-STAGE TIME MINIMIZATION TRANSPORTATION PROBLEM

Vikas Sharma (), Kalpana Dahiya () and Vanita Verma ()
Additional contact information
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

Asia-Pacific Journal of Operational Research (APJOR), 2010, vol. 27, issue 04, 457-476

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.

Keywords: Time transportation problem; combinatorial optimization; non-convex programming; bottleneck linear programming; capacitated transportation problem (search for similar items in EconPapers)
Date: 2010
References: View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S021759591000279X
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:apjorx:v:27:y:2010:i:04:n:s021759591000279x

Ordering information: This journal article can be ordered from

DOI: 10.1142/S021759591000279X

Access Statistics for this article

Asia-Pacific Journal of Operational Research (APJOR) is currently edited by Gongyun Zhao

More articles in Asia-Pacific Journal of Operational Research (APJOR) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().