Skip to main content
SpringerLink
Log in

Key-node-based local search discrete artificial bee colony algorithm for obstacle-avoiding rectilinear Steiner tree construction

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

The obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) problem is a fundamental problem in very large-scale integrated circuit physical design and can be reduced to the Steiner tree problem in graphs (GSTP), which can be solved by using three types of common methods: classic heuristics, local search algorithms, or computational intelligence algorithms. However, classic heuristics have poor solution qualities; local search algorithms easily fall into the problem of the local optimum; and the searching effects of the existing computational intelligence algorithms are poor for this problem. In order to improve the solution quality, we propose a novel discrete artificial bee colony algorithm for constructing an obstacle-avoiding rectilinear Steiner tree. We first generate the escape graph for the OARSMT problem. Then, we search for a near-optimal solution consisting of some edges of escape graph by using the discrete ABC algorithm. We apply a key-node neighborhood configuration for the local search strategy and introduce two local search operators. We then naturally use a key-node-based encoding scheme for representing the feasible solution and obtain a tight searching scope. We employ a modified classic heuristic as the encoder that can produce a feasible solution. Experiments conducted on both general GSTP and very large-scale integrated circuit instances reveal the superior performance of the proposed method in terms of the solution quality among the state-of-the-art algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Hwang F (1976) On Steiner minimal trees with rectilinear distance. SIAM J Appl Math 30(1):104–114. doi:10.1137/0130013

    Article  MATH  MathSciNet  Google Scholar 

  2. Ajwani G, Chu C, Mak W-K (2011) FOARS: FLUTE based obstacle-avoiding rectilinear steiner tree construction. IEEE Trans Comput Aid Des Integr Circ Syst 30(2):194–204. doi:10.1109/TCAD.2010.2096571

    Article  Google Scholar 

  3. Liu C-H, Kuo S-Y, Lee DT, Lin C-S, Weng J-H, Yuan S-Y (2012) Obstacle-avoiding rectilinear steiner tree construction: a Steiner-point-based algorithm. IEEE Trans Comput Aid Des Integr Circ Syst 31(7):1050–1060. doi:10.1109/TCAD.2012.2185050

    Article  Google Scholar 

  4. Lin CW, Chen S-Y, Chi-Feng L, Yao-Wen C, Chia-Lin Y (2008) Obstacle-avoiding rectilinear Steiner tree construction based on spanning graphs. IEEE Trans Comput Aid Des Integr Circ Syst 27(4):643–653. doi:10.1109/TCAD.2008.917583

    Article  Google Scholar 

  5. Li L, Young EFY (2008) Obstacle-avoiding rectilinear Steiner tree construction. In Proceedings of the 2008 IEEE/ACM international conference on computer-aided design, pp 523–528

  6. Long J, Zhou H, Memik SO (2008) EBOARST: an efficient edge-based obstacle-avoiding rectilinear Steiner tree construction algorithm. IEEE Trans Comput Aid Des Integr Circ Syst 27(12):2169–2182. doi:10.1109/TCAD.2008.2006098

    Article  Google Scholar 

  7. Ganley JL, Cohoon JP (1994) Routing a multi-terminal critical net: Steiner tree construction in the presence of obstacles. 1994 IEEE international symposium on circuits and systems, 1994 ISCAS ‘94, vol 1, pp 113–116. doi:10.1109/ISCAS.1994.408768

  8. Karp R (2010) Reducibility among combinatorial problems. In: Jünger M, Liebling TM, Naddef D et al (eds) 50 Years of integer programming 1958–2008. Springer, Berlin, pp 219–241. doi:10.1007/978-3-540-68279-0_8

  9. Takahashi H, Matsuyama A (1980) An approximate solution for the Steiner problem in graphs. Math Jpn 6(24):573–577

    Google Scholar 

  10. Kou L, Markowsky G, Berman L (1981) A fast algorithm for Steiner trees. Acta Informatica 15(2):141–145. doi:10.1007/BF00288961

    Article  MATH  MathSciNet  Google Scholar 

  11. Qu R, Xu Y, Castro J, Landa-Silva D (2013) Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems. J Heuristics 19(2):317–342. doi:10.1007/s10732-012-9198-2

    Article  Google Scholar 

  12. Leung Y, Li G, Xu Z-B (1998) A genetic algorithm for the multiple destination routing problems. IEEE Trans Evol Comput 2(4):150–161. doi:10.1109/4235.738982

    Article  Google Scholar 

  13. Wen-Liang Z, Jian H, Jun Z (2008) A novel particle swarm optimization for the Steiner tree problem in graphs. 2008 IEEE congress on evolutionary computation, pp 2460–2467. doi:10.1109/CEC.2008.4631127

  14. Skorin-Kapov N, Kos M (2006) A GRASP heuristic for the delay-constrained multicast routing problem. Telecommun Syst 32(1):55–69. doi:10.1007/s11235-006-8202-2

    Article  Google Scholar 

  15. Duin C, Voβ S (1997) Efficient path and vertex exchange in steiner tree algorithms. Networks 29(2):89–105. doi:10.1002/(SICI)1097-0037(199703)29:2<89:AID-NET3>3.0.CO;2-7

    Article  MATH  MathSciNet  Google Scholar 

  16. Ribeiro CC, De Souza MC (2000) Tabu search for the Steiner problem in graphs. Networks 36(2):138–146. doi:10.1002/1097-0037(200009)36:2<138:AID-NET9>3.0.CO;2-U

    Article  MATH  MathSciNet  Google Scholar 

  17. MP de Aragao CR, E Uchoa, RF Werneck (2001) Hybrid local search for the steiner problem in graphs. In extended abstracts of the 4th metaheuristics international conference, pp 429–433

  18. Uchoa E, Werneck RF (2012) Fast local search for the steiner problem in graphs. J Exp Algorithm 17(1):2.1–2.22. doi:10.1145/2133803.2184448

    Article  MathSciNet  Google Scholar 

  19. Zhenhua Z, Hua W, Lin Y (2012) An Artificial Bee Colony Optimization algorithm for multicast routing. 2012 14th International conference on advanced communication technology (ICACT), pp 168–172

  20. Karaboga. D (2005) An idea based on honey bee swarm for numerical optimization. Technical report-TR06. Erciyes University, Engineering Faculty, Computer Engineering Department

  21. Karaboga D, Gorkemli B, Ozturk C, Karaboga N (2014) A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif Intell Rev 42(1):21–57. doi:10.1007/s10462-012-9328-0

    Article  Google Scholar 

  22. Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39(3):459–471. doi:10.1007/s10898-007-9149-x

    Article  MATH  MathSciNet  Google Scholar 

  23. Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 8(1):687–697. doi:10.1016/j.asoc.2007.05.007

    Article  Google Scholar 

  24. Karaboga D, Akay B (2009) A comparative study of artificial bee colony algorithm. Appl Math Comput 214(1):108–132. doi:10.1016/j.amc.2009.03.090

    Article  MATH  MathSciNet  Google Scholar 

  25. Sharma T, Pant M (2013) Enhancing the food locations in an artificial bee colony algorithm. Soft Comput 17(10):1939–1965. doi:10.1007/s00500-013-1029-3

    Article  Google Scholar 

  26. Li G, Niu P, Xiao X (2012) Development and investigation of efficient artificial bee colony algorithm for numerical function optimization. Appl Soft Comput 12(1):320–332. doi:10.1016/j.asoc.2011.08.040

    Article  Google Scholar 

  27. W-f Gao, S-y Liu (2012) A modified artificial bee colony algorithm. Comput Oper Res 39(3):687–697. doi:10.1016/j.cor.2011.06.007

    Article  Google Scholar 

  28. Wang L, Zhou G, Xu Y, Wang S, Liu M (2012) An effective artificial bee colony algorithm for the flexible job-shop scheduling problem. Int J Adv Manuf Technol 60(1–4):303–315. doi:10.1007/s00170-011-3610-1

    Article  Google Scholar 

  29. Lei D (2013) Multi-objective artificial bee colony for interval job shop scheduling with flexible maintenance. Int J Adv Manuf Technol 66(9–12):1835–1843. doi:10.1007/s00170-012-4463-y

    Article  Google Scholar 

  30. Han Y-Y, Liang JJ, Pan Q-K, Li J-Q, Sang H-Y, Cao NN (2012) Effective hybrid discrete artificial bee colony algorithms for the total flowtime minimization in the blocking flowshop problem. Int J Adv Manuf Technol 1–18. doi:10.1007/s00170-012-4493-5

  31. Tasgetiren MF, Pan Q-K, Suganthan PN, Oner A (2013) A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion. Appl Math Model 37(10–11):6758–6779. doi:10.1016/j.apm.2013.02.011

    Article  MathSciNet  Google Scholar 

  32. Pan Q-K, Wang L, Li J-Q, Duan J-H (2014) A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation. Omega 45:42–56. doi:10.1016/j.omega.2013.12.004

    Article  Google Scholar 

  33. Rajasekhar A, Kumar Jatoth R, Abraham A (2014) Design of intelligent PID/PIλDμ speed controller for chopper fed DC motor drive using opposition based artificial bee colony algorithm. Eng Appl Artif Intell 29:13–32. doi:10.1016/j.engappai.2013.12.009

    Article  Google Scholar 

  34. Apalak MK, Karaboga D, Akay B (2014) The artificial bee colony algorithm in layer optimization for the maximum fundamental frequency of symmetrical laminated composite plates. Engineering Optimization 46(3):420–437. doi:10.1080/0305215X.2013.776551

    Article  MathSciNet  Google Scholar 

  35. Bose D, Biswas S, Vasilakos AV, Laha S (2014) Optimal filter design using an improved artificial bee colony algorithm. Inf Sci 281:443–461. doi:10.1016/j.ins.2014.05.033

    Article  MathSciNet  Google Scholar 

  36. Kashan MH, Nahavandi N, Kashan AH (2012) DisABC: a new artificial bee colony algorithm for binary optimization. Appl Soft Comput 12(1):342–352. doi:10.1016/j.asoc.2011.08.038

    Article  Google Scholar 

  37. Karaboga D, Ozturk C (2011) A novel clustering approach: artificial Bee Colony (ABC) algorithm. Appl Soft Comput 11(1):652–657. doi:10.1016/j.asoc.2009.12.025

    Article  Google Scholar 

  38. Karaboga D, Okdem S, Ozturk C (2012) Cluster based wireless sensor network routing using artificial bee colony algorithm. Wireless Netw 18(7):847–860. doi:10.1007/s11276-012-0438-z

    Article  Google Scholar 

  39. Alvarado-Iniesta A, Garcia-Alcaraz JL, Rodriguez-Borbon MI, Maldonado A (2013) Optimization of the material flow in a manufacturing plant by use of artificial bee colony algorithm. Expert Syst Appl 40(12):4785–4790. doi:10.1016/j.eswa.2013.02.029

    Article  Google Scholar 

  40. Singh A (2009) An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. Appl Soft Comput 9(2):625–631. doi:10.1016/j.asoc.2008.09.001

    Article  Google Scholar 

  41. Ozturk C, Karaboga D, Gorkemli B (2011) Probabilistic dynamic deployment of wireless sensor networks by artificial bee colony algorithm. Sensors 11(6):6056–6065

    Article  Google Scholar 

  42. Karaboga D, Ozturk C, Karaboga N, Gorkemli B (2012) Artificial bee colony programming for symbolic regression. Inf Sci 209:1–15. doi:10.1016/j.ins.2012.05.002

    Article  Google Scholar 

  43. Areibi S, Yang Z (2004) Effective memetic algorithms for VLSI design automation = genetic algorithms + local search + multi-level clustering. Evol Comput 12(3):327–353. doi:10.1162/1063656041774947

    Article  Google Scholar 

  44. Coe S, Areibi S, Moussa M (2007) A hardware memetic accelerator for VLSI circuit partitioning. Comput Electr Eng 33(4):233–248. doi:10.1016/j.compeleceng.2007.02.003

    Article  MATH  Google Scholar 

  45. Maolin T, Xin Y (2007) A memetic algorithm for VLSI floorplanning. IEEE Trans Syst Man Cybern B Cybern 37(1):62–69. doi:10.1109/TSMCB.2006.883268

    Article  Google Scholar 

  46. Jianli C, Wenxing Z, Ali MM (2011) A hybrid simulated annealing algorithm for nonslicing VLSI floorplanning. IEEE Trans Syst Man Cybern Part C Appl Rev 41(4):544–553. doi:10.1109/TSMCC.2010.2066560

    Article  Google Scholar 

  47. Chen G, Guo W, Chen Y (2010) A PSO-based intelligent decision algorithm for VLSI floorplanning. Soft Comput 14(12):1329–1337. doi:10.1007/s00500-009-0501-6

    Article  Google Scholar 

  48. Zhang H, Ye D (2012) An Artificial bee colony algorithm approach for routing in VLSI. In: Tan Y, Shi Y, Ji Z (eds) Advances in swarm intelligence, vol 7331. Lecture notes in computer science. Springer Berlin, pp 334–341. doi:10.1007/978-3-642-30976-2_40

  49. Koch T, Martin A, Voß S (2000) SteinLib: an updated library on Steiner tree problems in graphs. Technical report. ZIB-Report. Konrad-Zuse-Zentrum fur Informationstechnik Berlin

  50. Hanan M (1966) On Steiner’s problem with rectilinear distance. SIAM Journal on Applied Mathematics 14(2):255–265. doi:10.1137/0114025

    Article  MATH  MathSciNet  Google Scholar 

  51. Lawler EL (1976) The Steiner problem and other dilemmas. In: Combinatorial optimization: networks and matroids. Holt, Rinehart & Winston, New York, pp 290–296

  52. Feo T, Resende MC (1995) Greedy randomized adaptive search procedures. J Glob Optim 6(2):109–133. doi:10.1007/BF01096763

    Article  MATH  MathSciNet  Google Scholar 

  53. Mehlhorn K (1988) A faster approximation algorithm for the Steiner problem in graphs. Information Processing Letters 27(3):125–128. doi:10.1016/0020-0190(88)90066-X

    Article  MATH  MathSciNet  Google Scholar 

  54. Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms, 2nd edn. MIT Press, Cambridge

    MATH  Google Scholar 

  55. Aragão M, Werneck R (2002) On the implementation of MST-based heuristics for the Steiner problem in graphs. In: Mount D, Stein C (eds) Algorithm engineering and experiments, vol 2409. Lecture notes in computer science. Springer, Berlin, pp 1–15. doi:10.1007/3-540-45643-0_1

  56. Huang T, Young EFY (2010) Obstacle-avoiding rectilinear Steiner minimum tree construction: an optimal approach. In: Proceedings of the international conference on computer-aided design, pp 610–613

  57. Warme D, Winter P, Zachariasen M (2001) GeoSteiner software for computing Steiner trees. http://www.diku.dk/hjemmesider/ansatte/martinz/geosteiner/

  58. Civicioglu P (2012) Transforming geocentric cartesian coordinates to geodetic coordinates by using differential search algorithm. Comput Geosci 46:229–247. doi:10.1016/j.cageo.2011.12.011

    Article  Google Scholar 

  59. Civicioglu P (2013) Backtracking Search Optimization Algorithm for numerical optimization problems. Appl Math Comput 219(15):8121–8144. doi:10.1016/j.amc.2013.02.017

    Article  MATH  MathSciNet  Google Scholar 

  60. Civicioglu P (2013) Artificial cooperative search algorithm for numerical optimization problems. Inf Sci 229:58–76. doi:10.1016/j.ins.2012.11.013

    Article  Google Scholar 

  61. Jingqiao Z, Sanderson AC (2009) JADE: adaptive differential evolution with optional external archive. IEEE Trans Evol Comput 13(5):945–958. doi:10.1109/TEVC.2009.2014613

    Article  Google Scholar 

  62. Qin AK, Suganthan PN (2005) Self-adaptive differential evolution algorithm for numerical optimization. In: The 2005 IEEE congress on evolutionary computation, 2005 2–5 Sept. 2005 2005, vol 1782. pp 1785–1791. doi:10.1109/CEC.2005.1554904

