Solution to the travelling salesperson problem using simulated annealing algorithm

MaRDI QIDQ5359418zbMATH OpenFDO

Authors M. A. Rufai, R. M. Alabison, A. Abidemi, Emmanuel J. Dansu

Publication date 25 September 2017

Full work available at URL http://fcag-egypt.com/Journals/EJMAA/Vol5(1)_Papers/Volume5(1)_Paper13_Abstract.html

zbMATH Keywords

combinatorial optimization problemsmetaheuristics solutionsimulated annealing algorithmtravelling salesperson problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A distributed implementation of simulated annealing for the travelling salesman problem
• A new simulated annealing approach for travelling salesman problem
• Solution to traveling salesman problems with simulated annealing partheno genetic algorithm in MATLAB
• scientific article; zbMATH DE number 1051038
• scientific article; zbMATH DE number 770230

Cited in

(2)

• A new simulated annealing approach for travelling salesman problem
• A numerical method by reproducing-kernel approximation for the pantograph equation

Describes a project that uses

Uses Software

• Python

This page was built for publication: Solution to the travelling salesperson problem using simulated annealing algorithm

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