Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/99861
Full metadata record
DC FieldValueLanguage
dc.contributor.authorWang, Lipo.en
dc.contributor.authorTian, Fuyuen
dc.contributor.authorSoong, Boon Heeen
dc.contributor.authorWan, Chunruen
dc.date.accessioned2012-06-12T03:42:59Zen
dc.date.accessioned2019-12-06T20:12:29Z-
dc.date.available2012-06-12T03:42:59Zen
dc.date.available2019-12-06T20:12:29Z-
dc.date.copyright2011en
dc.date.issued2011en
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
dc.identifier.urihttps://hdl.handle.net/10356/99861-
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
dc.language.isoenen
dc.relation.ispartofseriesDifferential equations and dynamical systemsen
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
dc.subjectDRNTU::Engineering::Electrical and electronic engineeringen
dc.titleSolving combinatorial optimization problems using augmented lagrange chaotic simulated annealingen
dc.typeJournal Articleen
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen
dc.identifier.doi10.1007/s12591-011-0084-4en
dc.description.versionAccepted versionen
item.grantfulltextopen-
item.fulltextWith Fulltext-
Appears in Collections:EEE Journal Articles

SCOPUSTM   
Citations 50

5
Updated on Mar 17, 2023

Web of ScienceTM
Citations 50

5
Updated on Mar 17, 2023

Page view(s) 5

898
Updated on Mar 24, 2023

Download(s) 10

409
Updated on Mar 24, 2023

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.