IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this article

New Simulated Annealing Algorithms For Constrained Optimization

Listed author(s):


    (Yeditepe University, Department of Systems Engineering, Kayisdagi, Istanbul, Turkey)



    (New England Biolabs, Inc., 240 County Road, Ipswich, MA 01938, USA)

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.

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL:
Download Restriction: Access to full text is restricted to subscribers.

File URL:
Download Restriction: Access to full text is restricted to subscribers.

As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

Article provided by World Scientific Publishing Co. Pte. Ltd. in its journal Asia-Pacific Journal of Operational Research.

Volume (Year): 27 (2010)
Issue (Month): 03 ()
Pages: 347-367

in new window

Handle: RePEc:wsi:apjorx:v:27:y:2010:i:03:p:347-367
Contact details of provider: Web page:

Order Information: Email:

No references listed on IDEAS
You can help add them by filling out this form.

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

When requesting a correction, please mention this item's handle: RePEc:wsi:apjorx:v:27:y:2010:i:03:p:347-367. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Tai Tone Lim)

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.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.

This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.