• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Liu Yang, Feng Xiang, Yu Huiqun, Luo Fei. Physarum Dynamic Optimization Algorithm Based on Energy Mechanism[J]. Journal of Computer Research and Development, 2017, 54(8): 1772-1784. DOI: 10.7544/issn1000-1239.2017.20170343
Citation: Liu Yang, Feng Xiang, Yu Huiqun, Luo Fei. Physarum Dynamic Optimization Algorithm Based on Energy Mechanism[J]. Journal of Computer Research and Development, 2017, 54(8): 1772-1784. DOI: 10.7544/issn1000-1239.2017.20170343

Physarum Dynamic Optimization Algorithm Based on Energy Mechanism

More Information
  • Published Date: July 31, 2017
  • With the rapid development of artificial intelligence and big data, the explosive growth of big data and problem has grown in complexity, which leads to parallel intelligent computing demand increasing. Traditional theoretical models and methods are faced with severe challenges. Physics law and biological method inspired from nature has gradually become a hot spot in the present new period. Inspired by the foraging behavior of physarum, an dynamic algorithm based on energy mechanism is presented. Physarum-energy dynamic optimization algorithm (PEO) is being raised for overcome the drawbacks of physarum algorithm. According to physarum’s dynamic characteristics, the energy mechanism is introduced in PEO which aims to overcome the shortcomings of the existing physarum algorithm, such as its poor information interaction ability in whole. In addition, PEO develops age factor concept and disturbance mechanism, in order to adjust PEOs optimization ability and convergence speed in different age stages, and the convergence of algorithm model is proved through theoretical point of view. Finally, the validity and convergence of PEO are proved by experiments in TSP data set, and the main parameters of PEO are analyzed through experiments. When faced with complex problems, the simulation result comparison analysis between PEO and other optimization algorithms show that PEO is significantly better than other algorithm and PEO has the capability of high accuracy and fast convergence.
  • Related Articles

    [1]Wang Yuan, Chen Ming, Xing Lining, Wu Yahui, Ma Wubin, Zhao Hong. Deep Intelligent Ant Colony Optimization for Solving Travelling Salesman Problem[J]. Journal of Computer Research and Development, 2021, 58(8): 1586-1598. DOI: 10.7544/issn1000-1239.2021.20210320
    [2]Liao Haibin, Xu Bin. Robust Face Expression Recognition Based on Gender and Age Factor Analysis[J]. Journal of Computer Research and Development, 2021, 58(3): 528-538. DOI: 10.7544/issn1000-1239.2021.20200288
    [3]Dong Xueshi, Dong Wenyong, Cai Yongle. Hybrid Algorithm for Colored Bottleneck Traveling Salesman Problem[J]. Journal of Computer Research and Development, 2018, 55(11): 2372-2385. DOI: 10.7544/issn1000-1239.2018.20180009
    [4]Dong Xueshi, Dong Wenyong, Wang Yufeng. Hybrid Algorithms for Multi-Objective Balanced Traveling Salesman Problem[J]. Journal of Computer Research and Development, 2017, 54(8): 1751-1762. DOI: 10.7544/issn1000-1239.2017.20170347
    [5]Feng Xiang, Ma Meiyi, and Yu Huiqun. Lake-Energy Optimization Algorithm for Travelling Salesman Problem[J]. Journal of Computer Research and Development, 2013, 50(9): 2015-2027.
    [6]Wang Gang and Luo Zhigang. A Polynomial Time Approximation Scheme for the Traveling Salesman Problem in Curved Surfaces[J]. Journal of Computer Research and Development, 2013, 50(3): 657-665.
    [7]Ji Junzhong, Huang Zhen, Liu Chunnian, and Dai Qiguo. An Ant Colony Algorithm Based on Multiple-Grain Representation for the Traveling Salesman Problems[J]. Journal of Computer Research and Development, 2010, 47(3): 434-444.
    [8]Ji Junzhong, Huang Zhen, and Liu Chunnian. A Fast Ant Colony Optimization Algorithm for Traveling Salesman Problems[J]. Journal of Computer Research and Development, 2009, 46(6): 968-978.
    [9]Jiang He, Zhang Xianchao, Che Haoyang, Chen Guoliang. A Multi-Commodity Flow Linear Programming with Polynomial Constraints for Black and White Traveling Salesman Problem[J]. Journal of Computer Research and Development, 2007, 44(10): 1796-1800.
    [10]Zhao Weizhong, Feng Haodi, and Zhu Daming. Improvement and Implementation of a Polynomial Time Approximation Scheme for Euclidean Traveling Salesman Problem[J]. Journal of Computer Research and Development, 2007, 44(10): 1790-1795.

Catalog

    Article views (1437) PDF downloads (581) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return