会议论文

中文

2017

528-538

第十二届中国智能交通年会

第十二届中国智能交通年会论文集

2017-11-22

江苏常熟

中国智能交通协会

粮食公益性行业科研专项(201513004-3);湖北省教育厅科学研究计划指导性项目(B2017078);湖北省教育厅人文社科基金项目(17Y071)

本校为第一机构

本文研究了求解VRP的改进离散型和声搜索算法。鉴于和声搜索算法产生新的和声的过程随机性太大、搜索过程容易陷入局部最优等问题,提出了一种结合多重邻域搜索方式的和声搜索算法。在该算法中,从和声记忆库中随机选取一条和声,对于和声记忆库内,对该条和声的每个音调以一定的概率进行邻域搜索以减小和声记忆库内随机选取分量的随机性;对于和声记忆库外,随机选取音调,以一定的概率替换该和声的某个音调以提高全局搜索能力;

　　In this paper,an improved discrete harmony search algorithm for solving vehicle routing problem is studied.In order to solve the problem that the harmony process is too random and the search process is easy to fall into the local optimal problem,a harmony search algorithm based on multiple neighborhood search is proposed.In this algorithm,a harmony is randomly selected from the harmony memory.In the harmony memory,each of the tones of the harmony is subjected to a neighborhood search with a certain probability to reduce the randomness of ra...