Solving symmetric and asymmetric TSPs by artificial chemistry

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Pabico, Jaderick P., Mendoza, Michael J.M., Gendrano, Ma. Christine A.
Format: text
Published: Animo Repository 2004
Subjects:
Traveling salesman problem
Chemistry—Computer simulation
Combinatorial optimization
Computer Sciences
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
Description
Summary: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 to find solutions to the travelling salesman problem. Results show that ACHEM is an example of the successful use of a natural metaphor to design an optimization algorithm.

Similar Items