邮政运输网络中的邮路规划和邮车调度
he route and plan of the postal transport networks
城市内邮政运输规划属于“车辆路由问题”（Vehicle Routing Problem, VRP），是一类典型的有约束组合优化问题。因为邮车班次、承载负荷以及返回时间等多方面限制，当问题规模不断增大时，其计算量呈指数增长，传统算法难以解决。本文以CVRP (Capacitated Vehicle Routing Problem)为原型，采用启发式算法中的分组遗传算法与Clark-Wright(C/W)算法建立主要模型，同时辅以floyd算法。
he route and plan of the postal transport in city is the Vehicle Routing Problem, a classical optimizing problem. Because of the vehicles、weight and time, when the scale of the problem increase, the scale of the computation is very large, the traditional method can not solve it. In this paper, referring to the Capacitated Vehicle Routing Problem, using the Dividing Genetic Algorithm and the Clark-Wright Algorithm as the primary model, the Floyed Algorithm as the secondary.
武学毅、夏必胜、洪蓉
综合运输
车辆路由问题(VRP)分组遗传算法lark-Wright(C/W)算法floyd算法
Vehicle Routing Problemividing Genetic Algorithmlark-Wright AlgorithmFloyed Alorithm
武学毅,夏必胜,洪蓉.邮政运输网络中的邮路规划和邮车调度[EB/OL].(2009-02-13)[2025-08-16].http://www.paper.edu.cn/releasepaper/content/200902-657.点此复制
评论