Paper Title:
Improved Adaptive Genetic Algorithms for Job Shop Scheduling Problems
  Abstract

In this paper, the adaptability of the genetic algorithm (GA) is considered. Two improved adaptive genetic algorithms (AGA) which are called Ch-AGA and Th-AGA for short are proposed based on the previous AGA. The crossover probability and the mutation probability of the Ch-AGA and the Th-AGA are non-linear changed between some a certain region, and adopted the mathematical function of chx and thx respectively. The two improved adaptive genetic algorithms are used to solve the classical job shop scheduling problems and the results indicate that the algorithms are more effective and more efficient than previous AGA, and should be used in practical applications.

  Info
Periodical
Advanced Materials Research (Volumes 97-101)
Edited by
Zhengyi Jiang and Chunliang Zhang
Pages
2473-2476
DOI
10.4028/www.scientific.net/AMR.97-101.2473
Citation
M. H. Liu, X. F. Peng, "Improved Adaptive Genetic Algorithms for Job Shop Scheduling Problems", Advanced Materials Research, Vols. 97-101, pp. 2473-2476, 2010
Online since
March 2010
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Huan Ming Yao, Ming Di Cai, Jie Kai Wang, Rui Kai Hu, Yu Liang
Chapter 13: Artificial Intelligence and Optimization Algorithm
Abstract: An improved evolutionary algorithm (SCAGA) is proposed in this paper. The algorithm is based on new population initialization method and...
1956
Authors: Jiang Chang, Guang Wen Ma
X. Communications and Information Technology Applications
Abstract:The comprehensive reservoir scheduling is based on multi-objective reservoir operation, should try to coordinate between each target...
2042