An Elitism Evolutionary Algorithm For Solving Open Shop Problem

سال انتشار: 1395
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 623

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

این مقاله در بخشهای موضوعی زیر دسته بندی شده است:

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

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

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

CBCONF01_1059

تاریخ نمایه سازی: 16 شهریور 1395

چکیده مقاله:

In scheduling problems, we have a limited number of resources that should be allocated to some activities during a time interval. Open-shop scheduling is a kind of scheduling that is categorized as difficult problems. In this paper, we try to solve the open-shop problem by a parallel genetic algorithm. This algorithm uses several auxiliary genetic algorithms in parallel to raise the ability of the main genetic algorithm at convergence time and search more points of the problem space. Finally, this algorithm is tested on some standard problems in this field and acceptable results are presented.

کلیدواژه ها:

نویسندگان

Ali Gholam Nataj

Department of Computer Pardisan Institute of Higher Education Fereydonkenar, Iran

Ayoob Ramezani

Department of Computer Massive Process Engineering Institute Amol, Iran

Hossein Mozafari

Department of Computer Pardisan Institute of Higher Education Fereydonkenar, Iran

Zohreh Mahdavi

Department of Computer Massive Process Engineering Institute Amol, Iran