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

W.K.M. Keulemans

Research output: Book/ReportReportAcademic

47 Downloads (Pure)

Abstract

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.
Original languageEnglish
Place of PublicationEindhoven
PublisherTechnische Hogeschool Eindhoven
Number of pages12
Publication statusPublished - 1977

Publication series

NameMemorandum COSOR
Volume7712
ISSN (Print)0926-4493

Fingerprint

Dive into the research topics of 'A program for the traveling-salesman problem, according to the heuristic algorithm of Lin-Kernighan'. Together they form a unique fingerprint.

Cite this