A new class of cutting planes for the symmetric travelling salesman problem
Mathematical Programming: Series A and B
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Traveling Salesman Problems with Profits
Transportation Science
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
RouteCheckr: personalized multicriteria routing for mobility impaired pedestrians
Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility
A genetic algorithm vs. local search methods for solving the orienteering problem in large networks
KES'12 Proceedings of the 16th international conference on Knowledge Engineering, Machine Learning and Lattice Computing with Applications
| Hi-index | 0.00 |
The selective travelling salesman problem (STSP) appears in various applications. The paper presents a new version of this problem called the selective travelling salesman problem on a road network (R-STSP). While in the classical STSP a graph is complete and each vertex can be visited at most once, in R-STSP these two constraints are not obligatory which makes the problem more real-life and applicable. To solve the problem, the memetic algorithm (MA) is proposed. After implementing the MA, computer experiments were conducted on the real transport network in Poland. The comparative study of the MA with the genetic algorithm (GA) shows that the MA outperforms the GA.