Investigating a hybrid simulated annealing and local search algorithm for constrained optimization

European Journal of Operational Research

Volumn 185, Issue 3, 2008, Pages 1230-1245

  Pedamallu, Chandra Sekhar ^a   Ozdamar, Linet ^b  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b IZMIR UNIVERSITY OF ECONOMICS   (Turkey)

Author keywords

Constrained optimization; Feasible sequential quadratic programming; Global and local search; Simulated annealing

Indexed keywords

NONLINEAR ANALYSIS; NUMERICAL METHODS; QUADRATIC PROGRAMMING; RELIABILITY ANALYSIS; SIMULATED ANNEALING; TABU SEARCH;

CONSTRAINED OPTIMIZATION PROBLEMS (COP); FEASIBLE SEQUENTIAL QUADRATIC PROGRAMMING; GLOBAL AND LOCAL SEARCH; HYBRID SIMULATED ANNEALING METHOD (HSA);

CONSTRAINED OPTIMIZATION;

EID: 34848860813     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.06.050     Document Type: Article

References (41)

1. Bennage W.A., and Dhingra A.K. Single and multi-objective structural optimization in discrete continuous variables using simulated annealing. International Journal of Numerical Methods and Engineering 38 (1995) 2753-2773
2. Carlson, S., Shonkwiler, R., Babar, S., Aral, M. 1998. Annealing a genetic algorithm over constraints. SMC 98 Conference. Available from: .
3. Coello C.A.C. Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state of the art. Computational Methods in Applied Mechanics and Engineering 191 (2002) 1245-1287
4. Coconut, Coconut Test Problems on Constrained Optimization Problems - Library2. Available from: .
5. Corana A., Marchesi M., Marini C., and Ridella S. Minimizing multimodal functions of continuous variables with the simulated annealing algorithm. ACM Transactions of Mathamatical Software 13 (1987) 262-279
6. Deb K. An efficient constraint handling method for genetic algorithms. Computational Methods in Applied Mechanics and Engineering 186 (2000) 311-338
7. Dembo R.S. A set of geometric programming test problems and their solutions. Mathematical Programming 10 (1976) 192-213
8. Dekkers A., and Aarts E. Global optimization and simulated annealing. Mathematical Programming 50 (1991) 367-393
9. Epperly, T.G., 1995. Global optimization of nonconvex nonlinear programs using parallel branch and bound, Ph.D dissertation, University of Wisconsin-Madison.
10. Floudas C.A., and Pardalos P.M. A collection of Test Problems for Constrained Global Optimization Algorithms. Lecture Notes in Computer Science vol. 455 (1990), Springer-Verlag
11. Ingber L. Adaptive simulated annealing (ASA): Lessons learned. Control and Cybernetics 25 (1996) 33-54
12. Joines J., and Houck C. On the use of non-stationary penalty functions to solve non-linear constrained optimization problems with GAs. Proceedings of the First IEEE International Conference on Evolutionary Computation (1994), IEEE Press 579-584
13. Hansen P., Jaumard B., and Lu S.-H. An analytical approach to global optimization. Mathematical Programming 52 (1991) 227-254
14. Hedar A.R., and Fukushima M. Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization. Optimization Methods and Software 17 (2002) 891-912
15. Hedar A.R., and Fukushima M. Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization. Optimization Methods and Software 19 (2004) 291-308
16. Hedar, A.R., Fukushima, M., 2005. Derivative-free filter simulated annealing method for constrained continuous global optimization. To appear in the Journal of Global Optimization.
17. Kazarlis S., and Petridis V. Varying fitness functions in genetic algorithms: studying the rate of increase in the dynamic penalty terms. Proceedings of the 5th International Conference on Parallel Problem Solving from Nature (1998), Springer Verlag, Berlin 211-220
18. Kirkpatrick A., Gelatt Jr. C.D., and Vechi M.P. Optimization by simulated annealing. Science 220 (1983) 671-680
19. Lawrence, C.T., Zhou, J.L., Tits, A.L., 1997. User's Guide for CFSQP version 2.5: A Code for Solving (Large Scale) Constrained Nonlinear (minimax) Optimization Problems, Generating Iterates Satisfying All Inequality Constraints, Institute for Systems Research, University of Maryland, College Park, MD.
20. Leite J.P.B., and Topping B.H.V. Parallel simulated annealing for structural optimization. Computers and Structures 73 (1999) 545-564
21. Michalewicz Z. Genetic algorithms, numerical optimization, and constraints. Proceedings of the Sixth International Conference on Genetic Algorithms (1995), Morgan Kaufmann 151-158
22. Michalewicz Z., and Attia N. Evolutionary optimization of constrained problems. Proceedings of the Third Annual Conference on Evolutionary Programming (1994), World Scientific 98-108
23. Michalewicz Z., and Nazhiyath G. GENOCOP III: A Co-evolutionary algorithm for numerical optimization problems with nonlinear constraints. Proceedings of the Second IEEE International Conference on Evolutionary Computation (1995), IEEE Press 647-651
24. Morales, K.A., Quezada, C.C., 1998. A universal eclectic genetic algorithm for constrained optimization. In: Proceedings 6th European Congress on Intelligent Techniques & Soft Computing, EUFIT'98, pp. 518-522.
25. Myung H., Kim J.-H., and Fogel D.B. Preliminary Investigations into a Two-State Method of Evolutionary Optimization on Constrained Problems. Evolutionary Programming (1995) 449-463
26. Özdamar L., and Demirhan M. Experiments with new stochastic global optimization search techniques. Computers and OR 27 (2000) 841-865
27. Schoenauer M., and Michalewicz Z. Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization. Evolutionary Computation 7 (1999) 19-44
28. Shang, Y., Fromherz, M., Crawford, L., 2002. An Efficient Cooperative Solver for Nonlinear Continuous Constraint Problems. In: Int'l Congress of Mathematical Software (ICMS), Beijing, China.
29. Smith A.E., and Coit D.W. Constraint handling techniques - penalty functions. Handbook of Evolutionary Computation (1997), Oxford University Press and Institute of Physics Publishing Ch. C 5.2
30. Swaney, R.E., 1990. Global Solution of algebraic nonlinear programs. AIChE Annual Meeting, Chicago, IL.
31. Visweswaran V., and Floudas C.A. A global optimization algorithm (GOP) for certain classes of nonconvex NLPs-II. Application of theory and test problems. Computers and Chemical Engineering 14 (1990) 1419-1434
32. Wah, B.W., Wang, T., 1999. Constrained simulated annealing with applications in nonlinear continuous constrained global optimization. In: Proc. 11th IEEE Int'l Conf. on Tools with Artificial Intelligence, pp. 381-388.
33. Wah B.W., and Wang T. Tuning strategies in constrained simulated annealing for nonlinear global optimization. International Journal on Artificial Intelligence Tools 9 (2000) 3-25
34. Wah B.W., and Chen Y.X. Optimal anytime constrained simulated annealing for constrained global optimization. In: Dechter R. (Ed). LNCS 1894 (2000), Springer-Verlag 425-440
35. Wong K.P., and Fung C.C. Simulated-annealing-based economic dispatch algorithm. IEE Proceedings Part C 140 (1993) 509-515
36. Wong K.P., and Wong Y.W. Thermal generator scheduling using hybrid genetic/simulated-annealing approach. IEE Proceedings - C Generation Transmission and Distribution 142 (1995) 372-380
37. Wong K.P., and Wong S.Y.W. Combined genetic algorithm/simulated annealing/fuzzy set approach to short-term generation scheduling with take-or-pay fuel contract. IEEE Transactions on Power Systems 11 (1996) 112-118
38. Wong K.P., and Wong S.Y.W. Hybrid genetic/simulated annealing approach to short-term multiple-fuel-constrained generation scheduling. IEEE Transactions on Power Systems 12 (1997) 776-784
39. Wong Y.C., Leung K.S., and Wong C.K. Simulated annealing-based algorithms for the studies of the thermoelastic scaling behavior. IEEE Transactions on Systems, Man, and Cybernetics, Part C 30 (2000) 506-516
40. Yeniay O. Penalty function methods for constrained optimization with genetic algorithms. Mathematical and Computational Applications 10 (2005) 45-56
41. Zhou J.L., and Tits A.L. An SQP Algorithm for finely discretized continuous minimax problems and other minimax problems with many objective functions. SIAM Journal on Optimization 6 (1996) 461-487