Computational experiments with some approximation algorithms for the travelling salesman problem

A. Adrabiński; M. M. Sysło

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “Computational experiments with some approximation algorithms for the travelling salesman problem”

Solving the simple plant location problem by genetic algorithm

Jozef Kratica, Dušan Tošic, Vladimir Filipović, Ivana Ljubić (2010)

RAIRO - Operations Research

Similarity:

The simple plant location problem (SPLP) is considered and a genetic algorithm is proposed to solve this problem. By using the developed algorithm it is possible to solve SPLP with more than 1000 facility sites and customers. Computational results are presented and compared to dual based algorithms.