Premium
MODIFIED STEPPING‐STONE METHOD AS A TEACHING AID FOR CAPACITATED TRANSPORTATION PROBLEMS
Author(s) -
Shih Wei
Publication year - 1987
Publication title -
decision sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.238
H-Index - 108
eISSN - 1540-5915
pISSN - 0011-7315
DOI - 10.1111/j.1540-5915.1987.tb01553.x
Subject(s) - bounding overwatch , scope (computer science) , simplex algorithm , computer science , stepping stone , simple (philosophy) , linear programming , mathematical optimization , simplex , transportation theory , matrix (chemical analysis) , operations research , algorithm , mathematics , artificial intelligence , philosophy , materials science , geometry , epistemology , composite material , economics , unemployment , programming language , economic growth
This paper extends the standard stepping‐stone method to the case of capacitated transportation problems. The purpose is to offer an alternative to network‐oriented or simplex‐based methods (such as the out‐of‐kilter and upper‐bounding techniques) often used in handling the capacitated transportation problem but generally beyond the scope of introductory decision sciences courses. The proposed procedure is based on the simple stepping‐stone method and requires only a few modifications in the cost/assignment matrix and some alterations in the pivoting rules. As such, it is much easier to understand and apply than the above‐mentioned solution algorithms. It therefore can serve as an effective tool for teaching capacitated transportation problems. Two numerical examples illustrate applications of the proposed method, procedures for sensitivity analysis, and comparisons with linear programming.