Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 30309


Select areas to restrict search in scientific publication database:
10000398
Adapting the Chemical Reaction Optimization Algorithm to the Printed Circuit Board Drilling Problem
Abstract:
Chemical Reaction Optimization (CRO) is an optimization metaheuristic inspired by the nature of chemical reactions as a natural process of transforming the substances from unstable to stable states. Starting with some unstable molecules with excessive energy, a sequence of interactions takes the set to a state of minimum energy. Researchers reported successful application of the algorithm in solving some engineering problems, like the quadratic assignment problem, with superior performance when compared with other optimization algorithms. We adapted this optimization algorithm to the Printed Circuit Board Drilling Problem (PCBDP) towards reducing the drilling time and hence improving the PCB manufacturing throughput. Although the PCBDP can be viewed as instance of the popular Traveling Salesman Problem (TSP), it has some characteristics that would require special attention to the transactions that explore the solution landscape. Experimental test results using the standard CROToolBox are not promising for practically sized problems, while it could find optimal solutions for artificial problems and small benchmarks as a proof of concept.
Digital Object Identifier (DOI):

References:

[1] Goldberg DE (1989) Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, MA, USA.
[2] Kennedy J, Eberhart RC (2001) Swarm Intelligence. MorganKaufmann, San Francisco.
[3] Ong YS, Lim MH, Chen XS (2010) Research Frontier: Memetic Computation Past, Present and Future. IEEE Computational Intelligence Magazine 5(2):24–36.
[4] ChenXS, OngYS, LimMH, TanKC (2011) A Multifacet Survey on Memetic Computation. IEEE Trans Evolutionary Computation 15(5):591–607.
[5] Price K, Storn R, Lampinen J (2005) Differential Evolution: APractical Approach to Global Optimization. Springer, Berlin.
[6] Dorigo M, Stutzle T (2004) Ant Colony Optimization. The MITPress, Cambridge, MA, USA.
[7] Geem ZW, Kim JH, Loganathan GV (2001) A New Heuristic Optimization Algorithm: Harmony Search. Simulation 76(2):60–68.
[8] Lam AYS, Li VOK (2010) Chemical-Reaction-Inspired Metaheuristic for Optimization. IEEE Trans Evolutionary Computation 14(3):381– 399.
[9] E. Rashedi, H. Nezamabadipour, and S. Saryazdi, "GSA: A Gravitational Search Algorithm." Journal of Information of Science 179, 2232-2243, 2009.
[10] Rose Alqasem, Taisir Eldos, “An Efficient cell Placement Algorithm Using Gravitational Search Algorithms”, Journal of Computer Science 9 (8): 943-948, 2013.
[11] Scott Kirkpatrick, ”Optimization by simulated annealing: Quantitative studies”, Journal of Statistical Physics, Vol 34, Issue 5-6, 975-986, 1984.
[12] Jin Xu, Albert Y.S. Lam, Victor O.K. Li, "Chemical Reaction Optimization for the Grid Scheduling Problem," IEEE Communications Society, publication in the IEEE ICC, 2010.
[13] Albert Y.S. Lam and Victor O.K. Li, "Chemical Reaction Optimization for Cognitive Radio Spectrum Allocation, "IEEE Communications Society, Proceedings of Globecom, 2010.
[14] A. Y. S. Lam, V. O. K. Li, and J. J. Q. Yu, “Real-Coded Chemical Reaction Optimization,” IEEE Trans Evolutionary Computation, Vol. 16, No. 3, 339–353, Jun. 2012.
[15] K. Helsgaun, An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic, European Journal Operations Research 126, 106-130, 2000.
[16] Y. Chen, P. Zhang, Optimized Annealing of Traveling Salesman Problem from the nth-Nearest-Neighbor Distribution, Physica A: Statistical Mechanics and its Applications, Vol. 371, Issue 3, 627- 632,2006.
[17] C.-N. Fiechter, A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems, Discrete Applied Mathematics 51, 243-26, 1994.
[18] M. Albayrak, N. Allahverdi, N.: Development a New Mutation Operator to Solve the Traveling Salesman Problem by Aid of Genetic Algorithms, Expert System Applications 38 , 1313-1320, 2011.
[19] N. Mladenović, P. Hansen, Variable neighborhood search, Computational Operations Research 24, 1097-1100, 1997.
[20] J.C. Créput, A. Koukam, A Memetic Neural Network for the Euclidean Traveling Salesman Problem. Neurocomputing 72,1250-1264, 2009.
[21] C.F. Tsai, C.W. Tsai, C.C. Tseng, A New Hybrid Heuristic Approach for Solving Large Traveling Salesman Problem, Information Science. 166,67-81, 2004.
[22] X.H. Shi, Y.C. Liang, H.P.Lee, C. Lu, Q.X. Wang, Particle Swarm Optimization-Based Algorithms for TSP and Generalized TSP, Information Proceeding Letter. 103,169-176, 2007.
[23] Helmi Md Rais, Zulaiha Ali Othman, Abdul Razak Hamdan, “Improved Dynamic Ant Colony System (DACS) on symmetric Traveling Salesman Problem,” International Conference on Intelligent and Advanced Systems,43-48, 2007.
[24] Ahmed Rabie Ginidi Ginidi, Ahmed M. A. M. Kamel, Hassen Taher Dorrah, “Development of New Fuzzy Logic-based Ant Colony Optimization Algorithm for Combinatorial Problems, “Proceedings of the 14th International Middle East Power Systems Conference, Cairo University, Egypt, 2010.
[25] Wolpert DH, Macready WG (1997) No Free Lunch Theorems for Optimization. IEEE Trans Evolutionary Computation 1(1):67–82.
Vol:14 No:02 2020Vol:14 No:01 2020
Vol:13 No:12 2019Vol:13 No:11 2019Vol:13 No:10 2019Vol:13 No:09 2019Vol:13 No:08 2019Vol:13 No:07 2019Vol:13 No:06 2019Vol:13 No:05 2019Vol:13 No:04 2019Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007