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...
محفوظ في:
| المؤلفون الرئيسيون: | , |
|---|---|
| التنسيق: | Artigo |
| اللغة: | Inglês |
| منشور في: |
Springer
2025-08-01
|
| سلاسل: | Journal of King Saud University: Computer and Information Sciences |
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://doi.org/10.1007/s44443-025-00127-x |
| الوسوم: |
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|