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 条
  • [1] [Anonymous], J MEMBRANE COMPUTING
  • [2] [Anonymous], J MEMBRANE COMPUTING
  • [3] [Anonymous], J MEMBRANE COMPUTING
  • [4] [Anonymous], J MEMBRANE COMPUTING
  • [5] [Anonymous], J MEMBRANE COMPUTING
  • [6] [Anonymous], 2019, J APPL MICROBIOL
  • [7] Adaptive acceleration coefficients for a new search diversification strategy in particle swarm optimization algorithms
    Ardizzon, Guido
    Cavazzini, Giovanna
    Pavesi, Giorgio
    [J]. INFORMATION SCIENCES, 2015, 299 : 337 - 378
  • [8] FastICA peel-off for ECG interference removal from surface EMG
    Chen, Maoqi
    Zhang, Xu
    Chen, Xiang
    Zhu, Mingxing
    Li, Guanglin
    Zhou, Ping
    [J]. BIOMEDICAL ENGINEERING ONLINE, 2016, 15
  • [9] A Membrane-Inspired Evolutionary Algorithm Based on Population P Systems and Differential Evolution for Multi-Objective Optimization
    Cheng, Jixiang
    Zhang, Gexiang
    Wang, Tao
    [J]. JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 12 (07) : 1150 - 1160
  • [10] A tissue P system based evolutionary algorithm for multi-objective VRPTW
    Dong, Wenbo
    Zhou, Kang
    Qi, Huaqing
    He, Cheng
    Zhang, Jun
    [J]. SWARM AND EVOLUTIONARY COMPUTATION, 2018, 39 : 310 - 322