Soft Computing

, Volume 21, Issue 15, pp 4387–4398 | Cite as

A novel collaborative optimization algorithm in solving complex optimization problems

  • Wu Deng
  • Huimin Zhao
  • Li Zou
  • Guangyu Li
  • Xinhua Yang
  • Daqing Wu
Methodologies and Application


To overcome the deficiencies of weak local search ability in genetic algorithms (GA) and slow global convergence speed in ant colony optimization (ACO) algorithm in solving complex optimization problems, the chaotic optimization method, multi-population collaborative strategy and adaptive control parameters are introduced into the GA and ACO algorithm to propose a genetic and ant colony adaptive collaborative optimization (MGACACO) algorithm for solving complex optimization problems. The proposed MGACACO algorithm makes use of the exploration capability of GA and stochastic capability of ACO algorithm. In the proposed MGACACO algorithm, the multi-population strategy is used to realize the information exchange and cooperation among the various populations. The chaotic optimization method is used to overcome long search time, avoid falling into the local extremum and improve the search accuracy. The adaptive control parameters is used to make relatively uniform pheromone distribution, effectively solve the contradiction between expanding search and finding optimal solution. The collaborative strategy is used to dynamically balance the global ability and local search ability, and improve the convergence speed. Finally, various scale TSP are selected to verify the effectiveness of the proposed MGACACO algorithm. The experiment results show that the proposed MGACACO algorithm can avoid falling into the local extremum, and takes on better search precision and faster convergence speed.


Genetic algorithm Ant colony optimization algorithm  Chaotic optimization method Multi-strategy Collaborative optimization Complex optimization problem 



