Author
Listed:
- 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)
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.
Suggested Citation
Linet Özdamar & Chandra Sekhar Pedamallu, 2010.
"New Simulated Annealing Algorithms For Constrained Optimization,"
Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 27(03), pages 347-367.
Handle:
RePEc:wsi:apjorx:v:27:y:2010:i:03:n:s0217595910002740
DOI: 10.1142/S0217595910002740
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:apjorx:v:27:y:2010:i:03:n:s0217595910002740. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.