TSP solver by CE & BK algorithms
Solve the classic Travel Sale Man problem with Cross-Entropy method (CE) (parametric approach) and the Botev-Kroeze (BK) (non-parametric approach) optimization algorithm
Please run the 2 demo files :
demo_ce_tsp.m
demo_cemcmc_tsp.m
Please run mexme_cebk.m to recompile mex files on your own platform (be sure that mex -setup is done before)
References : http://www.maths.uq.edu.au/~botev/
http://iew3.technion.ac.il/CE/
Cite As
Sebastien PARIS (2024). TSP solver by CE & BK algorithms (https://www.mathworks.com/matlabcentral/fileexchange/21258-tsp-solver-by-ce-bk-algorithms), MATLAB Central File Exchange. Retrieved .
MATLAB Release Compatibility
Platform Compatibility
Windows macOS LinuxCategories
- MATLAB > Mathematics > Graph and Network Algorithms > Shortest Path > Traveling Salesman (TSP) >
- Mathematics and Optimization > Optimization Toolbox > Linear Programming and Mixed-Integer Linear Programming > Solver-Based Linear Programming >
Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.