Solving symmetric and asymmetric TSPs by artificial chemistry

Authors

Jaderick P. Pabico, University of the Philippines Los Banos
Michael J.M. Mendoza, University of the Philippines Los Banos
Ma. Christine A. Gendrano

College

College of Computer Studies

Department/Unit

Software Technology

Document Type

Archival Material/Manuscript

Publication Date

2004

Abstract

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.

html

Recommended Citation

Pabico, J. P., Mendoza, M. J., & Gendrano, M. A. (2004). Solving symmetric and asymmetric TSPs by artificial chemistry. Retrieved from https://animorepository.dlsu.edu.ph/faculty_research/6351

Disciplines

Computer Sciences

Keywords

Traveling salesman problem; Chemistry—Computer simulation; Combinatorial optimization

Upload File

wf_no