{"id":{"repo_id":"unm","oai_identifier":"oai:digitalrepository.unm.edu:ece_etds-1186"},"canonical_url":"https://search.dev.ndltd.org/etd/unm/oai:digitalrepository.unm.edu:ece_etds-1186","repository":{"repo_id":"unm","name":"University of New Mexico","base_url":"https://digitalrepository.unm.edu/do/oai/"},"display":{"title":"A more robust ant colony learning algorithm : with application to travelling salesman problem","abstract":"Graph problems model many real life applications, where the quantity of the nodes often changes with time. In such graphs, the evaluation of shortest tour is important as various guiding and navigation systems use this information. Nodes of a graph, in many applications, often change over time, and evaluation of shortest tour is essential whenever a new node is added or deleted. We propose an algorithm that deals with such situations. We have used the Ant System with a different meta-heuristics, to find the shortest tour in a graph. We have analyzed the performance of our proposed algorithm with other algorithms by using the problem instances given in TSPLIB. The proposed modification to the Ant System heuristics will also work for directed and non-fully connected graphs. We show the use of meta-heuristics that make our algorithm free from stagnation, that is, we prevent the ants from taking up the same tour repeatedly which helps to continuously search for better results. Our approach further adopts a method that is a modification to Gallants Technique, to choose the appropriate convergence within the reasonable computation time.'","abstract_html":"Graph problems model many real life applications, where the quantity of the nodes often changes with time. In such graphs, the evaluation of shortest tour is important as various guiding and navigation systems use this information. Nodes of a graph, in many applications, often change over time, and evaluation of shortest tour is essential whenever a new node is added or deleted. We propose an algorithm that deals with such situations. We have used the Ant System with a different meta-heuristics, to find the shortest tour in a graph. We have analyzed the performance of our proposed algorithm with other algorithms by using the problem instances given in TSPLIB. The proposed modification to the Ant System heuristics will also work for directed and non-fully connected graphs. We show the use of meta-heuristics that make our algorithm free from stagnation, that is, we prevent the ants from taking up the same tour repeatedly which helps to continuously search for better results. Our approach further adopts a method that is a modification to Gallants Technique, to choose the appropriate convergence within the reasonable computation time.'","abstract_has_math":false,"creators":["Nandina, Viswanath"],"institution":null,"degree_name":"Computer Engineering","degree_level":"Thesis","degree_discipline":"Electrical and Computer Engineering","degree_department":null,"school":null,"contributors":["Heileman, Gregory L.","Verzi, Stephen J.","Ghani, Nasir"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2010,"date_issued":"2010-09-09T07:00:00Z","date_published":"2010-09-09T07:00:00Z","updated_at":"2026-07-24T05:27:25Z","subjects":["Ant algorithms","Traveling-salesman problem--Computer simulation."],"languages":["English"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://digitalrepository.unm.edu/ece_etds/187","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Heileman, Gregory L.","Verzi, Stephen J.","Ghani, Nasir"]},{"key":"dc:creator","label":"Author","values":["Nandina, Viswanath"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical and Computer Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis","Masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Computer Engineering"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Ant algorithms","Traveling-salesman problem--Computer simulation."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalrepository.unm.edu/ece_etds/187"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Graph problems model many real life applications, where the quantity of the nodes often changes with time. In such graphs, the evaluation of shortest tour is important as various guiding and navigation systems use this information. Nodes of a graph, in many applications, often change over time, and evaluation of shortest tour is essential whenever a new node is added or deleted. We propose an algorithm that deals with such situations. We have used the Ant System with a different meta-heuristics, to find the shortest tour in a graph. We have analyzed the performance of our proposed algorithm with other algorithms by using the problem instances given in TSPLIB. The proposed modification to the Ant System heuristics will also work for directed and non-fully connected graphs. We show the use of meta-heuristics that make our algorithm free from stagnation, that is, we prevent the ants from taking up the same tour repeatedly which helps to continuously search for better results. Our approach further adopts a method that is a modification to Gallants Technique, to choose the appropriate convergence within the reasonable computation time.'"]},{"key":"dc:title","label":"Title","values":["A more robust ant colony learning algorithm : with application to travelling salesman problem"]}]}],"canonical_facts":{"dc:contributor":["Heileman, Gregory L.","Verzi, Stephen J.","Ghani, Nasir"],"dc:creator":["Nandina, Viswanath"],"dc:description.abstract":["Graph problems model many real life applications, where the quantity of the nodes often changes with time. In such graphs, the evaluation of shortest tour is important as various guiding and navigation systems use this information. Nodes of a graph, in many applications, often change over time, and evaluation of shortest tour is essential whenever a new node is added or deleted. We propose an algorithm that deals with such situations. We have used the Ant System with a different meta-heuristics, to find the shortest tour in a graph. We have analyzed the performance of our proposed algorithm with other algorithms by using the problem instances given in TSPLIB. The proposed modification to the Ant System heuristics will also work for directed and non-fully connected graphs. We show the use of meta-heuristics that make our algorithm free from stagnation, that is, we prevent the ants from taking up the same tour repeatedly which helps to continuously search for better results. Our approach further adopts a method that is a modification to Gallants Technique, to choose the appropriate convergence within the reasonable computation time.'"],"dc:identifier":["https://digitalrepository.unm.edu/ece_etds/187"],"dc:language":["English"],"dc:subject":["Ant algorithms","Traveling-salesman problem--Computer simulation."],"dc:title":["A more robust ant colony learning algorithm : with application to travelling salesman problem"],"thesis:degree_discipline":["Electrical and Computer Engineering"],"thesis:degree_level":["Thesis","Masters"],"thesis:degree_name":["Computer Engineering"]},"updated_at":"2026-07-24T05:27:25Z"}