Abstract
The main objective of this study was to present in one applet java program the five approaches for solving the Multi-Objective Transportation Problem (MOTP). The program was built using the java programming language, to solve the MOTP and to visualize the solution steps. In addition, the study made a comparision between the four different approaches used to solve the MOTP. For better understanding, the solution procedure is illustrated with a numerical example.
Highlights
The Transportation Problem (TP) is a special type of linear programming problem
The four solution’s approaches for solving Multi-Objective Transportation Problem (MOTP) and the genetic algorithm in java language were implemented to obtain the optimal solution for each approach
"Minimum or Maximum" buttons determine the type of the problem. This frame is revealing in the four solution approaches for the MOTP
Summary
The Transportation Problem (TP) is a special type of linear programming problem It is considered as a minimum cost flow problem, which deals with the transportation of commodities from m sources to n destinations. The decision maker faces an unbalanced transportation problem in which the total supply is less than the total demand. This can be solved through compromised solutions. Kishore and Jayswal [10] introduced a method, called fuzzy approach, to solve unbalanced transportation problems with budgetary constraints. Weighted goal programming for unbalanced single objective transportation problem with budgetary constraint has been discussed by Kishore and Jayswal [11]. A number of transportation problems have been appeared in the literature [15,7,6, 21, 8]
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: INTERNATIONAL JOURNAL OF MANAGEMENT & INFORMATION TECHNOLOGY
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
