摘要
城市垃圾清运问题可以使用周期多车场车辆路径问题来很好地描述。将这种典型的复杂组合优化问题分为两个阶段依次求解:首先求解整数规划,解决清运周期问题;然后采用一种混合遗传算法解决多车场车辆路径问题,从而可以降低求解难度。
Urban waste collection and transportation problem could be described as periodic multidepot vehicle routing problem. And in order to solve this NP-hard problem, decision could be made in two stages. At first, it is to solve an integer program to assign the periodic transportation time, and then, to solve multi-depot VRPs with a hybrid genetic algorithm, thus reducing the solution difficulty.
出处
《交通标准化》
2009年第19期104-107,共4页
Communications Standardization
关键词
周期
多车场车辆路径问题
城市垃圾清运
periodic
multi-depot VRP
urban waste collection and transportation
