| Mathematical and Computational Applications | |
| A Improved Vogel's Approximatio Method for the Transportation Problem | |
| KorukoÄlu, Serdar1  | |
| 关键词: Transportation Problem; Integer Programming; Vogelâs Approximation Method; Total Opportunity Cost; Simulation Experiments; | |
| DOI : 10.3390/mca16020370 | |
| 学科分类:计算数学 | |
| 来源: mdpi | |
PDF
|
|
【 摘 要 】
Determining efficient solutions for large scale transportation problems is an important task in operations research. In this study, Vogelâs Approximation Method (VAM) which is one of well-known transportation methods in the literature was investigated to obtain more efficient initial solutions. A variant of VAM was proposed by using total opportunity cost and regarding alternative allocation costs. Computational experiments were carried out to evaluate VAM and improved version of VAM (IVAM). It was seen that IVAM conspicuously obtains more efficient initial solutions for large scale transportation problems. Performance of IVAM over VAM was discussed in terms of iteration numbers and CPU times required to reach the optimal solutions.
【 授权许可】
CC BY
【 预 览 】
| Files | Size | Format | View |
|---|---|---|---|
| RO201902025448113ZK.pdf | 294KB |
PDF