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

id	oai:animorepository.dlsu.edu.ph:faculty_research-7141
record_format	eprints
spelling	oai:animorepository.dlsu.edu.ph:faculty_research-71412022-07-15T00:22:43Z Solving symmetric and asymmetric TSPs by artificial chemistry Pabico, Jaderick P. Mendoza, Michael J.M. Gendrano, Ma. Christine A. 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. 2004-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/faculty_research/6351 Faculty Research Work Animo Repository Traveling salesman problem Chemistry—Computer simulation Combinatorial optimization Computer Sciences
institution	De La Salle University
building	De La Salle University Library
continent	Asia
country	Philippines Philippines
content_provider	De La Salle University Library
collection	DLSU Institutional Repository
topic	Traveling salesman problem Chemistry—Computer simulation Combinatorial optimization Computer Sciences
spellingShingle	Traveling salesman problem Chemistry—Computer simulation Combinatorial optimization Computer Sciences Pabico, Jaderick P. Mendoza, Michael J.M. Gendrano, Ma. Christine A. Solving symmetric and asymmetric TSPs by artificial chemistry
description	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.
format	text
author	Pabico, Jaderick P. Mendoza, Michael J.M. Gendrano, Ma. Christine A.
author_facet	Pabico, Jaderick P. Mendoza, Michael J.M. Gendrano, Ma. Christine A.
author_sort	Pabico, Jaderick P.
title	Solving symmetric and asymmetric TSPs by artificial chemistry
title_short	Solving symmetric and asymmetric TSPs by artificial chemistry
title_full	Solving symmetric and asymmetric TSPs by artificial chemistry
title_fullStr	Solving symmetric and asymmetric TSPs by artificial chemistry
title_full_unstemmed	Solving symmetric and asymmetric TSPs by artificial chemistry
title_sort	solving symmetric and asymmetric tsps by artificial chemistry
publisher	Animo Repository
publishDate	2004
url	https://animorepository.dlsu.edu.ph/faculty_research/6351
_version_	1767196514073968640

Solving symmetric and asymmetric TSPs by artificial chemistry

Similar Items