An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms
type: Item
instance of: scholarly article
title: An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms
zbMATH Open document ID: 1161.65334
author: Aybars Uğur
author: Doğan Aydin
published in: Advances in Engineering Software
publication date: 2009-03-30T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C15
zbMATH DE Number: 5535190
zbMATH Keywords: simulation software
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: ant colony optimization
zbMATH Keywords: local search heuristics
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: visualization
zbMATH Keywords: numerical examples
describes a project that uses: TSPLIB
MaRDI profile type: Publication
full work available at URL: j.advengsoft.2008.05.004
OpenAlex ID: W2077300786
cites work: A genetic algorithm for finding a salesman's route
cites work: Q4692508
cites work: Q3785827
cites work: A parallel tabu search algorithm for large traveling salesman problems
cites work: Q4035642
cites work: On the solution of traveling salesman problems
cites work: Q2770502
cites work: Optimization of a 532-city symmetric traveling salesman problem by branch and cut
cites work: Ant colony optimization for power plant maintenance scheduling optimization -- a five-station hydropower system
cites work: Teaching meta-heuristics within virtual learning environments
cites work: Ants can colour graphs
cites work: Ant colony optimization for learning Bayesian networks.
cites work: D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: A new rank based version of the ant system. -- A computational study
cites work: Ant algorithms: theory and applications
cites work: Fast Algorithms for Geometric Traveling Salesman Problems
cites work: Q4490845
DOI: 10.1016/J.ADVENGSOFT.2008.05.004
Recommended article: Q5257503
Recommended article: Q4926249
Recommended article: Q3054723
Recommended article: An improved ant colony algorithm and its application in TSP
Recommended article: Q3016755
Recommended article: Q3517913
Recommended article: Q5165821
Recommended article: Q5257188
Recommended article: Q5422577
Recommended article: Q3461486
description: scientific article; zbMATH DE number 5535190