A mixed Genetic Algorithm and Simulated annealing Algorithm for Cattle Food production process optimization

Message:
Abstract:
In this paper we try to determine optimal combination of effective factors to produce cattle feed. Cattle feed has direct relation with cattle health, this research is done on real case study, therefore the gained results could be too important. Both response surface methodology and design of experiments are used for modeling and improving cattle feed production process which has more than one effective factor. After effective factors identification, designing of experiments will be done by central composite design. Interference factors, effective and independent parameters are inspected by forward method and finally a model is obtained by independent parameters. Because of continuous space of the problem and nonlinear objective functions a metaheuristics named "genetic annealing" is used to solve the problem. Proposed algorithm searched the solution space parallel. Another algorithm, simulated annealing is also proposed to evaluate the performances of two algorithms by improvement percent between initial and final result.
Language:
Persian
Published:
Journal of Industrial Management Studies, Volume:5 Issue: 14, 2006
Page:
251
magiran.com/p801286  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 1,390,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!