Priority-driven Unbalanced Transportation Problem (PUTP) to obtain better Initial Feasible Solution
PPUTP; Priority-driven Unbalanced Transportation Problem; VAM
In this paper, we tackle the Priority-driven Unbalanced Transportation Problem (PUTP), a scenario where total demand exceeds total supply. An innovative algorithm, the Penalty-driven Priority-driven Unbalanced Transportation Problem (PPUTP) is introduced to solve this challenge. PPUTP allocates supplies to high-priority demands by computing penalties and sequentially addressing the most penalized demands, thereby ensuring priority demands are met efficiently. A comparative analysis with Vogel's Approximation Method (VAM) across various problem sets ranging from 5x5 to 50x50 dimensions demonstrates the efficiency of our algorithms. PPUTP consistently shows lower percentage increments from the optimal solution, indicating its robustness in providing near-optimal solutions. This study highlights the importance of algorithm selection based on problem set dimensions and complexity in Priority-driven Unbalanced Transportation Problem, with PPUTP emerging as a versatile and robust solution across various scenarios. 2024 IEEE.
Arif A.S.; Babu M.A.; Khan A.R.; Islam M.N.; Uddin M.S.; Poonia R.C.
Proceedings of InC4 2024 - 2024 IEEE International Conference on Contemporary Computing and Communications
Institute of Electrical and Electronics Engineers Inc.
Arif A.S., Jahangirnagar University, Department of Mathematics, Dhaka, Savar, Bangladesh; Babu M.A., Independent University Bangladesh, Department of Physical Sciences, Dhaka, 1229, Bangladesh; Khan A.R., Jahangirnagar University, Department of Mathematics, Dhaka, Savar, Bangladesh; Islam M.N., Prince Sattam bin Abdulaziz University, Department of Industrial Engineering, Al Kharj, 11942, Saudi Arabia; Uddin M.S., CHRIST (Deemed to be University), Department of Computer Science, Delhi NCR, 201003, India; Poonia R.C., CHRIST (Deemed to be University), Department of Computer Science, Delhi NCR, 201003, India