关键词: 时变路网, 生鲜农产品, 开放式车辆路径问题, 改进蚁群算法

Abstract:

The “last kilometer” difficulty of fresh food e-commerce distribution is considered. The measurement function of fresh agricultural products under normal temperature is employed by considering the perishability of fresh agricultural products and that fresh agricultural products are usually distributed by ordinary vehicles. In view of the time-dependent characteristics of urban road network, the calculation method of vehicle travel time under the condition of time-dependent road network is designed. A model of the Open Time-Dependent Vehicle Routing Problem（OTDVRP） is formulated for fresh agricultural products distribution with minimum freshness by considering the factors such as customer demand, time window, freshness of fresh agricultural product delivered to customers, open vehicle routing and flexible vehicle departure time. The objective of the OTDVRP model is to minimize the total distribution cost. An improved ant colony algorithm is designed to solve the problem. Finally, the rationality and effectiveness of the proposed approaches are verified by extensive experimental results. The simulation results show that compared with the closed vehicle routing strategy, the improved ant colony algorithm based on the open vehicle routing strategy can effectively reduce the total distribution cost of fresh food e-commerce, the number of vehicles used and shorten the distance of vehicles. The proposed approaches are reasonable and feasible.

Key words: time-dependent road network, fresh agricultural products, open vehicle routing problem, improved ant colony algorithm