Improved orthogonal array based simulated annealing for design optimization

Recent research shows that simulated annealing with orthogonal array based neighbourhood functions can help in the search for a solution to a parametrical problem which is closer to an optimum when compared with conventional simulated annealing. Previous studies of simulated annealing analyzed only the main effects of variables of parametrical problems. In fact, both main effects of variables and interactions between variables should be considered, since interactions between variables exist in many parametrical problems. In this paper, an improved orthogonal array based neighbourhood function (IONF) for simulated annealing with the consideration of interaction effects between variables is described. After solving a set of parametrical benchmark function problems where interaction effects between variables exist, results of the benchmark tests show that the proposed simulated annealing algorithm with the IONF outperforms significantly both the simulated annealing algorithms with the existing orthogonal array based neighbourhood functions and the standard neighbourhood functions. Finally, the improved orthogonal array based simulated annealing was applied on the optimization of emulsified dynamite packing-machine design by which the applicability of the algorithm in real world problems can be evaluated and its effectiveness can be further validated.

[1]  Shinn-Ying Ho,et al.  Intelligent evolutionary algorithms for large parameter optimization problems , 2004, IEEE Trans. Evol. Comput..

[2]  H. Szu Fast simulated annealing , 1987 .

[3]  G. Gong,et al.  An adaptive simulated annealing algorithm , 2001 .

[4]  Jozef Kratica,et al.  Solving the simple plant location problem by genetic algorithm , 2001, RAIRO Oper. Res..

[5]  Shinn-Ying Ho,et al.  An orthogonal simulated annealing algorithm for large floorplanning problems , 2004, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[6]  Shinn-Ying Ho,et al.  Optimizing fuzzy neural networks for tuning PID controllers using an orthogonal simulated annealing algorithm OSA , 2006, IEEE Transactions on Fuzzy Systems.

[7]  C. Tsallis,et al.  Generalized simulated annealing , 1995, cond-mat/9501047.

[8]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[9]  Xin Yao,et al.  Simulated annealing with extended neighbourhood , 1991, Int. J. Comput. Math..

[10]  L. Darrell Whitley,et al.  Building Better Test Functions , 1995, ICGA.

[11]  K. B. Haley,et al.  A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems , 1995 .

[12]  H. Szu,et al.  Nonconvex optimization by fast simulated annealing , 1987, Proceedings of the IEEE.

[13]  Colin R. Reeves,et al.  Epistasis in Genetic Algorithms: An Experimental Design Perspective , 1995, ICGA.

[14]  C. R. Joyner,et al.  Propulsion system design optimization using the Taguchi method , 1993 .

[15]  Madhan Shridhar Phadke,et al.  Quality Engineering Using Robust Design , 1989 .

[16]  Xin Yao,et al.  Comparison of Diierent Neighbourhood Sizes in Simulated Annealing , 1993 .

[17]  C. Reeves Predictive measures for problem difficulty , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[18]  Yaw-Yauan Tyan,et al.  An assessment of optimal mixture for concrete made with recycled concrete aggregates , 2004 .

[19]  R. Barton,et al.  Simulated annealing heuristics for the average flow-time and the number of tardy jobs bi-criteria identical parallel machine problem , 1997 .

[20]  최민석,et al.  통계적 접근법에 의한 원통 래핑 공정의 실험 분석 ( Stochastic Approach to Experimental Analysis of Cylindrical Lapping Process ) , 1993 .

[21]  J. S. Hunter,et al.  Statistics for Experimenters: An Introduction to Design, Data Analysis, and Model Building. , 1979 .

[22]  Xin Yao,et al.  Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..

[23]  Shinn-Ying Ho,et al.  OSA: orthogonal simulated annealing algorithm and its application to designing mixed H2/H∞ optimal controllers , 2004, IEEE Trans. Syst. Man Cybern. Part A.

[24]  Shinn-Ying Ho,et al.  A novel orthogonal simulated annealing algorithm for optimization of electromagnetic problems , 2003, IEEE Transactions on Magnetics.

[25]  Mehmet Emin Aydin,et al.  A Distributed Evolutionary Simulated Annealing Algorithm for Combinatorial Optimisation Problems , 2004, J. Heuristics.

[26]  S. M. Kulkarni,et al.  Influence of process parameters on cutting force and torque during drilling of glass–fiber polyester reinforced composites , 2005 .

[27]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[28]  A. Bendell,et al.  Taguchi methods : applications in world industry , 1989 .

[29]  Jan Karel Lenstra,et al.  A local search template , 1998, Comput. Oper. Res..

[30]  M. Locatelli Simulated Annealing Algorithms for Continuous Global Optimization: Convergence Conditions , 2000 .

[31]  Colin R. Reeves,et al.  An Experimental Design Perspective on Genetic Algorithms , 1994, FOGA.

[32]  Yuval Davidor,et al.  Epistasis Variance: A Viewpoint on GA-Hardness , 1990, FOGA.

[33]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[34]  S. Chatterjee,et al.  Genetic algorithms and traveling salesman problems , 1996 .

[35]  Atte Moilanen,et al.  Simulated Evolutionary Optimization and Local Search: Introduction and Application to Tree Search , 2001 .

[36]  Suzannah Yin Wa Wong,et al.  Hybrid simulated annealing/genetic algorithm approach to short-term hydro-thermal scheduling with multiple thermal plants , 2001 .

[37]  David B. Fogel,et al.  An introduction to simulated evolutionary optimization , 1994, IEEE Trans. Neural Networks.

[38]  V. Cerný Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .