一种带软时间窗的物流配送路径优化遗传算法

An Optimized Genetic Algorithm with Soft Time Windows for Physical Distribution Routing

本文在建立物流配送路径优化问题模型的基础上,采用最佳保留的轮盘赌复制法、最大保留交叉法、交叉率和变异率自适应调整等技术,设计了基于自然数编码的遗传算法,并进行了实验计算。结果表明,用该算法进行带软时间窗的非满载车辆调度优化问题,可以方便有效地求得满意解。

On the basis of establishing an optimized model for the physical distribution routing problem, the paper uses techniques such as maximum preserved roulette wheel selection, maximum preserved crossover and self adaptation for probability of crossover and mutation, designs a genetic algorithm based on natural numbers, and performs experimental calculations. The results demonstrate that the feasible solutions to the not-fully-loaded vehicle scheduling problem with soft time windows can easily be obtained using the algorithm.