Add to ORKGThesis deals with solving large-scale traveling salesman problem. The aim is to find the best possible solution within a short time. Most widely used heuristics was compared and most efficient proved to be Lin-Kernighan. This heuristic combined with the stochastic algorithm brings even better results than the Lin-Kernighan heuristic itself
AbstractTabu search is a general heuristic procedure for global optimization which has been successf...
The Lin and Kernighan’s algorithm for the single objective Traveling Salesman Problem (TSP) is one o...
Abstract—This work proposes an evolutionary algorithm, called the heterogeneous selection evolutiona...
We discuss several issues that arise in the implementation of Martin, Otto, and Felten's Chaine...
This paper puts forward a constructive heuristic algorithm called the method of inserting the minimu...
An algorithm for solving the large-scale Traveling Salesman Problem is presented. Research into past...
This paper presents a self-contained introduction into algorithmic and com-putational aspects of the...
The multilevel paradigm has recently been applied to the travelling salesman problem with consid-era...
The Traveling Salesman Problem (TSP) is a very hard optimization problem in the field of operations ...
This paper provides the survey of the heuristics solution approaches for the traveling salesman prob...
Graduation date: 1981This paper demonstrates the effectiveness of a heuristic for\ud the Traveling S...
An n log n randomized method based on POPMUSIC metaheuristic is proposed for generating reasonably g...
The Traveling Thief Problem (TTP) is a novel problem that combines the well-known Traveling Salesman...
ABSTRACT. The main objective of the paper is to present an algorithm for finding a solution to the t...
The method has been tested on instances with billions of cities. For a lot of problem instances of t...
AbstractTabu search is a general heuristic procedure for global optimization which has been successf...
The Lin and Kernighan’s algorithm for the single objective Traveling Salesman Problem (TSP) is one o...
Abstract—This work proposes an evolutionary algorithm, called the heterogeneous selection evolutiona...
We discuss several issues that arise in the implementation of Martin, Otto, and Felten's Chaine...
This paper puts forward a constructive heuristic algorithm called the method of inserting the minimu...
An algorithm for solving the large-scale Traveling Salesman Problem is presented. Research into past...
This paper presents a self-contained introduction into algorithmic and com-putational aspects of the...
The multilevel paradigm has recently been applied to the travelling salesman problem with consid-era...
The Traveling Salesman Problem (TSP) is a very hard optimization problem in the field of operations ...
This paper provides the survey of the heuristics solution approaches for the traveling salesman prob...
Graduation date: 1981This paper demonstrates the effectiveness of a heuristic for\ud the Traveling S...
An n log n randomized method based on POPMUSIC metaheuristic is proposed for generating reasonably g...
The Traveling Thief Problem (TTP) is a novel problem that combines the well-known Traveling Salesman...
ABSTRACT. The main objective of the paper is to present an algorithm for finding a solution to the t...
The method has been tested on instances with billions of cities. For a lot of problem instances of t...
AbstractTabu search is a general heuristic procedure for global optimization which has been successf...
The Lin and Kernighan’s algorithm for the single objective Traveling Salesman Problem (TSP) is one o...
Abstract—This work proposes an evolutionary algorithm, called the heterogeneous selection evolutiona...