基于新邻域结构的Memetic 算法求解流水车间调度问题

流水车间调度是一类典型的生产调度问题,属于NP-难问题.针对传统的最优化方法难以求解大规模问题,提出了一个Memetic算法,在算法的局部搜索中使用一种新型的基于NEH的邻域结构,并且其邻域规模随着搜索的进行能够动态变化,可以大大提高算法的搜索能力.通过对标准Benchmark问题的测试,所得结果表明提出的基于新邻域结构的Memetic算法具有较好的性能,并且优于已有文献中的粒子群算法.

New neighbourhood based Memetic algorithm for permutation flowshop scheduling problem

The permutation flowshop scheduling problem(PFSP) is a kind of classical production scheduling problem, which
is ???? -hard. The traditional optimization method cannot be adopted to solve large scale problems. Therefore, this paper
proposes a Memetic algorithm for the PFSP, in which a new neighbourhood structure based on NEH is developed. In
addition, the size of the neighbourhood is dynamically adjusted during the search process. The computational results on
Benchmark problems show that the proposed Memetic algorithm is effective and superior to a particle swarm optimization
in the literature.