A Membrane-Inspired Algorithm with Exchange-Tree Mechanism for Traffic Network Transportation Optimization Problem

被引:0
作者
Duan, Yingying [1 ]
Zhou, Kang [1 ]
Zhang, Gexiang [2 ]
Paul, Prithwineel [2 ]
Rong, Haina [2 ]
He, Juanjuan [3 ,4 ]
机构
[1] Wuhan Polytech Univ, Sch Math & Comp, Wuhan 430023, Peoples R China
[2] Southwest Jiaotong Univ, Sch Elect & Engn, Chengdu 610031, Peoples R China
[3] Wuhan Univ Sci & Technol, Coll Comp Sci & Technol, Wuhan, Hubei, Peoples R China
[4] Hubei Prov Key Lab Intelligent Informat Proc & Re, Wuhan, Hubei, Peoples R China
基金
中国国家自然科学基金;
关键词
Traffic network transportation optimization problem; tissue-like P system; particle swarm algorithm; exchange-tree operator; EVOLUTIONARY ALGORITHM; DIFFERENTIAL EVOLUTION; HYBRID APPROACH; P-SYSTEMS; DESIGN;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Traffic network transportation optimization problem (TNTOP) has important applications in logistics distribution fields. In various disciplines, methods about the solutions-termed TNTOP can have shown promising performance from different types of detection, at different conditions. Due to the limitatioins of the calculation speed of traditonal algorithms, it is rare that a simple unmodified method provides complete techniques of tackling large-scale TNTOP. We use the term P systems to solve the above limitatioins. Specifically, it is a tissue-like P system with four cells based on particle swarm algorithm, referred to as MPSO. In this system, the modified prim algorithm and the position-updated mechanism are adopted to generate and update all particle individuals, velocity-updated mechanism and an exchange-tree strategy are adopted to balance exploration and exploitation processes. Besides, some special strategies are also added to this systems. Numerous experiments are presented to verify the performance of the MPSO. The results show that it can generate the individuals of higher quality in shorter computation time when comparing to other benchmark algorithms. These empirical results validate the effectiveness and competitiveness of our proposed algorithm in solving TNTOP in terms of both quality and speed.
引用
收藏
页码:5 / 36
页数:32
相关论文
共 48 条
  • [11] Duan Y., 2016, J COMPUTATIONAL THEO, V13, P3845
  • [12] Modelling and application of fuzzy adaptive minimum spanning tree in tourism agglomeration area division
    Gao, Wei
    Zhang, Qiuluan
    Lu, Zi
    Wu, Dianshuang
    Du, Xiaohui
    [J]. KNOWLEDGE-BASED SYSTEMS, 2018, 143 : 317 - 326
  • [13] Improved Particle Swarm Optimization for Minimum Spanning Tree of Length Constraint Problem
    Hu, Di
    Dai, Peng
    Zhou, Kang
    Ge, Shuangqi
    [J]. PROCEEDINGS OF 8TH INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTATION TECHNOLOGY AND AUTOMATION (ICICTA 2015), 2015, : 474 - 477
  • [14] Effective heuristics for ant colony optimization to handle large-scale problems
    Ismkhan, Hassan
    [J]. SWARM AND EVOLUTIONARY COMPUTATION, 2017, 32 : 140 - 149
  • [15] Kennedy J, 1995, 1995 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS PROCEEDINGS, VOLS 1-6, P1942, DOI 10.1109/icnn.1995.488968
  • [16] Knowles J., 2015, IEEE T EVOLUTIONARY, V4, P125
  • [17] CDEPSO: a bi-population hybrid approach for dynamic optimization problems
    Kordestani, Javidan Kazemi
    Rezvanian, Alireza
    Meybodi, Mohammad Reza
    [J]. APPLIED INTELLIGENCE, 2014, 40 (04) : 682 - 694
  • [18] [李明燏 Li Mingyu], 2017, [公路交通科技, Journal of Highway and Transportation Research and Development], V34, P108
  • [19] The power of time-free tissue P systems: Attacking NP-complete problems
    Liu, Xiangrong
    Suo, Juan
    Leung, Stephen C. H.
    Liu, Juan
    Zeng, Xiangxiang
    [J]. NEUROCOMPUTING, 2015, 159 : 151 - 156
  • [20] Solving dynamical inverse problems by means of Metabolic P systems
    Manca, V.
    Marchetti, L.
    [J]. BIOSYSTEMS, 2012, 109 (01) : 78 - 86