设计了求解车辆路径问题一种新的整数编码方案，并采用罚函数法处理约束条件。
A new integer-code method is adopted for the vehicle routing problem, and strained terms in VRP are processed by the penalty function.
在分析车辆路径问题(VRP)现有启发式算法的基础上，建立了考虑路线安排的物流配送方案模型，并提出了求解该问题的一种改进遗传算法(IGA)。
Based on the analysis of the existing heuristic algorithm for the vehicle routing problem (VRP), a distribution model relevant to route arrangement was established.
设计了求解车辆路径问题的一种新的实数编码方案，将车辆路径问题转化成准连续优化问题，并采用罚函数法处理约束条件。
The VRP was changed into a quasi-continuous problem by designing a new real coding. Constrained terms in VRP were processed by the penalty function.
应用推荐