基于分层遗传算法的车辆路由和调度研究

Vehicle Routing and Scheduling with Sequential Services Based on the Hierarchical Genetic Algorithm

为了能在当今激烈竞争的市场中生存,物流活动需要细心规划以满足商务和顾客的所有需求.车辆路由和调度问题一直被广泛的研究以满足各种行业的特殊的需求.考虑配送与安装分离特点下车辆路径问题.利用混合整数非线性规划(MINP)模型求解送货和安装时车辆运行的最少时间.提出分层遗传算法对各种大小问题实施求解.计算结果表明分层遗传算法的有效性,也对分层遗传算法和MINP模型两者的性能进行了比较.

To survive in today＇s competitive market the material handling activities need to be planned carefully to satisfy the demand of business＇ and customers＇ need. The vehicle routing and scheduling problems have been studied extensively for various industries with special needs. In this paper, a vehicle routing problem considering unique characteristics of the Delivery and Installation is considered. A mixed-integer nonlinear programming（MINP） model has been presented to minimize the traveling time of delivery and installation vehicles. A hierarchical genetic algorithm has been proposed and implemented to solve problems of various sizes. The computational results show the effectiveness and the efficiency of the proposed hierarchical approach. A performance comparison between the MINP approach and the hierarchical approach is also presented.