Design of Uncapacitated Hub-and-Spoke Logistics Networks with Single Allocation

Journal of Transportation Systems Engineering and Information Technology ›› 2010, Vol. 10 ›› Issue (5): 175-181 .

• Systems Engineering Theory and Methods • Previous Articles Next Articles

Design of Uncapacitated Hub-and-Spoke Logistics Networks with Single Allocation

CUI Xiao-yan¹, LI Xu-hong¹, MAO Hai-jun¹, ZHANG Yong¹, YANG Ping-le²

1. Transportation College, Southeast University, Nanjing 210096, China; 2. Department of Basic Courses, Zhangjiagang Campus of Jiangsu University of Science and Technology, Zhangjiagang 215600, Jiangsu, China

Received:2010-01-19 Revised:2010-06-22 Online:2010-10-25 Published:2010-10-25
Contact: LI Xu-hong

无容量约束单分配轴-辐式物流网络设计

崔小燕¹;李旭宏^*1; 毛海军¹;张永¹;杨平乐²

1.东南大学交通学院，南京 210096；2. 江苏科技大学张家港校区基础部，江苏张家港 215600

通讯作者: 李旭宏
作者简介:崔小燕（1981-），女，河南省潢川人，博士生.
基金资助:
教育部博士点基金（20090092120046）

Abstract

Abstract: 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.

Key words: logistics engineering, p-hub median, ant colony algorithm, variable neighborhood search, hub-and-spoke logistics networks

摘要： 针对无容量约束的单分配轴-辐式物流网络设计问题的特点，为其建立了单分配p-枢纽中位模型，并提出了一种基于蚁群算法的启发式求解算法. 该算法分两步实现：首先利用蚁群算法来确定网络中枢纽节点的位置，然后用另一种启发式算法将非枢纽节点分配给枢纽节点，同时，将一种基于6种邻域结构的变邻域搜索算法作为蚁群算法的局域搜索策略以提升算法的全局搜索能力，并加快收敛速度. 最后结合澳大利亚邮政数据进行了算例仿真实验，并对蚁群算法中参数的合理设置进行了测试分析，实验结果表明,该算法在求解此问题时有着良好的有效性和较快的求解效率.

关键词: 物流工程, p-枢纽中位, 蚁群算法, 变邻域搜索算法, 轴-辐式物流网络

CLC Number:

U491

CUI Xiao-yan, LI Xu-hong, MAO Hai-jun, ZHANG Yong, YANG Ping-le. Design of Uncapacitated Hub-and-Spoke Logistics Networks with Single Allocation[J]. Journal of Transportation Systems Engineering and Information Technology, 2010, 10(5): 175-181 .

崔小燕,李旭宏, 毛海军,张永,杨平乐. 无容量约束单分配轴-辐式物流网络设计[J]. 交通运输系统工程与信息, 2010, 10(5): 175-181 .

Add to citation manager EndNote|Ris|BibTeX

URL: http://www.tseit.org.cn/EN/abstract/abstract18054.shtml

http://www.tseit.org.cn/EN/Y2010/V10/I5/175

References

［1］姚志刚,周伟,王元庆. 轴-辐式运输网络的范围经济问题［J］.交通运输系统工程与信息,2009, 9(1):24-27. ［YAO Z G, ZHOU W, WANG Y Q. Economies of scope of hub and spoke transportation network［J］. Journal of Transportation Systems Engineering and Information Technology, 2009, 9(1):24-27.］
［2］Kratica J, Stanimirovic Z, Tosic D, et al. Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem［J］. European Journal of Operational research, 2007(182):15-28. 
［3］O’Kelly M E. A quadratic integer program for the location of interacting hub facilities［J］. European Journal of Operational Research, 1987(32): 393–404. 
［4］Campell J F. Integer programming formulations of discrete hub location problems［J］. European Journal of Operational Research, 1994(72):387-405. 
［5］Skorin-Kapov D, Skorin-Kapov J. On tabu search for the location interacting hub facilities［J］. European Journal of Operational Research, 1994(73):502-509. 
［6］Ernst A T, Krishnamoorthy M. Efficient algorithms for the uncapacitated single allocation p-hub median problem［J］. Location Science, 1996, 4(3):139-154. 
［7］Perez M, Almeida F, Moreno-Vega J M. Genetic algorithm with multistart search for the p-hub median problem［C］// Proceedings of the 24th EUROMICRO Conference EUROMICRO’98, IEEE Computer Society, 2000:702–707. 
［8］Perez M, Rodri’guez F A, Moreno-Vega J M. On the use of the path relinking for the p-hub median problem ［C］. Evolutionary Computation in Combinatorial Optimization, 2004 (3004): 155–164. 
［9］Perez M, Rodri’guez F A, Moreno-Vega J M. A hybrid VNS-path relinking for the p-hub median problem［J］. IMA Journal of Management Mathematics, 2007, 18(2):157-171. 
［10］Wolf S, Merz P. Evolutionary local search for the super-peer selection problem and the p-hub median problem［C］. Lecture Notes in Computer Science, 2007(4771):1-15. 
［11］Dorigo M, Gambardella L M. Ant colony system: A cooperative learning approach to the traveling salesman problem［J］. IEEE Transactions on Evolutionary Computation, 1997, 1(1):53-66. 
［12］Dorigo M, Caro M D, Gambardella L M. Ant algorithms for discrete optimization［J］. Artificial Life, 1999, 5(2):137-172. 
［13］Randall M. Solution approaches for the capacitated single allocation hub location problem using ant colony optimization［J］. Computational Optimization Applications，2008(39):239-261. 
［14］Roli A, Blum C, Dorigo M. ACO for maximal constraint satisfaction problem［C］. In: Fourth Meta-heuristics International Conference, 2001:187-191. 
［15］Alumur S, Kara B Y. Network hub location problem: the state of the art［J］. European Journal of Operational Research, 2008(190):1-21. 
［16］Chen J F, Wu T H. A note on solution of the uncapacitated single allocation p-hub median problem［J］. Journal of the Chinese Institute of Industrial Engineers, 2008, 25(1):11-17. 
［17］Hansen P, Mladenovic N, Perez J A M. Variable neighborhood search: methods and applications［J］. 4OR A Quarterly Journal of Operations Research, 2008, 6(4):319-360. 
［18］Ernst A T, Krishnamoorthy M. Solution algorithms for the capacitated single allocation hub location problem［J］. Annals of Operations Research, 1999(86):141-159. 
［19］Besasley J. http://people.brunel.ac.uk/~mastjjb/jeb/info.html［DB］. OR-Library. 2005.

