Three Algorithms Performance Comparison on Job Shop Scheduling Problem
Quantum algorithm, Genetic Algorithm and Population Based Incremental Learning algorithm are all intelligent algorithms. They have the common features in evolutionary, encoding strategy and probability application, but with the different problems and different scale sizes of the same problem they show different performance. In this paper we take Job Shop scheduling problem as example to test their performance difference and analyze their applicability. Two benchmark Job Shop problems are used to fulfill the comparison. The results make a reliable instruction in applying the three algorithms.
Job Shop scheduling Quantum algorithm GA PBIL
Shanshan Wan Yunchen Jiang
Computer Teaching and Network DepartmentBeijing University of Civil Engineering and ArchitectureBeij Department of Laboratory and Equipment Management Beijing Institute of Technology Beijing, China
国际会议
哈尔滨
英文
418-421
2011-01-18（万方平台首次上网日期，不代表论文的发表时间）