dc.contributor.authorWang, Lipo.
dc.contributor.authorTian, Fuyu
dc.contributor.authorSoong, Boon Hee
dc.contributor.authorWan, Chunru
dc.date.accessioned2012-06-12T03:42:59Z
dc.date.available2012-06-12T03:42:59Z
dc.date.copyright2011en_US
dc.date.issued2011
dc.identifier.citationWang, L., Tian, F., Soong, B. H., & Wan, C. (2011). Solving Combinatorial Optimization Problems Using Augmented Lagrange Chaotic Simulated Annealing. Differential Equations and Dynamical Systems, 19(1-2), 171-179.en_US
dc.identifier.urihttp://hdl.handle.net/10220/8193
dc.description.abstractChaotic simulated annealing (CSA) proposed by Chen and Aihara has been successfully used to solve a variety of combinatorial optimization problems. CSA uses a penalty term to enforce solution validity as in the original Hopfield–Tank approach. There exists a conflict between solution quality and solution validity in the penalty approach. It is often difficult to adjust the relative magnitude of the penalty term, so as to achieve a high quality solution which is at the same time valid. To overcome this, we incorporate augmented Lagrange multipliers into CSA, obtaining a method that we call augmented Lagrange chaotic simulated annealing (AL-CSA). Simulation results on two constrained optimization benchmarks derived from the Hopfield–Tank formulation of the traveling salesman problem show that AL-CSA can maintain CSA’s good solution quality while avoiding the potential difficulties associated with penalty terms. Furthermore, AL-CSA’s convergence time is shorter and choice of system parameters is easier compared to CSA.en_US
dc.language.isoenen_US
dc.relation.ispartofseriesDifferential equations and dynamical systemsen_US
dc.rights© 2011 Foundation for Scientific Research and Technological Innovation. This is the author created version of a work that has been peer reviewed and accepted for publication by Differential Equations and Dynamical Systems, FSRTI. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [http://dx.doi.org/10.1007/s12591-011-0084-4].en_US
dc.subjectDRNTU::Engineering::Electrical and electronic engineering
dc.titleSolving combinatorial optimization problems using augmented lagrange chaotic simulated annealingen_US
dc.typeJournal Article
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen_US
dc.identifier.doihttp://dx.doi.org/10.1007/s12591-011-0084-4
dc.description.versionAccepted versionen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record