Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

New Insertion and Postoptimization Procedures for the Traveling Salesman Problem

Michel Gendreau, Alain Hertz and Gilbert Laporte
Operations Research
Vol. 40, No. 6 (Nov. - Dec., 1992), pp. 1086-1094
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/171722
Page Count: 9
  • Download ($30.00)
  • Cite this Item
New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
Preview not available

Abstract

This paper describes a new insertion procedure and a new postoptimization routine for the traveling salesman problem. The combination of the two methods results in an efficient algorithm (GENIUS) which outperforms known alternative heuristics in terms of solution quality and computing time.

Page Thumbnails

  • Thumbnail: Page 
1086
    1086
  • Thumbnail: Page 
1087
    1087
  • Thumbnail: Page 
1088
    1088
  • Thumbnail: Page 
1089
    1089
  • Thumbnail: Page 
1090
    1090
  • Thumbnail: Page 
1091
    1091
  • Thumbnail: Page 
1092
    1092
  • Thumbnail: Page 
1093
    1093
  • Thumbnail: Page 
1094
    1094