对于有时间窗的非满载VSP问题，将货运量约束和软时间窗约束转化为目标约束，建立了非满载VSP模型，设计了基于自然数编码，使用最大保留交叉、改进的反转变异等技术的遗传算法。
On the VSP with time window, while the restraints of capacity and time windows are changed into object restraints, a mathematic model is established.
针对运输中的“必经点”问题，设计了特殊染色体编码、交叉与变异规则；
For solving the problems of the necessity - node, the special rules of coding, crossover and mutation are designed.
其主要算子包括：编码方式、选择算子、交叉算子、变异算子及采用精英保留策略。
Its main operators include coding way, selecting operator, cross operator, mutation operator and adopting elites to keep the tactics.
应用推荐