Solution of traveling salesman problem by hybrid imperialist competitive algorithm

被引：0
作者：
Pei X.-B. [1 ]
Yu X.-Y. [1 ]
Wang S.-L. [1 ]
机构：
[1] School of Management, Tianjin University of Technology, Tianjin
来源：
Zhejiang Daxue Xuebao (Gongxue Ban)/Journal of Zhejiang University (Engineering Science) | 2019年 / 53卷 / 10期
关键词：
Combined block; Greedy criteria; Hybrid imperialist competitive algorithm (HICA); Probability model; Repeated search strategy; Traveling salesman problem;
D O I：
10.3785/j.issn.1008-973X.2019.10.018
中图分类号：
学科分类号：
摘要：
A hybrid imperialist competitive algorithm (HICA) was proposed aiming at the problem of traveling salesman problem combinatorial optimization. In the framework of imperialist competitive algorithm, the probability model was introduced to record and update the feasible solution, and the probability matrix was used to mine the excellent feasible solution segment combination block in the feasible solution in order to reduce the complexity of imperialist assimilation and improve the quality of feasible solution. The feasible solution was recombined with greedy criteria and insertion search operators in order to achieve fast convergence speed and improve population diversity. An iterative search strategy was proposed to search effectively in different solution spaces to find out the missing key information and avoid local optimization. The mixed empire competition was verified through the simulation test and comparison of the results of TSPLIB standard cases. © 2019, Zhejiang University Press. All right reserved.
引用
收藏
页码：2003 / 2012
页数：9
相关论文
共 24 条
  • [1] Blum C., Roli A., Metaheuristics in combinatorial optimization: overview and conceptual comparison, ACM Computing Surveys, 35, 3, pp. 268-308, (2003)
  • [2] Wu H.-S., Zhang F.-M., Li H., Et al., Discrete wolf group algorithm for solving TSP problem, Control and Decision, 30, 10, pp. 1861-1867, (2015)
  • [3] He Q., Wu Y.-L., Xu T.-W., Application of improved genetic simulated annealing algorithm in TSP optimization, Control and Decision, 33, 2, pp. 219-225, (2018)
  • [4] Shen J.-H., Wang K., Hybrid particle swarm optimization algorithm for traveling salesman problem, Journal of Intelligent System, 7, 2, pp. 174-182, (2012)
  • [5] Xu X.-P., Zhang D.-J., Solving the traveling salesman problem based on the monkey algorithm, Computer Engineering and Application, 54, 2, pp. 144-148, (2018)
  • [6] Liu H.-H., Cui C., Chen J., An improved genetic algorithm for traveling salesman problem, Journal of Beijing Institute of Technology, 33, 4, pp. 390-393, (2013)
  • [7] Atashpaz G.E., Lucas C., Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition, Proceedings of IEE Congress on Evolutionary Computation, pp. 4661-4667, (2007)
  • [8] Guo W.-Q., Ye D.-Y., Optimization of empire competition algorithm based on empire splitting, Computer Applications, 33, pp. 86-90, (2013)
  • [9] Fathy A., Rezk H., Parameter estimation of photovoltaic system using imperialist competitive algorithm, Renewable Energy, 111, 6, pp. 534-542, (2017)
  • [10] Song J., Yang G., Li Y., Et al., Incoherent beam combining based on imperialist competitive algorithm, Optik, 168, pp. 1-9, (2018)
123