The transportation problem (TP) is a significant factor in operational research. Numerous researchers have put forth various solutions to these problems. The goal is to reduce the overall cost of distributing resources from multiple sources to numerous destinations. If there are road risks (snow, flood, etc.), traffic limitations, etc., it might not be feasible to transport products from one place to another. In these circumstances, the appropriate route(s) can be given an extremely high unit cost, such as M (or). Following that, a specific case of the prohibited transportation problem is introduced. Therefore, the focus of this study is to provide a novel algorithm that will reduce the cost of restricted transportation problems. With a few modifications, the traditional Vogel approach has been enhanced. The proposed method would perform better than the other approaches now in use. The numerical problem is resolved to demonstrate the effectiveness of the proposed approach and make comparisons with different approaches already in use.
Copyrights © 2022