摘要
针对生产车间的环境约束,对车辆路径问题约束条件进行改变,提出一种车间网络通道约束的车辆路径问题数学模型,针对此模型特点,利用Flody算法计算出各工位点之间的最短距离矩阵,对遗传算法进行改进,通过加入禁忌搜索算法跳出局部最优解,通过具体实例对车间通道约束数学模型及改进后遗传算法的有效性进行了验证。
According to the environmental constraints of the production workshop,the constraints of the vehicle routing problem are changed,and a mathematical model of the vehicle routing problem with the workshop network channel constraints is proposed.According to the characteristics of this model,Flody algorithm is used to calculate the shortest distance matrix between each station,genetic algorithm is improved,and the local optimal solution is obtained by adding tabu search algorithm,the effectiveness of the mathematical model and the genetic algorithm of the improved genetic algorithm are verified by specific examples.
作者
方景芳
袁冲
FANG Jingfang;YUAN Chong(College of Mechanical and Electrical Engineering,Lanzhou University of Technology,Lanzhou 730050,China)
出处
《电子设计工程》
2020年第23期18-24,共7页
Electronic Design Engineering
