摘要
针对无容量约束的单分配轴-辐式物流网络设计问题的特点,为其建立了单分配p-枢纽中位模型,并提出了一种基于蚁群算法的启发式求解算法.该算法分两步实现:首先利用蚁群算法来确定网络中枢纽节点的位置,然后用另一种启发式算法将非枢纽节点分配给枢纽节点,同时,将一种基于6种邻域结构的变邻域搜索算法作为蚁群算法的局域搜索策略以提升算法的全局搜索能力,并加快收敛速度.最后结合澳大利亚邮政数据进行了算例仿真实验,并对蚁群算法中参数的合理设置进行了测试分析,实验结果表明,该算法在求解此问题时有着良好的有效性和较快的求解效率.
In this paper,an uncapacitated single allocation p-hub median model is developed considering the characters of the uncapacitated hub-and-spoke logistics networks.A heuristic algorithm based on ant colony system is presented to solve the mathematic formulation.The ant colony system is applied to locate the hub nodes,and then a heuristics algorithm is used to assign the non-hub nodes to the hub nodes.Meanwhile,a variable neighborhood search algorithm with six neighborhood structures is implemented as the local search procedure for the ant colony system to improve the overall search ability of this algorithm and speed up the convergence process.Finally,a computational experiment is performed with the AP data set,and a test is carried out for the reasonable selection of the parameters in ant colony system.The experimental results indicate the algorithm is feasible to the problem and has good efficiency in finding the optimization solution.
出处
《交通运输系统工程与信息》
EI
CSCD
2010年第5期175-181,共7页
Journal of Transportation Systems Engineering and Information Technology
基金
教育部博士点基金(20090092120046)
关键词
物流工程
p-枢纽中位
蚁群算法
变邻域搜索算法
轴-辐式物流网络
logistics engineering
p-hub median
ant colony algorithm
variable neighborhood search
hub-and-spoke logistics networks
