NEW SIMULATED ANNEALING ALGORITHMS FOR CONSTRAINED OPTIMIZATION

Linet Özdamar () and Chandra Sekhar Pedamallu ()
Additional contact information
Linet Özdamar: Yeditepe University, Department of Systems Engineering, Kayisdagi, Istanbul, Turkey
Chandra Sekhar Pedamallu: New England Biolabs, Inc., 240 County Road, Ipswich, MA 01938, USA

Asia-Pacific Journal of Operational Research (APJOR), 2010, vol. 27, issue 03, 347-367

Abstract: We propose a Population based dual-sequence Non-Penalty Annealing algorithm (PNPA) for solving the general nonlinear constrained optimization problem. The PNPA maintains a population of solutions that are intermixed by crossover to supply a new starting solution for simulated annealing throughout the search. Every time the search gets stuck at a local optimum, this crossover procedure is triggered and simulated annealing search re-starts from a new subspace. In both the crossover and simulated annealing procedures, the objective function value and the total solution infeasibility degrees are treated as separate performance criteria. Feasible solutions are assessed according to their objective function values and infeasible solutions are assessed with regard to their absolute degree of constraint infeasibility. In other words, in the proposed approach, there exist two sequences of solutions: the feasible sequence and the infeasible sequence. We compare the population based dual sequence PNPA with the standard single sequence Penalty Annealing (the PA), and with the random seed dual sequence Non-Penalty Annealing (NPA). Numerical experiments show that PNPA is more effective than its counterparts.

Keywords: Constrained optimization; simulated annealing; penalty and non-penalty methods (search for similar items in EconPapers)
Date: 2010
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0217595910002740
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:apjorx:v:27:y:2010:i:03:n:s0217595910002740

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0217595910002740

Access Statistics for this article

Asia-Pacific Journal of Operational Research (APJOR) is currently edited by Gongyun Zhao

More articles in Asia-Pacific Journal of Operational Research (APJOR) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().