CAJ | 학술논문

差分进化算法是一种具有记忆个体最优解和种群内部信息共享的特点的新型进化算法，本质上可看做是一种基于实数编码的、具有保优思想的贪婪遗传算法。针对具有NP难的车辆路径优化问题，提出了一种改进的差分进化算法。利用贪心算法产生初始种群，定义合法化修复变异个体的方法，采用改进的顺序交叉，并在变异操作之后，加入新的选择机制。使用Matlab进行了算法的实现，实验结果表明了改进DE算法能够高效地解决VRP问题。
차분진화산법시일충구유기억개체최우해화충군내부신식공향적특점적신형진화산법，본질상가간주시일충기우실수편마적、구유보우사상적탐람유전산법。침대구유NP난적차량로경우화문제，제출료일충개진적차분진화산법。이용탐심산법산생초시충군，정의합법화수복변이개체적방법，채용개진적순서교차，병재변이조작지후，가입신적선택궤제。사용Matlab진행료산법적실현，실험결과표명료개진DE산법능구고효지해결VRP문제。
As a new kind of evolutionary algorithm, Differential Evolution(DE)algorithm with the characteristics of remembering individual optimal solution and information sharing can be regarded as a real coded and excellent security greedy genetic algo-rithm. To solve the Vehicle Routing Problem(VRP), which belongs to NP problems, the paper puts forward an improved differ-ential evolution algorithm. A greedy algorithm is used to generate the initial population, legalized method is used to repair muta-tion, improved order crossover is used, then, after the mutation operator, a new selection mechanism is added in. The new algo-rithm is implemented in Matlab, the experimental results show that the improved differential evolution algorithm can efficiently solve the VRP.