摘要
针对广泛存在于现代物流配送过程中的两级车辆路径问题,在考虑配送服务耦合性特征的基础上建立了以总成本最小为目标函数的整数规划模型,并提出了求解问题的离散差分进化算法。在离散差分进化算法框架中,采用贪婪算法产生初始解,对一级和二级网络分别进行编码,然后进行变异和交叉操作,并在二级网络求解的基础上求解一级网络。文章采用随机产生的算例对算法求解效果进行验证。结果显示,所建的模型和算法正确有效,在求解大规模问题时也能够获得相对较好的优化结果。
This paper studies a two-echelon vehicle routing problem that is widely existed in the distribution process of the mod- em logistics system. By considering the coupling characteristics of distribution service, the problem is formulated as an integer programming model with the objective of minimizing total distribution cost, and a discrete differential evolution algorithm is pro- posed to solve the model. In the framework of discrete differential evolution algorithm, we encode the first and second network in- dividually, then use greedy algorithm to get the initial solution. The next step is variation and cross. The solution to the first network is based on the second. The proposed algorithm is tested by a random example. The results show that the proposed model and algorithm are correct, and can obtain high-quality solutions.
出处
《物流科技》
2017年第5期1-7,共7页
Logistics Sci-Tech
基金
国家自然科学基金项目
项目编号:71672032
71202151
关键词
两级车辆路径问题
混合整数规划
离散差分进化
two-echelon vehicle routing problem
integer programming
discrete differential evolution algorithm
