Cuckoo Search Algorithm for Optimization of Sequence in PCB Holes Drilling Process

Lim, Wei Chen Esmonde; Kanagaraj, G.; Ponnambalam, S. G.

doi:10.1007/978-81-322-1007-8_18

Cited by 18 publications

(7 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Similar to TSP, another problem is PCB Holes Drilling. CS has been adapted to solve this problem in [87].…”

Section: E Cuckoo Searchmentioning

confidence: 99%

See 1 more Smart Citation

Investigating Performance of Various Natural Computing Algorithms

Chawda¹,

Patel²

2017

IJISA

View full text Add to dashboard Cite

Abstract-Nature is there since millenniums. Natural elements have withstood harsh complexities since years and have proved their efficiency in tackling them. This aspect has inspired many researchers to design algorithms based on phenomena in the natural world since the last couple of decades. Such algorithms are known as natural computing algorithms or nature inspired algorithms. These algorithms have established their ability to solve a large number of real-world complex problems by providing optimal solutions within the reasonable time duration. This paper presents an investigation by assessing the performance of some of the well-known natural computing algorithms with their variations. These algorithms include Genetic Algorithms, Ant Colony Optimization, River Formation Dynamics, Firefly Algorithm and Cuckoo Search. The Traveling Salesman Problem is used here as a test bed problem for performance evaluation of these algorithms. It is a kind of combinatorial optimization problem and known as one the most famous NP-Hard problems. It is simple and easy to understand, but at the same time, very difficult to find the optimal solution in a reasonable time -particularly with the increase in a number of cities. The source code for the above natural computing algorithms is developed in MATLAB R2015b and applied on several TSP instances given in TSPLIB library. Results obtained are analyzed based on various criteria such as tour length, required iterations, convergence time and quality of solutions. Conclusions derived from this analysis help to establish the superiority of Firefly Algorithms over the other algorithms in comparative terms.

show abstract

“…Similar to TSP, another problem is PCB Holes Drilling. CS has been adapted to solve this problem in [87].…”

Section: E Cuckoo Searchmentioning

confidence: 99%

“…To represent a random tour, as given in [87], a vector of random values between 0 and 1 is generated. After this, in iterative process, a new solution is generated using equation, (10) where α is a constant value and rand represents random values between -1 and 1.…”

Section: E Cuckoo Searchmentioning

confidence: 99%

Investigating Performance of Various Natural Computing Algorithms

Chawda¹,

Patel²

2017

IJISA

View full text Add to dashboard Cite

show abstract

“…PCB delik delme işleminde, Lim vd. [17], en kısa delim yoluna ilişkin sıralamanın eniyilemesi (sequence optimization) için Cuckoo arama algoritması kullanmışlardır. Ismail vd.…”

Section: Literatür Taramasıunclassified

Baskılı Devre Kartlarındaki Delik Alanlarının Görüntü İşleme Teknikleri Kullanılarak Tespit Edilmesi ve Potansiyel Delim Güzergâhının Genetik Algoritmalar ile Eniyilemesi

Karakoç¹

2017

SDÜ Fen Bil Enst Der

View full text Add to dashboard Cite

Baskılı devre kartı, Kontrol sistemi, Görüntü işleme, Genetik algoritmalar, Yerel arama, Gezgin satıcı problemi Özet: Bir elektronik devrenin fiziksel gerçeklemesi, bir elektronik kartın Baskı Devresini (PCB) delme işlemini gerektirir. Delinecek deliklerin konumlarının ve konum sırasının ise bu işlemi yerine getirecek Kontrol Sistemi tarafından bilinmesi gerekir. Bu çalışmada, bu işlemin düşük maliyetle ve hızlı bir biçimde gerçekleştirilebilmesi için gerekli bilgileri bir kontrol sistemine sağlayacak yöntemler ele alınmaktadır. Bu bilgiler, PCB üzerine yerleştirilecek elektronik devre elemanlarının konumları ve bu konumları içeren en kısa güzergâhtır. Konumlar, bilgisayar ortamındaki iki-boyutlu PCB görüntüsüne Görüntü İşleme teknikleri uygulanarak tespit edilir. Kontrol sisteminin takip edeceği en kısa güzergâh ise Genetik Algoritmalar ve Yerel Arama tabanlı melez bir algoritma ile Gezgin Satıcı Problemi çözülerek belirlenir. Önerilen bütünleşik yöntem bilgisayar benzetimleri ile desteklenmiş ve tüm delik konumlarını içeren çok daha kısa güzergâhlar elde edilmiştir.

show abstract

“…Zhu and Zhang (2008) employed the particle swarm method to minimize the CNC drilling path. Furthermore, Lim et al (2012Lim et al ( , 2014 used cuckoo search (CS), which was inspired by the egg selection method of the cuckoo, for searching for the shortest CNC drilling path. Genetic algorithms (GAs), which are classical searching methods, have been developed for obtaining the optimal path (Al-Sahib and Abdulrazzaq, 2014;Mansour et al, 2013;Qudeiri et al, 2006Qudeiri et al, , 2013.…”

Section: Introductionmentioning

confidence: 99%

“…These three problems are worth studying because they are based on real problems related to PCB drilling and many previous researchers have used them to verify the efficiency of path optimization methods. Lim et al (2012) solved Workpiece 1 (with nine hole positions) by using CS as the optimizer; Zhu and Zhang (2008) had previously studied the same problem case by using particle swarm optimization (PSO) as the solver. Workpiece 2 has been solved using gravitational search (Omar et al, 2014), CS (Lim et al, 2012), the firefly algorithm (Ismail et al, 2012), and PSO (Zhu and Zhang, 2008).…”

Section: Introductionmentioning

confidence: 99%

Path optimization of CNC PCB drilling using hybrid Taguchi genetic algorithm

Al-Janan

Liu

2016

Kybernetes

View full text Add to dashboard Cite

Purpose – In this study, the hybrid Taguchi genetic algorithm (HTGA) was used to optimize the computer numerical control-printed circuit boards drilling path. The optimization was performed by searching for the shortest route for the drilling path. The number of feasible solutions is exponentially related to the number of hole positions. The paper aims to discuss these issues. Design/methodology/approach – Therefore, a traveling cutting tool problem (TCP), which is similar to the traveling salesman problem, was used to evaluate the drilling path; this evaluation is considered an NP-hard problem. In this paper, an improved genetic algorithm embedded in the Taguchi method and a neighbor search method are proposed for improving the solution quality. The classical TCP problems proposed by Lim et al. (2014) were used for validating the performance of the proposed algorithm. Findings – Results showed that the proposed algorithm outperforms a previous study in robustness and convergence speed. Originality/value – The HTGA has not been used for optimizing the drilling path. This study shows that the HTGA can be applied to complex problems.

show abstract

Cuckoo Search Algorithm for Optimization of Sequence in PCB Holes Drilling Process

Cited by 18 publications

References 17 publications

Investigating Performance of Various Natural Computing Algorithms

Investigating Performance of Various Natural Computing Algorithms

Baskılı Devre Kartlarındaki Delik Alanlarının Görüntü İşleme Teknikleri Kullanılarak Tespit Edilmesi ve Potansiyel Delim Güzergâhının Genetik Algoritmalar ile Eniyilemesi

Path optimization of CNC PCB drilling using hybrid Taguchi genetic algorithm

Contact Info

Product

Resources

About