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 |
---|---|
其他作者: | School of Electrical and Electronic Engineering |
格式: | Article |
語言: | English |
出版: |
2012
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/99861 http://hdl.handle.net/10220/8193 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
相似書籍
-
A noisy chaotic neural network for solving combinatorial optimization problems : stochastic chaotic simulated annealing
由: Wang, Lipo., et al.
出版: (2012) -
Chaotic neural networks for solving combinatorial optimization problems
由: Tian, Fuyu.
出版: (2008) -
A columnar competitive model with simulated annealing for solving combinatorial optimization problems
由: Eu, J.T., et al.
出版: (2014) -
Solving channel assignment problems using local search methods and simulated annealing
由: Lee, Sally Ng Sa., et al.
出版: (2012) -
Solving combinatorial optimization problems by soft computing
由: Li, Sa.
出版: (2008)