Solving symmetric and asymmetric TSPs by artificial chemistry
In this chapter 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 t...
Saved in:
Main Authors: | Pabico, Jaderick P., Mendoza, Michael J.M., Gendrano, Ma. Christine A. |
---|---|
Format: | text |
Published: |
Animo Repository
2004
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/6351 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Similar Items
-
A columnar competitive model with simulated annealing for solving combinatorial optimization problems
by: Eu, J.T., et al.
Published: (2014) -
A Bidirectional Graph Neural Network for Traveling Salesman Problems on Arbitrary Symmetric Graphs
by: Yujiao Hua, et al.
Published: (2021) -
Dynamically updating the exploiting parameter in improving performance of ant-based algorithms
by: Dinh, H.T., et al.
Published: (2014) -
Particle swarm optimization-based algorithms for TSP and generalized TSP
by: Shi, X.H., et al.
Published: (2014) -
Comparative analysis of solving traveling salesman problem using artificial intelligence algorithms
by: Brucal, Stanley Glenn E., et al.
Published: (2017)