一种基于SFEC算法的车间调度问题

Solution of Workshop Arrangement Based on SEFC Algorithm

针对车间调度的问题,提出一种改进的演化算法.在算法中,首先引入个体之间距离和邻域的定义,从而根据距离来确定个体的相似性,并且根据个体的相似性对种群进行分级,以此得到新解产生的邻域.另外,为了提高算法的收敛速度,文中对较好的个体加入加速因子——列队竞争算子.最后,通过数值仿真检验,验证了本文算法的有效性和优越性.

An improved evolvement algorithm to deal with workshop arrangement is proposed in this article. To clarify the algorithm, first the concept of distance between individuals as well as domains is introduced. The similarities of individuals can be measured according to the distance defined above. Then the group is classified by the similarities of the individuals in it and a new solution is to be found in the domain. Additionally, in order to accelerate convergence, better individuals are supplied with accelerator, which is call alignment competing operator. At last, by using numeric simulating experiments, the validation and advantages of the algorithm are verified.