Solving combinatorial optimization problems using augmented lagrange chaotic simulated annealing

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 sol...

Full description

Saved in:
Bibliographic Details
Main Authors: Wang, Lipo., Tian, Fuyu, Soong, Boon Hee, Wan, Chunru
Other Authors: School of Electrical and Electronic Engineering
Format: Article
Language:English
Published: 2012
Subjects:
Online Access:https://hdl.handle.net/10356/99861
http://hdl.handle.net/10220/8193
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Be the first to leave a comment!
You must be logged in first