این سایت در حال حاضر پشتیبانی نمی شود و امکان دارد داده های نشریات بروز نباشند
Journal of Computational and Applied Research in Mechanical Engineering - JCARME، جلد ۱، شماره ۲، صفحات ۷۷-۸۷
عنوان فارسی
چکیده فارسی مقاله
کلیدواژه‌های فارسی مقاله
عنوان انگلیسی Few heuristic optimization algorithms to solve the multi-period fixed charge production-distribution problem
چکیده انگلیسی مقاله This paper deals with a multi-period fixed charge production-distribution problem associated with backorder and inventories. The objective is to determine the size of the shipments from each supplier and backorder and inventories at each period, so that the total cost incurred during the entire period towards production, transportation, backorder and inventories is minimised. A 0-1 mixed integer programming problem is formulated. Genetic algorithm based population search heuristic, Simulated annealing based neighbourhood search heuristic and Equivalent variable cost based simple heuristic are proposed to solve the formulation. The proposed methodologies are evaluated by comparing their solutions with the lower bound solutions. The comparisons reveal that Genetic algorithm and Simulated annealing algorithm generate better solutions than the Equivalent variable cost solutions and are capable of providing solutions close to the lower bound value of the problems.
کلیدواژه‌های انگلیسی مقاله
نویسندگان مقاله n balaji |
department of mechanical engineering,sri krishna college of engineering and technology, coimbatore 641 008, india

n jawahar |
department of mechanical engineering, thiagarajar college of engineering, madurai 625 015, india

نشانی اینترنتی http://jcarme.srttu.edu/article_26_39d6347bab19547bdc0f41b167bdf4c4.pdf
فایل مقاله فایلی برای مقاله ذخیره نشده است
کد مقاله (doi)
زبان مقاله منتشر شده en
موضوعات مقاله منتشر شده
نوع مقاله منتشر شده
برگشت به: صفحه اول پایگاه   |   نسخه مرتبط   |   نشریه مرتبط   |   فهرست نشریات