A Heuristic for Obtaining an Initial Solution for the Transportation Problem with Experimental Analysis

سال انتشار: 1387
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 3,291

فایل این مقاله در 11 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

IIEC06_157

تاریخ نمایه سازی: 8 مهر 1387

چکیده مقاله:

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.

نویسندگان

Farzad Pargar

Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran

مراجع و منابع این مقاله:

لیست زیر مراجع و منابع استفاده شده در این مقاله را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود مقاله لینک شده اند :
  • 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 ...
  • نمایش کامل مراجع