摘要
讨论了带时间窗约束的车辆路径问题(VRPTW)其数学模型,分析了以遗传算法求解该类问题时的染色体表示和有关遗传操作,将VRPTw视为一个多目标优化问题,用Pareto评等技术来求解最优解,并以Solomen基准问题为例验证了该方法的有效性.结果表明:该方法与以往文献中的最好结果具有竞争性.
The Vehicle Routing Problem with Time Windows （VRPTW） and its model were discussed, its chromosome representation and genetic operator for solving VRPTW were analyzed. In this paper, we regard the VRPTW as a multi-objective optimization problem, and represent a Genetic Algorithm solution using the Pareto ranking technique. Finally, a set of well-known Solomon＇s benchmark data were used to prove the effectiveness of the method. The results show that the solutions are competitive with the best known in the literature.
出处
《数学的实践与认识》
CSCD
北大核心
2009年第7期124-130,共7页
Mathematics in Practice and Theory
基金
河南省教育厅自然科学基金(200510464028)
关键词
物流配送
时间窗约束的VRP
遗传算法
多目标优化
logistics distribution
vehicle routing problem with time windows （VRPTW）
genetic algorithm （GA）
multi-objective optimization
