Λεπτομέρειες βιβλιογραφικής εγγραφής
| Τίτλος: |
A new algorithm for finding optimal solutions of transportation problems. |
| Συγγραφείς: |
Boah, Douglas Kwasi1 (AUTHOR) dboah@cktutas.edu.gh, Fiele, Suleman Abudu1 (AUTHOR) fielesuleman@gmail.com, Etwire, Christian John1 (AUTHOR) cetwire@cktutas.edu.gh |
| Πηγή: |
Discover Analytics. 7/13/2026, Vol. 4 Issue 1, p1-47. 47p. |
| Θεματικοί όροι: |
*Mathematical optimization, *Mathematical programming, *Linear programming, Transportation problems (Programming), Simplex algorithm, Benchmark problems (Computer science), Optimization algorithms, Iterative methods (Mathematics) |
| Περίληψη: |
This paper presents a computational refinement of classical optimality procedures for solving Transportation Problems (TPs). Rather than altering the underlying linear programming formulation, the method introduces a structured loop-enumeration strategy within the transportation simplex framework. Specifically, admissible improvement loops are generated from the current basis (occupied cells) and constrained to include exactly one nonbasic (unoccupied) cell, reducing redundant loop exploration. A formal analysis establishes feasibility preservation, strict descent when an improving loop exists, finite termination, and equivalence with classical optimality conditions via reduced costs. Computational experiments on benchmark problems from literature compare the new method with the Stepping–Stone and MODI methods. To evaluate computational efficiency, all computational experiments were conducted using MATLAB R2022b on a computer equipped with an Intel Core i7 processor (3.20 GHz), 16 GB RAM, running Windows 10 (64-bit), Execution time was measured using MATLAB's built-in timing functions. Each method was run five times per dataset, and the average CPU execution time (in seconds) was recorded to ensure consistency. Results show that the new approach yields optimal solutions identical to classical methods and achieves comparable or improved performance on average runtime, with clearer benefits on medium-to-large instances where loop redundancy is more pronounced. For small instances, differences are minor and may vary due to implementation overhead. The findings position the method as a practical, verifiable computational refinement for efficient loop selection in transportation simplex implementations. [ABSTRACT FROM AUTHOR] |
|
Copyright of Discover Analytics is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Βάση Δεδομένων: |
Business Source Index |