Apply Inversion Order Number Genetic Algorithm to the Job Shop Scheduling Problem
Guilin（2009）
摘要
Through analyzing the present genetic operators to solve the job shop scheduling problem, a inversion order number genetic algorithm is proposed. In view of the quality of the inversion order number, this algorithm measures the population diversity by the relative inversion order number. It uses the information provided by the inversion order number of the individual and the offspring is generated. This algorithm not only satisfies the characteristic of the job shop scheduling problem, but also develops the search capacity of genetic algorithm. The computation results validate the effectiveness of the proposed algorithm.
更多查看译文
关键词
computation result,search capacity,genetic algorithm,population diversity,relative inversion order number,present genetic operator,job shop scheduling,inversion order number,proposed algorithm,genetic algorithms,apply inversion order number,the job shop scheduling problem,job shop scheduling problem,genetic operator,schedules,satisfiability,encoding,genetics,algorithm design and analysis
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要