Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:abbreviation |
gptkb:VAM
|
| gptkbp:advantage |
often yields better initial solution than other methods
|
| gptkbp:alsoKnownAs |
gptkb:Vogel's_Approximation_Method
|
| gptkbp:application |
logistics
supply chain management transportation planning |
| gptkbp:contrastsWith |
gptkb:Northwest_Corner_Method
Least Cost Method |
| gptkbp:field |
operations research
|
| gptkbp:firstPublished |
1958
|
| https://www.w3.org/2000/01/rdf-schema#label |
Vogel Scheme
|
| gptkbp:method |
heuristic
|
| gptkbp:proposedBy |
gptkb:W._Vogel
|
| gptkbp:purpose |
find initial feasible solution for transportation problem
|
| gptkbp:step |
allocate as much as possible to lowest cost cell in selected row or column
adjust supply and demand calculate penalty for each row and column select row or column with highest penalty repeat until all supplies and demands are satisfied |
| gptkbp:usedFor |
solving transportation problems
|
| gptkbp:bfsParent |
gptkb:Sir_Julius_Vogel
|
| gptkbp:bfsLayer |
6
|