A program for the traveling-salesman problem, according to the heuristic algorithm of Lin-Kernighan

W.K.M. Keulemans

Onderzoeksoutput: Boek/rapportRapportAcademic

68 Downloads (Pure)

Samenvatting

The program described in this memorandum has been written in Burroughs Extended Algol (BEA). It is a fair transcription of the heuristic algorithm of Lin-Kernighan [2]. The terminology and notations of Lin-Kernighan will be used. The program follows the basic traveling-salesman algorithm of Lin-Kernighan conscientiously. The refinements of avoiding checkout time, look-ahead and reduction have also been implemented. The program has been written as a procedure called linkernighan. Computational results are compared with the results of Lin-Kernighan.
Originele taal-2Engels
Plaats van productieEindhoven
UitgeverijTechnische Hogeschool Eindhoven
Aantal pagina's12
StatusGepubliceerd - 1977

Publicatie series

NaamMemorandum COSOR
Volume7712
ISSN van geprinte versie0926-4493

Vingerafdruk

Duik in de onderzoeksthema's van 'A program for the traveling-salesman problem, according to the heuristic algorithm of Lin-Kernighan'. Samen vormen ze een unieke vingerafdruk.

Citeer dit