The time optimization of bottleneck transport problems using mallia-das algorithm Elis Ratna Wulan- Rifia Khairiyyah- Dindin Jamaluddin
UIN Sunan Gunung Djati Bandung
Abstract
Bottleneck transportation problems have a significant importance in military operations and disaster situations, where in both cases time is a very important factor when supplying to the destination. In linear programming problems there are minimum and maximum problems, allocating products from source to destination which is known as the Transportation Problems. This bottleneck problem is formulated mathematically with transportation barriers that are commonly found in everyday life. In this research, an algorithm is shown to find the optimal solution by determining Z from the transportation table from the calculation of the initial feasible solution, then form a pseudo-cost matrix as a cell reference that must be minimized, rearrange the matrix and check on, if = 0 then the solution already optimal if not then repeat from step to form pseudo cost matrix. From the case of unbalanced data with a data size of 4x6, the optimal solution is 2775 units of time with 2 iterations, the optimal solution from the Mallia-Das algorithm when compared to the NWC method is 2885 and VAM is 2725, still the minimum optimal solution for the VAM method. Although it produces an optimal solution that is slightly larger than the VAM method, the Mallia-Das algorithm for the bottleneck case is superior because it pays attention to the bottlenecks.