Download references

Acknowledgments

The authors acknowledge Dr. Tao Huang, Chih-Hung Liu, Jieyi Long, and Chung-Wei Lin for their kind help.

This work was supported by the National Key Basic Research Special Foundation (NKBRSF) of China (No. 2011CB808000), by the National Science Foundation of China (No. 71231003, No. 11271002), and by Technology Development Foundation of Fuzhou University(2011-XY-17). This work was also supported by the Fujian Province Key Laboratory of Network Computing and Intelligent Information Process under Grant No. 2009J1007.

Author information

Authors and Affiliations

  1. Center for Discrete Mathematics and Theoretical Computer Science, Fuzhou University, No. 2 Xueyuan Road, District of Universities, Fuzhou, 350108, People’s Republic of China

    Hao Zhang & Dong-Yi Ye

  2. College of Mathematics and Computer Science, Fuzhou University, No. 2 Xueyuan Road, District of Universities, Fuzhou, 350108, People’s Republic of China

    Hao Zhang & Dong-Yi Ye

Authors
  1. Hao Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dong-Yi Ye
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dong-Yi Ye.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, H., Ye, DY. Key-node-based local search discrete artificial bee colony algorithm for obstacle-avoiding rectilinear Steiner tree construction. Neural Comput & Applic 26, 875–898 (2015). https://doi.org/10.1007/s00521-014-1760-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-014-1760-4

Keywords

Search

Navigation