A New Parallel Memetic Algorithm for the Close-Enough Traveling Salesman Problem
The Close-Enough Traveling Salesman Problem (CETSP) is a generalization of the classical TSP, where each target is associated with a disk-shaped neighborhood and is considered visited when any point within this region is reached. This variant has strong practical applications such as robotic path pl...
Sábháilte in:
| Príomhchruthaitheoir: | |
|---|---|
| Formáid: | Artigo |
| Teanga: | Inglês |
| Foilsithe / Cruthaithe: |
Düzce University
2026-01-01
|
| Sraith: | Düzce Üniversitesi Bilim ve Teknoloji Dergisi |
| Ábhair: | |
| Rochtain ar líne: | https://dergipark.org.tr/en/download/article-file/4647930 |
| Clibeanna: |
Níl clibeanna ann, Bí ar an gcéad duine le clib a chur leis an taifead seo!
|