METHODOLOGY RECOMMENDATION FOR ONE‐CRITERION TRANSPORTATION PROBLEMS: CAKMAK METHOD
Transportation problems (TP) are one of the most prominent fields of application of the mathematical disciplines to optimization and operations research. In general, there are three starting basic feasible solution methods: Northwest Corner, Least Cost Method, VAM – Vogel's Approximation Method...
Saved in:
| Published in | Transport (Vilnius, Lithuania) Vol. 22; no. 3; pp. 221 - 224 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
01.01.2007
|
| Online Access | Get full text |
Cover
Loading…
| Summary: | Transportation problems (TP) are one of the most prominent fields of application of the mathematical disciplines to optimization and operations research. In general, there are three starting basic feasible solution methods: Northwest Corner, Least Cost Method, VAM – Vogel's Approximation Method. The three methods differ in the quality of the starting basic solution. In this study, we actually show a new method for starting basic feasible solution to one‐criterion‐transportation problems: Çakmak Method. This method can be used for balanced or unbalanced one-criterion transportation problems, and gives the basic feasible optimum solution accordingly. |
|---|---|
| Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| ISSN: | 1648-4142 1648-3480 |
| DOI: | 10.3846/16484142.2007.9638128 |