A hybrid genetic algorithm with cycle reassembly for solving colored traveling salesman problems
Abstract As a generalization of the well-known multiple traveling salesman problem, the Colored Traveling Salesman Problem (CTSP) can completely delineate individual salesmen’s "spheres of influence" of city visits using colors. CTSP has numerous real-world applications but remains computationally c...
I tiakina i:
| Ngā kaituhi matua: | , |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
Springer
2025-08-01
|
| Rangatū: | Journal of King Saud University: Computer and Information Sciences |
| Ngā marau: | |
| Urunga tuihono: | https://doi.org/10.1007/s44443-025-00127-x |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|