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...

Szczegółowa specyfikacja

Opis bibliograficzny

1. autor:	Deniz Cantürk
Format:	Artigo
Język:	Inglês
Wydane:	Düzce University 2026-01-01
Seria:	Düzce Üniversitesi Bilim ve Teknoloji Dergisi
Hasła przedmiotowe:	seyyar satıcı problemi paralel algoritmalar memetik eniyileme travelling salesman parallel algorithm memetic optimization
Dostęp online:	https://dergipark.org.tr/en/download/article-file/4647930
Etykiety:	Dodaj etykietę Nie ma etykietki, Dołącz pierwszą etykiete!