| Full text | |
| Author(s): |
Total Authors: 3
|
| Affiliation: | [1] Univ Sao Paulo, Dept Comp & Math, Ribeirao Preto, SP - Brazil
[2] Colorado State Univ, Dept Comp Sci, Ft Collins, CO 80523 - USA
[3] Univ Stirling, Dept Comp Sci & Math, Stirling FK9 4LA - Scotland
Total Affiliations: 3
|
| Document type: | Journal article |
| Source: | EVOLUTIONARY COMPUTATION; v. 28, n. 2, p. 255-288, JUN 2020. |
| Web of Science Citations: | 0 |
| Abstract | |
Generalized Partition Crossover (GPX) is a deterministic recombination operator developed for the Traveling Salesman Problem. Partition crossover operators return the best of 2k reachable offspring, where k is the number of recombining components. This article introduces a new GPX2 operator, which finds more recombining components than GPX or Iterative Partial Transcription (IPT). We also show that GPX2 has O(n) runtime complexity, while also introducing new enhancements to reduce the execution time of GPX2. Finally, we experimentally demonstrate the efficiency of GPX2 when it is used to improve solutions found by the multitrial Lin-Kernighan-Helsgaum (LKH) algorithm. Significant improvements in performance are documented on large (n>5000) and very large (n=100,000) instances of the Traveling Salesman Problem. (AU) | |
| FAPESP's process: | 16/18615-0 - Advanced machine learning |
| Grantee: | André Carlos Ponce de Leon Ferreira de Carvalho |
| Support Opportunities: | Research Grants - Research Partnership for Technological Innovation - PITE |
| FAPESP's process: | 15/06462-1 - Recombination by decomposition in evolutionary computation |
| Grantee: | Renato Tinós |
| Support Opportunities: | Regular Research Grants |
| FAPESP's process: | 13/07375-0 - CeMEAI - Center for Mathematical Sciences Applied to Industry |
| Grantee: | Francisco Louzada Neto |
| Support Opportunities: | Research Grants - Research, Innovation and Dissemination Centers - RIDC |