By introducing the concept of Oracle we propose an approach for improving the performance of genetic algorithms for large-scale asymmetric Traveling Salesman Problems. The results have shown that the proposed approach allows overcoming some traditional problems for creating efficient genetic algorithms
Genetic Algorithms are finding increasing number of applications in a variety of problems in a whole...
We use an interactive genetic algorithm to divide and conquer large traveling salesperson problems. ...
Genetic Algorithms (GAs) are an evolutionary technique that uses the operators like mutation, crosso...
Abstract — This paper presents the literature survey review of Travelling Salesman Problem (TSP). TS...
This research investigated the application of Genetic Algorithm capable of solving the traveling sal...
Abstract: Traveling salesman problem is quite known in the field of combinatorial optimization. Thro...
This paper is the result of a literature study carried out by the authors. It is a review of the dif...
The combination of local search heuristics and genetic algorithms is a promising approach for findin...
This paper presents new enhancements to a multi-population GENITOR-type Genetic Al-gorithm (GA)for s...
The well known NP-complete problem of the Traveling Salesman Problem (TSP) is coded in genetic form....
2015 23rd Signal Processing and Communications Applications Conference, SIU 2015 -- 16 May 2015 thro...
Traveling Salesman Problem (TSP) is known as one of the combinatorial optimization problems. The Gen...
Genetic algorithms are evolutionary techniques used for optimization purposes according to survival ...
This paper includes a flexible method for solving the travelling salesman problem using genetic algo...
The automatic generation of procedures for combinatorial optimization problems is emerging as a new ...
Genetic Algorithms are finding increasing number of applications in a variety of problems in a whole...
We use an interactive genetic algorithm to divide and conquer large traveling salesperson problems. ...
Genetic Algorithms (GAs) are an evolutionary technique that uses the operators like mutation, crosso...
Abstract — This paper presents the literature survey review of Travelling Salesman Problem (TSP). TS...
This research investigated the application of Genetic Algorithm capable of solving the traveling sal...
Abstract: Traveling salesman problem is quite known in the field of combinatorial optimization. Thro...
This paper is the result of a literature study carried out by the authors. It is a review of the dif...
The combination of local search heuristics and genetic algorithms is a promising approach for findin...
This paper presents new enhancements to a multi-population GENITOR-type Genetic Al-gorithm (GA)for s...
The well known NP-complete problem of the Traveling Salesman Problem (TSP) is coded in genetic form....
2015 23rd Signal Processing and Communications Applications Conference, SIU 2015 -- 16 May 2015 thro...
Traveling Salesman Problem (TSP) is known as one of the combinatorial optimization problems. The Gen...
Genetic algorithms are evolutionary techniques used for optimization purposes according to survival ...
This paper includes a flexible method for solving the travelling salesman problem using genetic algo...
The automatic generation of procedures for combinatorial optimization problems is emerging as a new ...
Genetic Algorithms are finding increasing number of applications in a variety of problems in a whole...
We use an interactive genetic algorithm to divide and conquer large traveling salesperson problems. ...
Genetic Algorithms (GAs) are an evolutionary technique that uses the operators like mutation, crosso...
DOI
Add to ORKG