Focused on a variation of the euclidean traveling salesman problem (TSP), namely, the generalized traveling salesman problem (GTSP), this paper extends the ant colony optimization method from TSP to this field. By considering the group influence, an improved method is further improved. To avoid locking into local minima, a mutation process and a local searching technique are also introduced into this method. Numerical results show that the proposed method can deal with the GTSP problems fairly well, and the developed mutation process and local search technique are effective.
Titolo: | An ant colony optimization method for generalized TSP problem |
Autori: | Y., Jinhui; S., Xiaohu; Marchese, Maurizio; Liang, Yanchun |
Autori Unitn: | |
Titolo del periodico: | PROGRESS IN NATURAL SCIENCE |
Anno di pubblicazione: | 2008 |
Numero e parte del fascicolo: | 11 |
Codice identificativo Scopus: | 2-s2.0-56849088786 |
Codice identificativo ISI: | WOS:000262137200012 |
Digital Object Identifier (DOI): | http://dx.doi.org/10.1016/j.pnsc.2008.03.028 |
Handle: | http://hdl.handle.net/11572/65930 |
Appare nelle tipologie: | 03.1 Articolo su rivista (Journal article) |
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione