Abstract:
A Cultural Algorithm(CA) is constructed for solving job shop scheduling problems. By means of simulating the evolution of culture in societies, the CA finds the final solution, with the mutual connection and promotion between the belief space and the population space in its computing progress. The algorithm employs fixed priority-list coding, its population space’s evolution adopts genetic algorithm, and its belief space’s creation and evolution depends on an unique belief-extraction method. A series of job-shop scheduling benchmark problems algorithm’s effect validates.
Key words:
Cultural Algorithm(CA),
job shop scheduling problem,
belief space
摘要: 构造用于作业车间调度问题的文化算法,模拟文化的进化实现对问题的寻优,通过算法中信念空间和种群空间的相互联系和相互促进实现求解。算法采用固定优先表编码方式,其种群空间采用遗传算法作为进化手段,采用较独特的信念提取方式构造算法的信念空间并促使其进化。将该算法应用于作业车间调度问题标准实例,证明其有效性。
关键词:
文化算法,
作业车间调度问题,
信念空间
CLC Number:
ZHAO Liang-hui. Cultural Algorithm of Job Shop Scheduling Problem[J]. Computer Engineering, 2009, 35(13): 196-198.
赵良辉. 作业车间调度问题的文化算法[J]. 计算机工程, 2009, 35(13): 196-198.