唐震霆,胡志华.针对多中心场站下两级选址路径问题的双智能集成算法[J].,2022,62(5):543-550 |
针对多中心场站下两级选址路径问题的双智能集成算法 |
Combination intelligent algorithm for multi-depots two-echelon location routing problem |
|
DOI:10.7511/dllgxb202205013 |
中文关键词:交通工程两级选址路径问题自适应大邻域搜索算法双智能集成算法配送路径 |
英文关键词:traffic engineeringtwo-echelon location routing problemadaptive large neighborhood search algorithmcombination intelligent algorithmdistribution routing |
基金项目:国家自然科学基金资助项目(71871136). |
|
摘要点击次数:182 |
全文下载次数:222 |
中文摘要: |
两级物流网络的构建一直是城市物流领域中的主要课题,中心场站和枢纽点的辐射范围、枢纽点与客户点的对应关系以及配送路径问题一直是两级物流网络的难点.为解决这一系列问题,提出一种基于多中心场站选址路径问题的数学规划,并在拥有两阶段算子的自适应大邻域搜索算法、模拟退火算法的基础上,提出一种双智能集成算法.在两级结构中,使用两阶段算子的自适应大邻域搜索算法解决了每一级节点分配问题后,使用模拟退火算法求解了每一个主节点与其子节点形成内循环的遍历序列——仅考虑内循环为旅行商问题的情况,两级车辆路径问题与节点分配问题的耦合造成其极高的复杂性.最后选取不同量级的数据集对算法性能进行有效性测试,确定算法在一定时限内明显优于数学规划与部分现有的启发式算法,实验结果还说明了枢纽点数量与总成本之间存在一定的效益悖反. |
英文摘要: |
Constructing two-echelon logistics network has always been a major topic in the field of urban logistics. The radiation range of depots and satellites, the correspondence between satellites and customers and the distribution routing problem have been difficulties in two-echelon logistics network. In order to solve these problems, a mathematical programming is proposed for the location routing problem with multi-depots, and a combination intelligent algorithm is raised based on the adaptive large neighborhood search (ALNS) algorithm with two-stage operators and simulated annealing algorithm. In the two-echelon structure, after solving the node assignment problem at each echelon using the ALNS algorithm with two-stage operators, the ergodic sequence of the inner loop formed by each master node and its child nodes is decided by simulated annealing algorithm - only the case where the inner loop is the traveling salesman problem is considered, and the coupling of the two-echelon vehicle routing problem and the node assignment problem results in a high level of complexity. Finally, the performance of the algorithm is tested on datasets with different magnitudes, and it is determined that the algorithm significantly outperforms mathematical programming and some existing heuristic algorithms within a certain time limit, and the experimental results also illustrate the paradox of effectiveness between the number of satellites and the overall cost. |
查看全文查看/发表评论下载PDF阅读器 |
| --> 关闭 |