随机与动态环境下物流配送区域划分与配送路径集成优化问题研究

配送区域划分与配送路径优化是物流研究领域里两个关键的研究问题，目前针对这两个问题的集成优化研究比较有限，特别是在不确定环境下。本项目分别考虑随机顾客和动态顾客情况下，对配送区域划分与配送路径集成优化开展研究，并进行工作时间限制以及多配送中心设置的集成优化问题扩展研究。针对集成优化问题设计融合Benders decomposition分解和启发式搜索的混合式算法进行高效求解。最后在城市快递物流系统规划以及军事维修保障网络系统设计上进行应用验证。本项目旨在通过研究，对相关不确定环境下的配送区域划分与配送路径集成优化问题准确建模并高效求解，为城市物流系统规划和军事维修保障网络系统设计提供决策支持，其具有重要的理论探索研究意义及实际应用价值。

The districting problem and the routing problem are the two core problems in the logistics. To our best knowledge, there exists very limited related works on the integrated optimization on these two problems, called as the "districting-routing" problem, especially under the uncertain environment. This project focusses on the districting-routing problems, considering the stochastic customers and the dynamic customers respectively. It extends the problems by adding the route duration limit and setting the multi-depots, and develops a hyrid algorithm which combines the benders decomposition and the heuristic search for the problem solving. At the end, the models and the algorithms are applied to the planning of the city express logistics and the design of the military maintenance support network system. The target of this project is to provide the decision support for the planning of city logistics system and the design of the military maintenance support network system, through the accurate modelling of the districting-routing problems under uncertain envoirments and the effective solution of the problems. It provides the significance of theoretical investigation and the great value of practical application.