HEURISTICS FOR THE SOLUTION OF THE ROUND-TRIP PROBLEM ON THE KC85/2

Five heuristic algorithms for the travelling salesman problem are studied. Results of experiments on running time of these heuristics on the KC85/2 computer and on the closest of the approximate solutions to the optimum solution are present with at most n=22 ports.

• Supplemental Notes:
  • Wissenschaftliche Beitrage, v 16 n 4, 1989 p 53 [6 p, 1 ref, 4 tab, 4 fig]
• Authors:
  • Brandner, K
  • Prietzel, M
  • Weber, K
• Publication Date: 1989

Language

• German

Subject/Index Terms

• TRT Terms: Decision theory; Estimating; Linear programming; Operations research; Voyage management systems
• Old TRIS Terms: Passage planning; Voyage estimating
• Subject Areas: Data and Information Technology; Design; Marine Transportation;

Filing Info

• Accession Number: 00699930
• Record Type: Publication
• Source Agency: British Maritime Technology
• Files: TRIS
• Created Date: Aug 14 1995 12:00AM