[1]	ZHANG Ying-gui , YAO Ying-hua, GAO Quan, LEI Ding-you. Optimization Model and Algorithm of Balanced Loading Layout of Railway Container Mixed Goods [J]. Journal of Transportation Systems Engineering and Information Technology, 2022, 22(2): 214-222.
[2]	JIANG Xiao-hong, CHEN Sha, ZHANG Yi. Calculation Method of Total Carbon Emission and Efficiency of Logistics Enterprises [J]. Journal of Transportation Systems Engineering and Information Technology, 2022, 22(2): 313-321.
[3]	ZHOU Xiao-xiang, HUANG Cheng-feng. Evolutionary Game and its Stability for Joint Distribution Alliance of Rural Logistics [J]. Journal of Transportation Systems Engineering and Information Technology, 2022, 22(1): 265-272.
[4]	WANG Qing-bin , YU Jiang-ning, ZHENG Jian-feng. Interference Management Model for Drop and Pull Transport with New Tasks [J]. Journal of Transportation Systems Engineering and Information Technology, 2021, 21(6): 160-166.
[5]	LIU Wu-sheng , LI Wang, ZHOU Qing, DIE Qian. "Drone-Vehicle" Distribution Routing Optimization Model [J]. Journal of Transportation Systems Engineering and Information Technology, 2021, 21(6): 176-186.
[6]	ZHU Lan , MA Xiao, LIU Zhuo-fan. Time-dependent Green Vehicle Routing Problem [J]. Journal of Transportation Systems Engineering and Information Technology, 2021, 21(6): 187-194.
[7]	QI Ge-qi, ZHANG Zi-xian , WEI Zhen-lin , LI Bao-wen. Risk Evaluation of Express Delivery Goods Based on Semantic Mining [J]. Journal of Transportation Systems Engineering and Information Technology, 2021, 21(4): 248-255.
[8]	YANG Sen-yan,NING Lian-ju,SHANG Pan. Electric Logistics Vehicle Routing Optimization Based on Space-time-state Network [J]. Journal of Transportation Systems Engineering and Information Technology, 2021, 21(2): 196-204.
[9]	YANG Hua-long,XIN Yu-chen, GAO Hao-ran. A Model and Algorithm for Inventory Routing and Pricing Problem with Discretely Distributed Random Disturbance Items [J]. Journal of Transportation Systems Engineering and Information Technology, 2021, 21(2): 211-216.
[10]	XIN Yu-chen, SHI Sheng-nan, YANG Hua-long. An Optimization Model for O2O Chain Stores Distribution Based on Order Splitting [J]. Journal of Transportation Systems Engineering and Information Technology, 2020, 20(5): 212-217.
[11]	ZHAO Zhi-xue, LI Xia-miao. Electric Vehicle Route Optimization for Fresh Logistics Distribution Based on Time-varying Traffic Congestion [J]. Journal of Transportation Systems Engineering and Information Technology, 2020, 20(5): 218-225.
[12]	YU Jiang-xia, DU Hong-ya, LUO Tai-bo. Real-Time Delivery Routing Optimization Based on Customer Classification [J]. Journal of Transportation Systems Engineering and Information Technology, 2020, 20(4): 202-208.
[13]	LIU Jie, LI Hao-dong, ZHANG Meng. Optimization Model and Algorithm of Collaborative Layout for Hierarchical Nodes Considering Nodes and Links Capacity Constrains [J]. Journal of Transportation Systems Engineering and Information Technology, 2020, 20(2): 107-113.
[14]	WU Yue-lin, YUAN Zhen-zhou, CHEN Qiu-fang, XIAO Qing-yu,WANGWen-cheng,WEI Lai. Taxi Pooling Method of Urban Integrated Passenger Transport Hub with Trajectory Similarity [J]. Journal of Transportation Systems Engineering and Information Technology, 2020, 20(2): 188-195.
[15]	YIN Xiao-qing, MO Yu-di, DONG Chen-chen, LIN Yun. Location of Terminal Distribution Station of Urban Cold Chain Logistics Considering Travel Time Reliability [J]. Journal of Transportation Systems Engineering and Information Technology, 2019, 19(6): 176-183.

Design of Uncapacitated Hub-and-Spoke Logistics Networks with Single Allocation

无容量约束单分配轴-辐式物流网络设计

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics