摘要
研究了作业车间调度问题,并提出了一种新的求解方法,将邻域搜索与遗传算法相结合,提高遗传算法的局部搜索能力,加速进化过程,详细论述了该方法的优越性.
The job shop scheduling problem is studied and a new algorithm based on genetic algorithm and neighbor searching is proposed, The new algorithm improves some search performance and accelerate the evolution course .The advantages of the new algorithm is also deseribed in detail.
出处
《大连铁道学院学报》
2004年第3期63-65,共3页
Journal of Dalian Railway Institute
基金
辽宁省自然科学基金资助项目(20022114)
