TSPSEARCH by Jonas Lundgren

Heuristic method for the Traveling Salesman Problem (TSP) (tsp, traveling salesman pr..., optimization)

tspplot(p,X,nodenum)

tspsearch(X,m)

Traveling Salesman Problem - Genetic Algorithm by Joseph Kirk

Finds a near-optimal solution to a TSP using a GA (optimization, genetic algorithm, tsp)

tsp_ga(xy,dmat,popSize,numIter,showProg,showResult)

Fixed Endpoints Open Traveling Salesman Problem - Genetic Algorithm by Joseph Kirk

Finds a near-optimal solution to a "open" variation of the TSP with fixed endpoints using a GA (optimization, traveling salesman pr..., tsp)

tspof_ga(xy,dmat,popSize,numIter,showProg,showResult)

Fixed Start Open Traveling Salesman Problem - Genetic Algorithm by Joseph Kirk

Finds a near-optimal solution to a "open" variation of the TSP with fixed start points using a GA (optimization, traveling salesman pr..., tsp)

tspofs_ga(xy,dmat,popSize,numIter,showProg,showResult)

Traveling Salesman Problem - Nearest Neighbor by Joseph Kirk

Finds a near-optimal solution to a TSP using Nearest Neighbor (NN) (nearest neighbor, tsp, traveling salesman pr...)

tsp_nn(xy,dmat,popSize,showProg,showResult)

Multiple Traveling Salesmen Problem - Genetic Algorithm by Joseph Kirk

Finds a near-optimal solution to a M-TSP using a GA (multiple traveling sa..., genetic algorithm, tsp)

mtsp_ga(xy,dmat,nSalesmen,minTour,popSize,numIter,showProg,...

Multiple Variable Traveling Salesmen Problem - Genetic Algorithm by Joseph Kirk

Finds a near-optimal solution to a variation of the MTSP with variable number of salesmen using a GA (optimization, multiple traveling sa..., mtsp)

mtspv_ga(xy,dmat,minTour,popSize,numIter,showProg,showResul...

Travelling salesman problem with Genetic algorithm by Maxim Vedenyov

GUI and no GUI versions, with description in docx file (evolution, ga, genetic algorithm)

gch=insert_begining_slow(g1,g2,cp)

gch=insert_begining_slow(g1,g2,cp)

ii=roulette_wheel_indexes(m,prn)

Dynamic Programming solution to the TSP by Elad Kivelevitch

This function solves the Traveling Salesman Problem (TSP) using Dynamic programming (DP). (dynamic programming, tsp, optimization)

[OptimalTour,mincost]=tsp_dp1(cities, Dmatrix)

TSP solver by CE & BK algorithms by Sebastien PARIS

Solve TSP problems with 2 stochastic solvers : CE & BK algorithms (statistics, probability, tsp)

ce_tsp(L , option)

cemcmc_tsp(L , option)

generation_TSP();

Nearest Neighbor algorithm for the Travelling Salesman Problem by Aleks

Computes and plots the shortest path for the random 10-city Travelling Salesman Problem. (tsp, optimization, nearest neighbor)

nn_tsp(cities)

another TSP solver by Yonathan Nativ

a simple TSP local minimum solution. code is very short and simple. (tsp, traveling salesman pr..., solving tsp)

solveTSP( cities, display)

Cross Entropy TSP Solver by Sebastien PARIS

Solve TSP problem with a CE method. (cross entropy, optimization, stochastic optimizati...)

TSP_CE(L , X1 , option)

distmat(V);

generation_TSP();

Solve TSP by MMAS by wang h

Using MAX MIN Ant System to solve Traveling Salesman Problem. (optimization, aco optimization, mmas)

ACO(inputfile)

InterfaceMMAS(TSPfile,AntNum,alpha,beta,rho,MaxITime)

[Dimension,NodeCoord,NodeWeight,Name]=GetTSPData(infile)

Solving Symmetrical and DisSymmetrical TSP base on Ant Colony Algorithm by wang h

Using Ant Colony Optimization Algorithm to solve Traveling Salesman Problem (aco, i want a matlab code ..., optimization)

ACO(inputfile)