Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/240039
Title: Time Minimizing Solution Procedures for the Transportation Problem with Mixed Constraints
Researcher: Agarwal, Swati
Guide(s): Sharma, Shambhu
Keywords: Physical Sciences,Mathematics,Mathematics
University: Dayalbagh Educational Institute
Completed Date: 2018
Abstract: The present thesis focuses on the development of methodologies to find an optimal solution of Time Minimizing Transportation Problem with Mixed Constraints (TMTP-MC). To obtain an optimum transportation time of TMTP-MC, four methods are developed along with their algorithms. newlineIn the first method, greatest time cells are avoided for allotment, one by one, in decreasing order of time till the feasibility sustains in the absence of avoided cells. Then, assignment of cells along with objective value, is the optimal solution. newlineSecond method starts with a basic infeasible solution and moving towards a basic feasible solution by updating the basis iteratively. This basic feasible solution is an optimal solution of TMTP-MC. newlineThird approach initiates with a basic feasible solution. A method for finding it, is exclusively developed. To improve that basic feasible solution, allotment of a basic cell with highest time, is shifted to a cell with lesser time than that. In this way, that cell is vacated to reduce the time of transportation. Shifting is made through an open loop initiated with that basic cell and terminated at the cell having lower time. After termination of shifting process, the solution in the transportation table is the optimal solution with corresponding shipment time. newlineIn fourth method, some parameters are introduced to equality constraints of TMTP-MC to analyze the More-for-Less (MFL) paradoxical situation in it. Treating these parameters also as basic variables, a basic infeasible solution is obtained. By updating the basis of the solution iteratively, a basic solution is improved to obtain a basic feasible solution. This solution is the MFL solution, if at least one of the parameters remain in the basis at positive level. Otherwise, the MFL situation does not exist in the problem and the solution obtained is an optimal solution. Through MFL solution, an optimal solution of the problem can also be obtained. newline
Pagination: 
URI: http://hdl.handle.net/10603/240039
Appears in Departments:Department of Mathematics

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File144.85 kBAdobe PDFView/Open
02_certificate.pdf583.59 kBAdobe PDFView/Open
03_declaration.pdf344.9 kBAdobe PDFView/Open
04_abstract.pdf83.73 kBAdobe PDFView/Open
05_acknowledgement.pdf183.07 kBAdobe PDFView/Open
06_contents.pdf336.52 kBAdobe PDFView/Open
07_list_of_tables.pdf283.6 kBAdobe PDFView/Open
08_abbreviations.pdf182.06 kBAdobe PDFView/Open
09_preface.pdf279 kBAdobe PDFView/Open
10_chapter 1.pdf146.6 kBAdobe PDFView/Open
11_chapter 2.pdf162.74 kBAdobe PDFView/Open
12_chapter 3.pdf210.29 kBAdobe PDFView/Open
13_chapter 4.pdf153.79 kBAdobe PDFView/Open
14_chapter 5.pdf184.72 kBAdobe PDFView/Open
15_conclusion.pdf44.89 kBAdobe PDFView/Open
16_references.pdf80.2 kBAdobe PDFView/Open
17_appendix.pdf196.76 kBAdobe PDFView/Open
18_summary.pdf295.04 kBAdobe PDFView/Open


Items in Shodhganga are protected by copyright, with all rights reserved, unless otherwise indicated.