改进Memetic算法求解集装箱码头泊位岸桥调度问题

Berth and quay crane allocation problem based on Memetic algorithm

针对集装箱码头泊位岸桥调度这一NP难题,提出了一种改进的Memetic算法。算法中采用三层染色体结构表示个体,通过改进顺序交叉算子和基于领域搜索的变异算子以避免个体超出可行域,在交叉和变异后采用改进的模拟退火策略进行局部搜索。试验算例表明该算法收敛速度较快,且能获得较好的满意解。

The berth and quay crane allocation problem in container terminal is a NP-hard problem.Thus,an improved Memetic algorithm is proposed in this paper.In the algorithm,feasible solutions are represented by chromosomes with three-layer structure,and the order crossover and a new mutation based on neighborhood search are employed.After each crossover and mutation operation,an improved simulated-annealing algorithm is utilized for local search.The experimental results show the effectiveness of the proposed algorithm.