Genetic algorithm application on the job shop scheduling problem

被引：0

作者：

Wu, CG ^{[1
]}

Xing, XL ^{[1
]}

Lee, HP ^{[1
]}

Zhou, CG ^{[1
]}

Liang, YC ^{[1
]}

机构：

[1] Jilin Univ, Coll Comp Sci & Technol, Changchun 130012, Peoples R China

来源：

PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7 | 2004年

关键词：

job-shop scheduling; genetic algorithm; traveling salesman problem;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Based on the concepts of operation template and virtual job shop, this paper attempts to solve several job shop scheduling problems with different scale and analyzes the relationship among the population size, mutation probability, the number of evolving generations and the complexity of the undertaking problem visually by using the trend chart of the fitness curves. This visual analysis could provide some referencing information for. the adjustment of genetic algorithm running parameters.

引用

页码：2102 / 2106

页数：5