haku: @author Zweig, G. / yhteensä: 2
viite: 1 / 2
« edellinen | seuraava »
| Tekijä: | Zweig, G. |
| Otsikko: | An effective tour construction and improvement procedure for the traveling salesman problem |
| Lehti: | Organizations Research
1995 : NOV-DEC, VOL. 43:6, p. 1049-1057 |
| Asiasana: | ORGANIZATIONAL RESEARCH SALESMEN TRAVEL |
| Kieli: | eng |
| Tiivistelmä: | This paper presents an effective neighborhood structure for the traveling salesman problem. The neighbors of a tour are defined as the tours that can be produced by breaking the initial tour into two closed subtours, rejoining the subtours in a new configuration, and finally performing local optimization around all changed edges. This process of generating a neighbor is termed divide and merge. neighbor lists are used to develop variants of divide and merge that require linear and constant time per iteration, as well as an O (Nln(N) tour construction algorithm based on insertion into the convex hull. |
« edellinen | seuraava »
SCIMA