Solving travelling salesman problem using ant systems: a programmer's approach

DOI10.1007/s40819-019-0662-7zbMath1418.90221OpenAlexW2948292765WikidataQ127752608 ScholiaQ127752608MaRDI QIDQ2001827

M. Divya

Publication date: 11 July 2019

Published in: International Journal of Applied and Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40819-019-0662-7

zbMATH Keywords

optimizationtravelling salesman problemMatlabant systems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Uses Software

• Matlab
• Concorde

Cites Work

• Practical mathematical optimization. An introduction to basic optimization theory and classical and new gradient-based algorithms.
• Strong Combination of Ant Colony Optimization with Constraint Programming Optimization
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Combinatorial optimization. Theory and algorithms

This page was built for publication: Solving travelling salesman problem using ant systems: a programmer's approach