4   Artículos

 
en línea
Christophe Cariou, Laure Moiroux-Arvis, François Pinet and Jean-Pierre Chanet    
Evolutionary algorithms have been widely studied in the literature to find sub-optimal solutions to complex problems as the Traveling Salesman Problem (TSP). In such a problem, the target positions are usually static and punctually defined. The objective... ver más
Revista: Algorithms    Formato: Electrónico

 
en línea
Debdatta Sinha Roy, Bruce Golden, Xingyin Wang and Edward Wasil    
We construct empirically based regression models for estimating the tour length in the Close Enough Traveling Salesman Problem (CETSP). In the CETSP, a customer is considered visited when the salesman visits any point in the customer?s service region. We... ver más
Revista: Algorithms    Formato: Electrónico

« Anterior     Página: 1 de 1     Siguiente »