A Heuristic for Obtaining an Initial Solution for the Transportation Problem with Experimental Analysis
Language: EnglishView: 2,889
This Paper With 11 Page And PDF Format Ready To Download
با استفاده از پرداخت اینترنتی بسیار سریع و ساده می توانید اصل این Paper را که دارای 11 صفحه است به صورت فایل PDF در اختیار داشته باشید.
This paper presents a heuristic
for obtaining an initial solution for the transportation problem that called Maximum Demand (MD). The importance of determining efficient solutions for large sized transportation problems is borne out by many practical problems in industries, the military, etc. With this motivation, we develop MD method to obtain fast and efficient solutions. Computational experiments were carried out to Comparison the findings obtained by the new heuristic
and the best method known in literature that is basic version of Vogel's approximation method
(VAM) coupled with total opportunity cost
(called the VAM-TOC), that tabulated for 640 examples. Superior performance of the new heuristic
over those methods is discussed in terms of total costs obtained, Number of times that MD resulted in an initial total cost which is less than to that obtained by VAMTOC and CPU time required to solve the problems. Experimental design aspects are also presented.
Paper COI CodeThis Paper COI Code is IIEC06_157. Also You can use the following address to link to this article. This link is permanent and is used as an article registration confirmation in the Civilica reference:
How to Cite to This Paper:
If you want to refer to this Paper in your research work, you can simply use the following phrase in the resources section:
Pargar, Farzad and Javadian, Nikbakhsh and Pourramzan Ganji, Adel,1387,A Heuristic for Obtaining an Initial Solution for the Transportation Problem with Experimental Analysis,6th International Industrial Engineering Conference,Tehran,https://civilica.com/doc/58931
مراجع و منابع این Paper:لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :
problems: An alternative to S tepping- Stone. Journal of Operational ...programming calculations in transportation problems. Management Science, 1(1), (1954) 49-69. ...M. Mathirajan And B. Meenakshi. Experimental Analysis of Some Variants ...Glover, F, D Karney, D Klingman and A Napier. A ...Goyal, SK. Improving V AM for unbalanced transportation problems. Journal ...Goyal, SK. A note On a heuristic for obtaining an ...Kirca, _ and A Satir. A heuristic for obtaining an ...transportation problem. Journal of Operational Research Society, 39(6) (1988), 609-610. ...Schrage, L (1991b). LINDO -- User's Manual: Release 5.0. GA, ...Shajma, RRK and KD Sharma. A new dual based procedure ...Shih, W. Modified S tepping-Stone method as a teaching aid ...Shimshak, DG, JA Kaslik and TD Barclay (1981). A modification ...Sridharan, R. Allocation of buses to depots: a case study. ...Vasudevan, J, E Malini and DJ Victor. Fuel savings in ...Make the allocation to the cell with the smallest cost. ...In the case of a tie in (1), make allocation ...In the case of a tie in (2), make allocation ...
The specifications of the publisher center of this Paper are as follows:
Type of center: موسسه غیرانتفاعی
Paper count: 1,299
In the scientometrics section of CIVILICA, you can see the scientific ranking of the Iranian academic and research centers based on the statistics of indexed articles.
This Papers recently indexed in civilica
More information about COI
COI stands for "CIVILICA Object Identifier". COI is the unique code assigned to articles of Iranian conferences and journals when indexing on the CIVILICA citation database.
The COI is the national code of documents indexed in CIVILICA and is a unique and permanent code. it can always be cited and tracked and assumed as registration confirmation ID.