Article Fingerprint
ReserarchID
0T8O7
This paper describes an algorithm for solving a certain class of bi-criteria multistage transportation problems with transshipment (BMTSP). A several bi-criteria multistage transportation problem with transshipment are formulated. The presented algorithm is mainly based on application of the methods of solving bi-criteria single stage transportation problems, utilizing available decomposition techniques for solving large-scale linear programming problems, and the methods of treating the transshipment problems. The mathematical formulation of the presented class does not affect the special structure of the transshipment problem for each of the individual stages. An illustrative example is introduced to validate that the implementation of the algorithm.
A. Abed. 2014. \u201cAn Algorithm for Solving Bi-criteria Large Scale Transshipment Problems\u201d. Global Journal of Research in Engineering - B: Automotive Engineering GJRE-B Volume 14 (GJRE Volume 14 Issue B4): .
Crossref Journal DOI 10.17406/gjre
Print ISSN 0975-5861
e-ISSN 2249-4596
Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.
Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.
Total Score: 125
Country: Kuwait
Subject: Global Journal of Research in Engineering - B: Automotive Engineering
Authors: Khalid Alkhulaifi, Jasem AlRajhi, Hilal A. Abdelwali, Mohsen AlArdhi, Elsayed E. M. Ellaimony (PhD/Dr. count: 0)
View Count (all-time): 251
Total Views (Real + Logic): 4685
Total Downloads (simulated): 2197
Publish Date: 2014 12, Mon
Monthly Totals (Real + Logic):
This paper attempted to assess the attitudes of students in
Advances in technology have created the potential for a new
Inclusion has become a priority on the global educational agenda,
This paper describes an algorithm for solving a certain class of bi-criteria multistage transportation problems with transshipment (BMTSP). A several bi-criteria multistage transportation problem with transshipment are formulated. The presented algorithm is mainly based on application of the methods of solving bi-criteria single stage transportation problems, utilizing available decomposition techniques for solving large-scale linear programming problems, and the methods of treating the transshipment problems. The mathematical formulation of the presented class does not affect the special structure of the transshipment problem for each of the individual stages. An illustrative example is introduced to validate that the implementation of the algorithm.
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.