mirage

Solving combinatorial optimization problems using augmented lagrange chaotic simulated annealing

DSpace/Manakin Repository

 

Search DR-NTU


Advanced Search Subject Search

Browse

My Account

Solving combinatorial optimization problems using augmented lagrange chaotic simulated annealing

Show full item record

Title: Solving combinatorial optimization problems using augmented lagrange chaotic simulated annealing
Author: Wang, Lipo; Tian, Fuyu; Soong, Boon Hee; Wan, Chunru
Copyright year: 2011
Abstract: Chaotic 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.
Subject: DRNTU::Engineering::Electrical and electronic engineering.
Type: Journal Article
Series/ Journal Title: Differential equations and dynamical systems
School: School of Electrical and Electronic Engineering
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].
Version: Accepted version

Files in this item

Files Size Format View
3. Solving comb ... ic simulated annealing.pdf 102.0Kb PDF View/Open
   

DOI Query

- Get published version (via Digital Object Identifier)
   

This item appears in the following Collection(s)

Show full item record

Statistics

Total views

All Items Views
Solving combinatorial optimization problems using augmented lagrange chaotic simulated annealing 193

Total downloads

All Bitstreams Views
3. Solving combinatorial optimization problems using augmented Lagrange chaotic simulated annealing.pdf 155

Top country downloads

Country Code Views
United States of America 54
China 50
Singapore 16
Iran 4
Myanmar 4

Top city downloads

city Views
Mountain View 49
Beijing 39
Singapore 16
Pars 4
Yangon 4