Bottleneck capacitated transportation problem with bounds on rim conditions
Material type:
ArticlePublication details: Description: 50 (4) Oct-Dec 2013, 491-503pSubject(s):
In:
BV- Opsearch (Jul - Dec 2013)Summary: This paper develops a technique for minimizing time in a capacitated transportation problem with bounds on rim conditions. An algorithm in which a related transportation problem is formed minimizes the total time necessary for transporting goods from the suppliers to the consumers in a special class of capacitated transportation problems with bounds on total availabilities at sources and total destination requirements. The procedure involves finite iterations and is based on movement from one extreme point to another extreme point till we get an optimal solution that is with minimum time and further reduction in amount in the pipeline is not possible. A numerical example illustrating the algorithm is also included.
| Item type | Current library | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
Articles
|
Main Library | Available | AR16061 |
This paper develops a technique for minimizing time in a capacitated transportation problem with bounds on rim conditions. An algorithm in which a related transportation problem is formed minimizes the total time necessary for transporting goods from the suppliers to the consumers in a special class of capacitated transportation problems with bounds on total availabilities at sources and total destination requirements. The procedure involves finite iterations and is based on movement from one extreme point to another extreme point till we get an optimal solution that is with minimum time and further reduction in amount in the pipeline is not possible. A numerical example illustrating the algorithm is also included.
There are no comments on this title.