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...
Saved in:
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 |
Similar Items
-
A noisy chaotic neural network for solving combinatorial optimization problems : stochastic chaotic simulated annealing
by: Wang, Lipo., et al.
Published: (2012) -
Chaotic neural networks for solving combinatorial optimization problems
by: Tian, Fuyu.
Published: (2008) -
A columnar competitive model with simulated annealing for solving combinatorial optimization problems
by: Eu, J.T., et al.
Published: (2014) -
Solving channel assignment problems using local search methods and simulated annealing
by: Lee, Sally Ng Sa., et al.
Published: (2012) -
Solving combinatorial optimization problems by soft computing
by: Li, Sa.
Published: (2008)