The authors would like to thank all the reviewers for their constructive comments. This research was supported by the National Natural Science Foundation of China (U1433124, 51475065), Open Project Program of State Key Laboratory of Mechanical Transmissions (Chongqing University) (SKLMT-KFKT-201416, SKLMT-KFKT-201513), the Natural Science Foundation of Liaoning Province (2015020013), Open Fund of Key Laboratory of Guangxi High Schools for Complex System & Computational Intelligence (15CI06Y), Open Project Program of Guangxi Key laboratory of hybrid computation and IC design analysis (HCIC201507, HCIC201402), Open Project Program of the Traction Power State Key Laboratory of Southwest Jiaotong University (TPL1403), the PAPD fund. The program for the initialization, study, training, and simulation of the proposed algorithm in this article was written with the tool-box of MATLAB 2010b produced by the Math-Works, Inc.


  1. Akpinar S, Mirac Bayhan G, Baykasoglu A (2013) Hybridizing ant colony optimization via genetic algorithm for mixed-model assembly line balancing problem with sequence dependent setup times between tasks. Appl Soft Comput J 13(1):574–589CrossRefGoogle Scholar
  2. Ali RN, Mohammad HF, Niaki STA (2015) A hybrid genetic and imperialist competitive algorithm for green vendor managed inventory of multi-item multi-constraint EOQ model under shortage. Appl Soft Comput J 30(5):353–364Google Scholar
  3. Blum C, Puchinger J, Raidl GR, Roli A (2011) Hybrid metaheuristics in combinatorial optimization: a survey. Appl Soft Comput 11(6):4135–4151CrossRefzbMATHGoogle Scholar
  4. Chen SM, Chien CY (2011) Parallelized genetic ant colony systems for solving the traveling salesman problem. Expert Syst Appl 38(4):3873–3883CrossRefGoogle Scholar
  5. Corchado E, Abraham A (2010) Hybrid intelligent algorithms and applications. Inf Sci 180(14):2633–2634MathSciNetCrossRefGoogle Scholar
  6. Deng W, Chen R, He B, Liu YQ, Yin LF, Guo JH (2012) A novel two-stage hybrid swarm intelligence optimization algorithm and application. Soft Comput 16(10):1707–1722CrossRefGoogle Scholar
  7. Dorigo M, Gambardella LM (1997) Ant colonies for the travelling salesman problem. Biosystems 43(2):73–81CrossRefGoogle Scholar
  8. Duarte A, Laguna M, Marti R (2011) Tabu search for the linear ordering problem with cumulative costs. Comput Optim Appl 48(3):697–715MathSciNetCrossRefGoogle Scholar
  9. Escario JB, Jimenez JF, Giron-Sierra JM (2015) Ant colony extended: experiments on the travelling salesman problem. Expert Syst Appl 42(1):390–410CrossRefGoogle Scholar
  10. Fister I, Perc M, Kamal SM, Fister I (2015) A review of chaos-based firefly algorithms: perspectives and research challenges. Appl Math Comput 252:155–165Google Scholar
  11. Garnier S, Gautrais J, Theraulaz G (2007) The biological principles of swarm intelligence. Swarm Intell 1(1):3–31CrossRefGoogle Scholar
  12. Ghanbari A, Kazemi SMR, Mehmanpazir F, Nakhostin MM (2013) A cooperative ant colony optimization-genetic algorithm approach for construction of energy demand forecasting knowledge-based expert systems. Knowl-Based Syst 39(1):194–206CrossRefGoogle Scholar
  13. Hamzadayi A, Yildiz G (2013) A simulated annealing algorithm based approach for balancing and sequencing of mixed-model U-lines. Comput Ind Eng 66(4):1070–1084CrossRefGoogle Scholar
  14. Holland JH (1977) Adaptation in natural and artificial systems. University of Michigan Press, Ann ArborGoogle Scholar
  15. Jing SY (2014) A hybrid genetic algorithm for feature subset selection in rough set theory. Soft Comput 18(7):1373–1382CrossRefGoogle Scholar
  16. Jovanovic R, Tuba M (2011) An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem. Appl Soft Comput 11(8):5360–5366CrossRefGoogle Scholar
  17. Kromer P, Zelinka I, Snasel V (2014) Behaviour of pseudo-random and chaotic sources of stochasticity in nature-inspired optimization methods. Soft Comput 18(4):619–629CrossRefGoogle Scholar
  18. Lee ZJ, Su SF, Huang CC, Liu KH (2008) Genetic algorithm with ant colony optimization (GA-ACO) for multiple sequence alignment. Appl Soft Comput J 8(1):55–78CrossRefGoogle Scholar
  19. Li WD, Ong SK, Nee AYC (2002) Hybrid genetic algorithm and simulated annealing approach for the optimization of process plans for prismatic parts. Int J Prod Res 40(8):1899–1922CrossRefzbMATHGoogle Scholar
  20. Li BB, Wang L (2007) A hybrid quantum-inspired genetic algorithm for multiobjective flow shop scheduling. IEEE Trans Syst Man Cybern Part B Cybern 37(3):576–591CrossRefGoogle Scholar
  21. Mahi M, Baykan ÖK, Kodaz H (2015) A new hybrid method based on particle swarm optimization, ant colony optimization and 3-opt algorithms for travelling salesman problem. Appl Soft Comput J 30(5):484–490CrossRefGoogle Scholar
  22. Marinakisa Y, Marinaki M (2010) A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem. Comput Oper Res 37(3):432–442MathSciNetCrossRefzbMATHGoogle Scholar
  23. Metaxiotis K, Liagkouras K (2012) Multiobjective evolutionary algorithms for portfolio management: a comprehensive literature review. Expert Syst Appl 39(14):11685–11698CrossRefGoogle Scholar
  24. Okamoto T, Hirata H (2013) Global optimization using a multipoint type quasi-chaotic optimization method. Appl Soft Comput 13(2):1247–1264CrossRefGoogle Scholar
  25. Otero FEB, Freitas AA, Johnson CG (2013) A new sequential covering strategy for inducing classification rules with ant colony algorithms. IEEE Trans Evol Comput 17(1):64–76CrossRefGoogle Scholar
  26. Pan ZQ, Zhang Y, Kwong S (2015) Efficient motion and disparity estimation optimization for low complexity multiview video coding. IEEE Trans Broadcast. doi: 10.1109/TBC.2015.2419824
  27. Pasti R, Castro LND (2006) A neuro-immune network for solving the travelling salesman problem. In Proceedings of 2006 international joint conference on neural networks, Vancouver, pp 3760–3766Google Scholar
  28. Rizk-Allah RM, Zaki EM, El-Sawy AA (2013) Hybridizing ant colony optimization with firefly algorithm for unconstrained optimization problems. Appl Math Comput 224:473–483Google Scholar
  29. Robertson BL, Price CJ, Reale M (2013) CARTopt: a random search method for nonsmooth unconstrained optimization. Comput Optim Appl 56(2):291–315Google Scholar
  30. Sheikhan M, Mohammadi N (2012) Neural-based electricity load forecasting using hybrid of GA and ACO for feature selection. Neural Comput Appl 21(8):1961–1970Google Scholar
  31. Sioud A, Gravel M, Gagné C (2012) A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times. Comput Oper Res 39(10):2415–2424Google Scholar
  32. Tseng LY, Lin YT (2009) A hybrid genetic local search algorithm for the permutation flowshop scheduling problem. Eur J Oper Res 198(1):84–92CrossRefzbMATHGoogle Scholar
  33. Wang XH, Duan HB (2014) A hybrid biogeography-based optimization algorithm for job shop scheduling problem. Comput Ind Eng 73(1):96–114CrossRefGoogle Scholar
  34. Wei LY, Zhao M (2005) A niche hybrid genetic algorithm for global optimization of continuous multimodal functions. Appl Math Comput (N Y) 160(3):649–661MathSciNetCrossRefzbMATHGoogle Scholar
  35. Wen Y, Xu H, Yang JD (2011) A heuristic-based hybrid genetic-variable neighborhood search algorithm for task scheduling in heterogeneous multiprocessor system. Inf Sci 181(3):567–581CrossRefGoogle Scholar
  36. Wen XZ, Shao L, Xue Y, Fang W (2015) A rapid learning algorithm for vehicle classification. Inf Sci 295(1):395–406CrossRefGoogle Scholar
  37. Xing LN, Rohlfshagen P, Chen YW, Yao X (2011) A hybrid ant colony optimization algorithm for the extended capacitated arc routing problem. IEEE Trans Syst Man Cybern Part B Cybern 41(4):1110–1123CrossRefGoogle Scholar
  38. Yanass HH (2013) A review of three decades of research on some combinatorial optimization problems. Pesqui Oper 33(1):11–36CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  • Wu Deng
    • 1
    • 2
    • 3
    • 4
    • 5
  • Huimin Zhao
    • 1
    • 2
    • 5
  • Li Zou
    • 1
    • 3
    • 4
  • Guangyu Li
    • 1
    • 3
  • Xinhua Yang
    • 1
  • Daqing Wu
    • 6
    • 7
  1. 1.Software InstituteDalian Jiaotong UniversityDalianChina
  2. 2.Guangxi Key Laboratory of Hybrid Computation and IC Design AnalysisGuangxi University for NationalitiesNanningChina
  3. 3.The State Key Laboratory of Mechanical TransmissionsChongqing UniversityChongqingChina
  4. 4.Traction Power State Key Laboratory of Southwest Jiaotong UniversityChengduChina
  5. 5.Key Laboratory of Guangxi High Schools for Complex System & Computational IntelligenceGuangxi University for NationalitiesNanningChina
  6. 6.Department of Computer Science and TechnologyUniversity of South ChinaHengyangChina
  7. 7.Nanjing University of Information Science and TechnologyNanjingChina

Personalised recommendations