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

DOI10.1007/S40819-019-0662-7MaRDI QIDQ2001827zbMATH OpenOpenAlexWikidataFDO

Authors 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

ant systemsMatlaboptimizationtravelling salesman problem

Mathematics Subject Classification ID

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

Recommendations

• An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms
• A genetic algorithm for traveling salesman problems
• scientific article; zbMATH DE number 2092224
• Travelling salesman problem with Matlab programming
• scientific article; zbMATH DE number 1051038

Cites work

• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Combinatorial optimization. Theory and algorithms
• 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

Cited in

(1)

• scientific article; zbMATH DE number 5205609 (Why is no real title available?)

Describes a project that uses

Uses Software

• Concorde
• Matlab

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2001827)