Solving Symmetric and Asymmetric TSPs by Artificial Chemistry
|
 |
|
Post a Comment
|
|
|
|
|
CONTRIBUTORS:
|
|
|
PROCEEDINGS TITLE:
|
|
|
YEAR:
|
2004
|
|
PUB TYPE:
|
Conference Paper in Proceedings
|
|
PAGES:
|
D1 -
n/a
|
|
SUBJECT(S):
|
artificial chemistry; combinatorial optimization; traveling salesman problem; TSP
|
|
DISCIPLINE:
|
Computer Science
|
|
HTTP:
|
http://www.ics.uplb.edu.ph/node/174
|
|
LANGUAGE:
|
English
|
|
PUB ID:
|
103-444-150
(Last edited on
2008/07/19 21:31:37 GMT-6)
|
|
SPONSOR(S):
|
|
|
ABSTRACT:
In this paper we present artificial chemistry (ACHEM) for the solution of combinatorial optimization belonging to the class of NP-Hard problems. ACHEM is a distributed stochastic algorithm that simulates reaction systems of algorithmic objects inspired by natural chemical systems. We apply ACHEM to find solutions to the traveling salesman problem. Results show that ACHEM is an example of the successful use of a natural metaphor to design an optimization algorithm.
|
|
|
|
STATISTICS
|
|
Click on # to view
|
|
Citations
|
|
0
|
|
References
|
|
0
|
|
Comments
|
|
0
|
|
Quality
|
|
0/0.00
|
|
Interest
|
|
0/0.00
|
|
View(er)s
|
|
1/73
|
|
|
|
|
|
|
| Prev |
Next |
|