# An augmented Lagrangian ant colony based method for constrained optimization

## Author Info

Listed author(s):
• Asghar Mahdavi

()

Registered author(s):

## Abstract

One of the most efficient penalty based methods to solve constrained optimization problems is the augmented Lagrangian algorithm. This paper presents a constrained optimization algorithm to solve continuous constrained global optimization problems. The proposed algorithm integrates the benefit of the continuous ant colony ( $$\hbox {ACO}_\mathrm{R}$$ ACO R ) capability for discovering the global optimum with the effective behavior of the Lagrangian multiplier method to handle constraints. This method is tested on 13 well-known benchmark functions and compared with four other state-of-the-art algorithms. Copyright Springer Science+Business Media New York 2015

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: http://hdl.handle.net/10.1007/s10589-014-9664-x

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.

## Bibliographic Info

Article provided by Springer in its journal Computational Optimization and Applications.

Volume (Year): 60 (2015)
Issue (Month): 1 (January)
Pages: 263-276

as
in new window

 Handle: RePEc:spr:coopap:v:60:y:2015:i:1:p:263-276 DOI: 10.1007/s10589-014-9664-x Contact details of provider: Web page: http://www.springer.com Order Information: Web: http://www.springer.com/math/journal/10589

## References

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

as
in new window

1. Samuel Amstutz, 2011. "Augmented Lagrangian for cone constrained topology optimization," Computational Optimization and Applications, Springer, vol. 49(1), pages 101-122, May.
2. Ernesto Birgin & J. Martínez, 2012. "Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization," Computational Optimization and Applications, Springer, vol. 51(3), pages 941-965, April.
3. Socha, Krzysztof & Dorigo, Marco, 2008. "Ant colony optimization for continuous domains," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1155-1173, March.
4. Y. Zhou & X. Yang, 2012. "Augmented Lagrangian functions for constrained optimization problems," Journal of Global Optimization, Springer, vol. 52(1), pages 95-108, January.
5. Kalyanmoy Deb & Soumil Srivastava, 2012. "A genetic algorithm based augmented Lagrangian method for constrained optimization," Computational Optimization and Applications, Springer, vol. 53(3), pages 869-902, December.
Full references (including those not matched with items on IDEAS)

## Lists

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

## Corrections

When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:60:y:2015:i:1:p:263-276. 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: (Sonal Shukla)

or (Rebekah McClure)

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.