scholarly journals PCB Drill Path Optimization by Combinatorial Cuckoo Search Algorithm

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Wei Chen Esmonde Lim ◽  
G. Kanagaraj ◽  
S. G. Ponnambalam

Optimization of drill path can lead to significant reduction in machining time which directly improves productivity of manufacturing systems. In a batch production of a large number of items to be drilled such as printed circuit boards (PCB), the travel time of the drilling device is a significant portion of the overall manufacturing process. To increase PCB manufacturing productivity and to reduce production costs, a good option is to minimize the drill path route using an optimization algorithm. This paper reports a combinatorial cuckoo search algorithm for solving drill path optimization problem. The performance of the proposed algorithm is tested and verified with three case studies from the literature. The computational experience conducted in this research indicates that the proposed algorithm is capable of efficiently finding the optimal path for PCB holes drilling process.

Author(s):  
Behzad Karimi ◽  
Seyed Taghi Akhavan Niaki ◽  
Amir Hossein Niknamfar ◽  
Mahsa Gareh Hassanlu

The reliability of machinery and automated guided vehicle has been one of the most important challenges to enhance production efficiency in several manufacturing systems. Reliability improvement would result in a simultaneous reduction of both production times and transportation costs of the materials, especially in automated guided vehicles. This article aims to conduct a practical multi-objective reliability optimization model for both automated guided vehicles and the machinery involved in a job-shop manufacturing system, where different machines and the storage area through some parallel automated guided vehicles handle materials, parts, and other production needs. While similar machines in each shop are limited to failures based on either an Exponential or a Weibull distribution via a constant rate, the machines in different shops fail based on different failure rates. Meanwhile, as the model does not contain any closed-form equation to measure the machine reliability in the case of Weibull failure, a simulation approach is employed to estimate the shop reliability to be further maximized using the proposed model. Besides, the automated guided vehicles are restricted to failures according to an Exponential distribution. Furthermore, choosing the best locations of the shops is proposed among some potential places. The proposed NP-Hard problem is then solved by designing a novel non-dominated sorting cuckoo search algorithm. Furthermore, a multi-objective teaching-learning-based optimization, as well as a multi-objective invasive weed optimization are designed to validate the results obtained. Ultimately, a novel AHP-TOPSIS method is carried out to rank the algorithms in terms of six performance metrics.


2020 ◽  
Vol 39 (6) ◽  
pp. 8125-8137
Author(s):  
Jackson J Christy ◽  
D Rekha ◽  
V Vijayakumar ◽  
Glaucio H.S. Carvalho

Vehicular Adhoc Networks (VANET) are thought-about as a mainstay in Intelligent Transportation System (ITS). For an efficient vehicular Adhoc network, broadcasting i.e. sharing a safety related message across all vehicles and infrastructure throughout the network is pivotal. Hence an efficient TDMA based MAC protocol for VANETs would serve the purpose of broadcast scheduling. At the same time, high mobility, influential traffic density, and an altering network topology makes it strenuous to form an efficient broadcast schedule. In this paper an evolutionary approach has been chosen to solve the broadcast scheduling problem in VANETs. The paper focusses on identifying an optimal solution with minimal TDMA frames and increased transmissions. These two parameters are the converging factor for the evolutionary algorithms employed. The proposed approach uses an Adaptive Discrete Firefly Algorithm (ADFA) for solving the Broadcast Scheduling Problem (BSP). The results are compared with traditional evolutionary approaches such as Genetic Algorithm and Cuckoo search algorithm. A mathematical analysis to find the probability of achieving a time slot is done using Markov Chain analysis.


Author(s):  
Yang Wang ◽  
Feifan Wang ◽  
Yujun Zhu ◽  
Yiyang Liu ◽  
Chuanxin Zhao

AbstractIn wireless rechargeable sensor network, the deployment of charger node directly affects the overall charging utility of sensor network. Aiming at this problem, this paper abstracts the charger deployment problem as a multi-objective optimization problem that maximizes the received power of sensor nodes and minimizes the number of charger nodes. First, a network model that maximizes the sensor node received power and minimizes the number of charger nodes is constructed. Second, an improved cuckoo search (ICS) algorithm is proposed. This algorithm is based on the traditional cuckoo search algorithm (CS) to redefine its step factor, and then use the mutation factor to change the nesting position of the host bird to update the bird’s nest position, and then use ICS to find the ones that maximize the received power of the sensor node and minimize the number of charger nodes optimal solution. Compared with the traditional cuckoo search algorithm and multi-objective particle swarm optimization algorithm, the simulation results show that the algorithm can effectively increase the receiving power of sensor nodes, reduce the number of charger nodes and find the optimal solution to meet the conditions, so as to maximize the network charging utility.


Sign in / Sign up

Export Citation Format

Share Document