A New Heuristic Algorithm for Solving Fuzzy Rough Bi-Criteria Transshipment Problem
摘要
In the recent competitive market of transportation business, transshipment plays an important role in the logistics system. In which, goods are transported from sources to destinations through one are more intermediate points. Each of these points can act as either an origin or a destination. While, in general, most of the real-life applications are modeled as transshipment problem with shipping cost and time. However, for some unpredictable factors such as shortage of information, insufficient data or lack of evidence, uncertainty exists in the parameter models. These factors are comprehended by absorbing the fuzzy rough environment on the parameters. This type of problem is called bi-criteria fuzzy rough transshipment problem. In this paper, new heuristics algorithm based on minimum spanning tree approach is proposed to determine the optimum time–cost trade-off for a bi-criteria fuzzy rough transshipment problem ensuring equal emphasis to time and cost. This algorithm especially finds the solution of transshipment problem directly without converted into transportation problem. Also, the optimum solution is obtained using Modified Distribution Method. Numerical examples are illustrated to check validity of the proposed method.