Meta-heuristics have been applied for a long time to the Travelling Salesman Problem (TSP) but information is still lacking in the determination of the parameters with the best performance. This paper examines the impact of the Simulated Annealing (SA) and Discrete Artificial Bee Colony (DABC) parameters in the TSP. One special consideration of this paper is how the Neighborhood Structure (NS) interact with the other parameters and impacts the performance of the meta-heuristics. NS performance has been the topic of much research, with NS proposed for the best-known problems, which seem to imply that the NS influences the performance of meta-heuristics, more that other parameters. Moreover, a comparative analysis of distinct meta...
A variety of modern heuristic algorithms for combinatorial optimization problems are based on comput...
The aim of this work was to compare metaheuristic Ant Colony with other metaheuristics like Simulate...
The Traveling Salesman Problem (TSP) is an important combinatorial optimization problem tackled by m...
Meta-heuristics have been applied for a long time to the Travelling Salesman Problem (TSP) but infor...
Metaheuristics (MH) aptitude to move past local optimums makes them an attractive technique to appro...
Metaheuristics (MH) aptitude to move past local optimums makes them an attractive technique to appro...
The Sequence Dependent Traveling Salesman Problem (SDTSP) is a combinatorial optimization problem de...
This paper carries out a performance analysis of major Nature-inspired Algorithms in solving the ben...
This paper presents a comparative study of three metaheuristics: Genetic Algorithm (GA), Ant Colony ...
Travelling salesman problem (TSP) is one the problems of NP-complete family, which means finding sho...
Ant colony optimization is metaheuristic algorithm inspired by nature. It has several parameters, wh...
Benchmarking is one of the most important ways to investigate the performance of metaheuristic optim...
The travelling salesman problem (TSP) is one of the most prominent NP-hard combinatorial optimisatio...
Artificial bee colony (ABC) is a quite popular optimization approach that has been used in many fiel...
In this article we propose a formalisation of the concept of exploration performed by metaheuristics...
A variety of modern heuristic algorithms for combinatorial optimization problems are based on comput...
The aim of this work was to compare metaheuristic Ant Colony with other metaheuristics like Simulate...
The Traveling Salesman Problem (TSP) is an important combinatorial optimization problem tackled by m...
Meta-heuristics have been applied for a long time to the Travelling Salesman Problem (TSP) but infor...
Metaheuristics (MH) aptitude to move past local optimums makes them an attractive technique to appro...
Metaheuristics (MH) aptitude to move past local optimums makes them an attractive technique to appro...
The Sequence Dependent Traveling Salesman Problem (SDTSP) is a combinatorial optimization problem de...
This paper carries out a performance analysis of major Nature-inspired Algorithms in solving the ben...
This paper presents a comparative study of three metaheuristics: Genetic Algorithm (GA), Ant Colony ...
Travelling salesman problem (TSP) is one the problems of NP-complete family, which means finding sho...
Ant colony optimization is metaheuristic algorithm inspired by nature. It has several parameters, wh...
Benchmarking is one of the most important ways to investigate the performance of metaheuristic optim...
The travelling salesman problem (TSP) is one of the most prominent NP-hard combinatorial optimisatio...
Artificial bee colony (ABC) is a quite popular optimization approach that has been used in many fiel...
In this article we propose a formalisation of the concept of exploration performed by metaheuristics...
A variety of modern heuristic algorithms for combinatorial optimization problems are based on comput...
The aim of this work was to compare metaheuristic Ant Colony with other metaheuristics like Simulate...
The Traveling Salesman Problem (TSP) is an important combinatorial optimization problem tackled by m...