Institutional Login
Welcome!
To use the personalized features of this site, please
log in
or
register
.
If you have forgotten your username or password, we can
help
.
My Menu
Marked Items
Alerts
Order History
Saved Items
All
Favorites
Content Types
All
Publications
Journals
Book Series
Books
Reference Works
Protocols
Subject Collections
Architecture and Design
Behavioral Science
Biomedical and Life Sciences
Business and Economics
Chemistry and Materials Science
Computer Science
Earth and Environmental Science
Engineering
Humanities, Social Sciences and Law
Mathematics and Statistics
Medicine
Physics and Astronomy
Professional and Applied Computing
中文(简体)
中文(繁體)
English
Deutsch
한국어
日本語
Français
Español
العربية
Русский
Book Chapter
A Quickly Searching Algorithm for Optimization Problems Based on Hysteretic Transiently Chaotic Neural Network
Book Series
Lecture Notes in Computer Science
Publisher
Springer Berlin / Heidelberg
ISSN
0302-9743 (Print) 1611-3349 (Online)
Volume
Volume 4492/2007
Book
Advances in Neural Networks – ISNN 2007
DOI
10.1007/978-3-540-72393-6
Copyright
2007
ISBN
978-3-540-72392-9
DOI
10.1007/978-3-540-72393-6_10
Pages
72-78
Subject Collection
Computer Science
SpringerLink Date
Saturday, July 14, 2007
Add to marked items
Add to shopping cart
Add to saved items
Permissions & Reprints
Recommend this chapter
PDF (217.9 KB)
Free Preview
A Quickly Searching Algorithm for Optimization Problems Based on Hysteretic Transiently Chaotic Neural Network
Xiuhong Wang
1
and Qingli Qiao
2
(1)
School of Management, Tianjin University, Tianjin 300072, China
(2)
Department of Biomedical Engineering, Tianjin Medical University, Tianjin 300070, China
Abstract
This paper presents a fast algorithm based on the hysteretic transiently chaotic neural network (HTCNN) model for solving optimization problems. By using hysteretic activation function, HTCNN has higher ability of overcoming drawbacks that suffer from the local minimum. Meanwhile, in order to avoid oscillation and offer a considerable acceleration of converging to the optimal solution, a fast speed strategy is involved in HTCNN. Numerical simulation of a combinatorial optimization problem-assignment problem shows that HTCNN with fast speed strategy (FHTCNN) can overcome drawbacks that suffer from the local minimum and find the global optimal solutions quickly.
Xiuhong
Wang
Email:
Wangxh1965@eyou.com
Qingli
Qiao
Email:
Qlqiao@gmail.com
Fulltext Preview (Small,
Large
)
References secured to subscribers.
more options
Find
Query Builder
Close
|
Clear
Title (ti)
Summary (su)
Author (au)
ISSN (issn)
ISBN (isbn)
DOI (doi)
And
Or
Not
(
)
* (wildcard)
"" (exact)
Within all content
Within this book series
Within this book
Export this chapter
Export this chapter as
RIS
|
Text
Frequently asked questions
|
General information on journals and books
|
Send us your feedback
|
Impressum
|
Contact
© Springer.
Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
MetaPress Privacy Policy
Remote Address: 38.107.191.110 • Server: mpweb05
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)