SLIIT Conference and Symposium Proceedings
Permanent URI for this communityhttps://rda.sliit.lk/handle/123456789/295
All SLIIT faculties annually conduct international conferences and symposiums. Publications from these events are included in this collection.
Browse
2 results
Search Results
Publication Embargo Exact Solution for the Upper Minimal Total Cost Bound of Multi-Supplier Single-Buyer Interval Transportation Problem(Faculty of Humanities and Sciences, SLIIT, 2022-09-15) Gamage, JTransporting a commodity from sources to destinations with minimal transportation cost is the main goal in all industries. In the literature, researchers have given considerable attention to find the total minimum transportation cost in fixed supply and fixed demand quantities. However, in the real-world supply, demand values will vary in a certain range due to the variation of the global economy. The number of combinations of supplies and demands rapidly increase in their respective ranges as the number of suppliers and buyers increases. To make better decisions on investments, it is useful to know the lower and the upper bounds of the minimal total costs in the interval transportation problem (ITP). However, no exact solution has been identified to obtain the upper bound of minimal transportation cost. In this research, a new algorithm has been developed to determine all the choices of supplies and demands in multi-supplier singlebuyer transportation problems. Based on the new method, the minimum transportation cost can be found for each combination that satisfies the fundamental theory of transportation problem (total supplies value ≥ demand value). Furthermore, the maximum cost as the upper minimal total cost bound can also be obtained. The new methodology is illustrated using real data. It is also shown that the proposed method is able to obtain the exact solution for the upper minimal total cost bound of multi-supplier single-buyer ITP.Publication Embargo Heuristic Approach to Solve Interval Transportation Problem(Faculty of Humanities and Sciences,SLIIT, 2021-09-25) Gunarathne, H.A.D.R; Juman, Z.A.M.SThe transportation problem is a special type of linear programming problem in which commodities are transported from a set of sources to a set of destinations subject to the supply and demand quantities of sources and destinations respectively such that the total transportation cost is minimized. This plays an important role in logistics and supply-chain management for improving services, reducing cost, and optimizing the use of resources. Researchers have given considerable attention to the transportation problem with fixed demand and supply. Many algorithms are available to solve transportation problems with the above conditions. However, in realworld applications, demand and supply quantities may vary within a specific interval due to variations in the global economy. Finding an upper minimal total cost of interval transportation problem (ITP) is an NP-hard problem. Thus, less attention has been given to this type of transportation problem. Heuristic approaches are preferred to solve this type of problem. Genetic algorithm is a powerful algorithm to solve NP-hard problems because of its special characteristics. In this paper, a solution procedure based on the concept of a genetic algorithm is proposed to solve ITP.