A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Combinatorial Optimization: Comparison of Heuristic Algorithms in Travelling Salesman Problem
https://orcid.org/0000-0003-0177-9274
Abstract The Travelling Salesman Problem (TSP) is an NP-hard problem with high number of possible solutions. The complexity increases with the factorial of n nodes in each specific problem. Meta-heuristic algorithms are an optimization algorithm that able to solve TSP problem towards a satisfactory solution. To date, there are many meta-heuristic algorithms introduced in literatures which consist of different philosophies of intensification and diversification. This paper focuses on 6 heuristic algorithms: Nearest Neighbor, Genetic Algorithm, Simulated Annealing, Tabu Search, Ant Colony Optimization and Tree Physiology Optimization. The study in this paper includes comparison of computation, accuracy and convergence.
Combinatorial Optimization: Comparison of Heuristic Algorithms in Travelling Salesman Problem
https://orcid.org/0000-0003-0177-9274
Abstract The Travelling Salesman Problem (TSP) is an NP-hard problem with high number of possible solutions. The complexity increases with the factorial of n nodes in each specific problem. Meta-heuristic algorithms are an optimization algorithm that able to solve TSP problem towards a satisfactory solution. To date, there are many meta-heuristic algorithms introduced in literatures which consist of different philosophies of intensification and diversification. This paper focuses on 6 heuristic algorithms: Nearest Neighbor, Genetic Algorithm, Simulated Annealing, Tabu Search, Ant Colony Optimization and Tree Physiology Optimization. The study in this paper includes comparison of computation, accuracy and convergence.
Combinatorial Optimization: Comparison of Heuristic Algorithms in Travelling Salesman Problem
https://orcid.org/0000-0003-0177-9274
Abstract The Travelling Salesman Problem (TSP) is an NP-hard problem with high number of possible solutions. The complexity increases with the factorial of n nodes in each specific problem. Meta-heuristic algorithms are an optimization algorithm that able to solve TSP problem towards a satisfactory solution. To date, there are many meta-heuristic algorithms introduced in literatures which consist of different philosophies of intensification and diversification. This paper focuses on 6 heuristic algorithms: Nearest Neighbor, Genetic Algorithm, Simulated Annealing, Tabu Search, Ant Colony Optimization and Tree Physiology Optimization. The study in this paper includes comparison of computation, accuracy and convergence.
Combinatorial Optimization: Comparison of Heuristic Algorithms in Travelling Salesman Problem
Halim, A. Hanif (author) / Ismail, I. (author)
2017
Article (Journal)
Electronic Resource
English
Applications of Travelling Salesman Optimization in Construction Scheduling
| Springer Verlag | 2024
An Improved Routing Optimization Algorithm Based on Travelling Salesman Problem for Social Networks
| DOAJ | 2017
A Flow-Based Formulation of the Travelling Salesman Problem with Penalties on Nodes
| DOAJ | 2023
A Space Condensation Heuristic for Combinatorial Optimization
| British Library Conference Proceedings | 1994