High-level hybridization of heuristics and metaheuristics to solve symmetric TSP: a comparative study
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916457136259072 |
|---|---|
| author | Junior, Carlos Alberto da Silva Tanaka, Roberto Yuji da Silva, Luiz Carlos Farias Passaro, Angelo |
| author_facet | Junior, Carlos Alberto da Silva Tanaka, Roberto Yuji da Silva, Luiz Carlos Farias Passaro, Angelo |
| contents | The Travelling Salesman Problem - TSP is one of the most explored problems in the scientific literature to solve real problems regarding the economy, transportation, and logistics, to cite a few cases. Adapting TSP to solve different problems has originated several variants of the optimization problem with more complex objectives and different restrictions. Metaheuristics have been used to solve the problem in polynomial time. Several studies have tried hybridising metaheuristics with specialised heuristics to improve the quality of the solutions. However, we have found no study to evaluate whether the searching mechanism of a particular metaheuristic is more adequate for exploring hybridization. This paper focuses on the solution of the classical TSP using high-level hybridisations, experimenting with eight metaheuristics and heuristics derived from k-OPT, SISR, and segment intersection search, resulting in twenty-four combinations. Some combinations allow more than one set of searching parameters. Problems with 50 to 280 cities are solved. Parameter tuning of the metaheuristics is not carried out, exploiting the different searching patterns of the eight metaheuristics instead. The solutions' quality is compared to those presented in the literature. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_21274 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | High-level hybridization of heuristics and metaheuristics to solve symmetric TSP: a comparative study Junior, Carlos Alberto da Silva Tanaka, Roberto Yuji da Silva, Luiz Carlos Farias Passaro, Angelo Neural and Evolutionary Computing Discrete Mathematics Optimization and Control The Travelling Salesman Problem - TSP is one of the most explored problems in the scientific literature to solve real problems regarding the economy, transportation, and logistics, to cite a few cases. Adapting TSP to solve different problems has originated several variants of the optimization problem with more complex objectives and different restrictions. Metaheuristics have been used to solve the problem in polynomial time. Several studies have tried hybridising metaheuristics with specialised heuristics to improve the quality of the solutions. However, we have found no study to evaluate whether the searching mechanism of a particular metaheuristic is more adequate for exploring hybridization. This paper focuses on the solution of the classical TSP using high-level hybridisations, experimenting with eight metaheuristics and heuristics derived from k-OPT, SISR, and segment intersection search, resulting in twenty-four combinations. Some combinations allow more than one set of searching parameters. Problems with 50 to 280 cities are solved. Parameter tuning of the metaheuristics is not carried out, exploiting the different searching patterns of the eight metaheuristics instead. The solutions' quality is compared to those presented in the literature. |
| title | High-level hybridization of heuristics and metaheuristics to solve symmetric TSP: a comparative study |
| topic | Neural and Evolutionary Computing Discrete Mathematics Optimization and Control |
| url | https://arxiv.org/abs/2410.21274 |