Abstract: To adapt the transformation of logistics demand from few varieties with large batch to many varieties with small batch,a mathematical model of two-echelon location-routing problem was established,and the artificial bee colony algorithm with variable neighborhood search and path relinking was put forward to solve this model.LINGO was used to solve small scale two-echelon location-routing problem.Basic artificial bee colony algorithm,artificial bee colony algorithm with path relinking,artificial bee colony algorithm with variable neighborhood search,artificial bee colony algorithm with path relinking and variable neighborhood search were applied to solve three groups of larger scale two-echelon location-routing problem separately.The results showed that the proposed mathematical model was correct,and the proposed algorithm not only had better optimization results,but also had better convergence.

Key words: two-echelon location-routing problem, artificial bee colony algorithm, path relinking, variable neighborhood search, logistics

摘要： 为适应物流需求从少品种大批量到多品种少批量的转变,建立了两级定位—路径问题的数学模型,提出求解该问题的路径重连变邻域搜索人工蜂群算法,即在基本人工蜂群算法中嵌入近年来广泛应用于组合优化问题求解的两种启发式搜索策略——变邻域搜索和路径重连。采用Lingo求解小规模两级定位—路径问题;选取三组较大规模的两级定位—路径问题,分别采用基本人工蜂群算法、路径重连人工蜂群算法、变邻域搜索人工蜂群算法和路径重连变邻域搜索人工蜂群算法进行求解。结果表明,所建数学模型是正确的,所提算法不但能够取得更好的优化结果,而且具有更好的收敛性。

关键词: 两级定位&mdash, 路径问题, 人工蜂群算法, 路径重连, 变邻域搜索, 物流