中文摘要：

研究了受限单分配枢纽选址问题的特点,以网络运输总成本和固定设施费用之和为最小化目标函数,建立了具有较少变量的混合整数线性规划模型,应用并行蚁群算法对模型进行求解,并结合澳大利亚邮政数据进行选址仿真试验。计算结果表明：对于最难求解的50个节点的双紧约束问题,算法运算时间为3.59 s,远低于已有的其他算法;各算例的运算偏差不大于0.09%。可见,并行蚁群算法具有良好的求解效率和计算稳定性。

英文摘要：

The characteristics of location problem for limited single allocation hub were analyzed.The sum of total network transportation costs and fixed facility costs was taken as the minimum objective function,and a mixed integer linear programming model with fewer variables was set up.Parallel ant colony optimization（P-ACO） was used to solve the model,and correlative simulation test was carried out combined with Australia post data.Calculation result indicates that for the most difficult problem with 50 nodes and double tight constraints,the computational time of proposed model is 3.59 s,which is minimum compared with the other algorithms,and the calculation errors are not more than 0.09%.So,P-ACO has good solution efficiency and calculational stability.2 tabs,7 figs,17 refs.