A New Global Routing Optimization Algorithm based on Pigeon Inspired Optimization

During the last few decades, the world has witnessed a surge in the use of electronic goods. However, this surfeit has introduced a new challenge related to the energy and cost optimization of the electronic devices. As a result, researchers primarily tried to solve this problem through algorithmic approaches. This proposed work focuses on solving the Rectilinear Steiner Minimal Tree (RSMT) problem with the help of a metaheuristic algorithm, namely, the Pigeon Inspired Optimization (PIO) algorithm. The performance of the algorithm has been compared with the pre-existing algorithms like PSO and some of its variants on the basis of efficiency, accuracy and execution time of the algorithm. It was observed that the algorithm besides maintaining high stability and accuracy, required lower execution time to descend to the optimal solution within the search space.

[1]  M. Hanan,et al.  On Steiner’s Problem with Rectilinear Distance , 1966 .

[2]  Jian Huang,et al.  A novel particle swarm optimization for the Steiner tree problem in graphs , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[3]  Maurice Clerc,et al.  The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..

[4]  Haibin Duan,et al.  Pigeon-inspired optimization: a new swarm intelligence optimizer for air robot path planning , 2014, Int. J. Intell. Comput. Cybern..

[5]  Melanie E. Moses,et al.  Ant Colony Optimization for power efficient routing in manhattan and non-manhattan VLSI architectures , 2009, 2009 IEEE Swarm Intelligence Symposium.

[6]  R. Eberhart,et al.  Empirical study of particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[7]  Alex Zelikovsky,et al.  Improved Steiner tree approximation in graphs , 2000, SODA '00.

[8]  Subir Kumar Sarkar,et al.  Performance Comparison of PSO and Its New Variants in the Context of VLSI Global Routing , 2018, Particle Swarm Optimization with Applications.

[9]  F. Hwang.  On Steiner Minimal Trees with Rectilinear Distance , 1976 .

[10]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[11]  Vijay V. Vazirani,et al.  On the bidirected cut relaxation for the metric Steiner tree problem , 1999, SODA '99.