hrcak mascot   Srce   HID

Izvorni znanstveni članak

Connection Machine Implementation of a Tabu Search Algorithm for the Traveling Salesman Problem

Jaishankar Chakrapani ; Department of Applied Mathematics and Statistics, State University of New York at Stony Brook
Jadranka Skorin-Kapov ; Harriman School for Management and Policy, State University of New York at Stony Brook

Puni tekst: engleski, pdf (4 MB) str. 29-36 preuzimanja: 93* citiraj
APA 6th Edition
Chakrapani, J. i Skorin-Kapov, J. (1993). Connection Machine Implementation of a Tabu Search Algorithm for the Traveling Salesman Problem. Journal of computing and information technology, 1 (1), 29-36. Preuzeto s https://hrcak.srce.hr/150514
MLA 8th Edition
Chakrapani, Jaishankar i Jadranka Skorin-Kapov. "Connection Machine Implementation of a Tabu Search Algorithm for the Traveling Salesman Problem." Journal of computing and information technology, vol. 1, br. 1, 1993, str. 29-36. https://hrcak.srce.hr/150514. Citirano 02.03.2021.
Chicago 17th Edition
Chakrapani, Jaishankar i Jadranka Skorin-Kapov. "Connection Machine Implementation of a Tabu Search Algorithm for the Traveling Salesman Problem." Journal of computing and information technology 1, br. 1 (1993): 29-36. https://hrcak.srce.hr/150514
Harvard
Chakrapani, J., i Skorin-Kapov, J. (1993). 'Connection Machine Implementation of a Tabu Search Algorithm for the Traveling Salesman Problem', Journal of computing and information technology, 1(1), str. 29-36. Preuzeto s: https://hrcak.srce.hr/150514 (Datum pristupa: 02.03.2021.)
Vancouver
Chakrapani J, Skorin-Kapov J. Connection Machine Implementation of a Tabu Search Algorithm for the Traveling Salesman Problem. Journal of computing and information technology [Internet]. 1993 [pristupljeno 02.03.2021.];1(1):29-36. Dostupno na: https://hrcak.srce.hr/150514
IEEE
J. Chakrapani i J. Skorin-Kapov, "Connection Machine Implementation of a Tabu Search Algorithm for the Traveling Salesman Problem", Journal of computing and information technology, vol.1, br. 1, str. 29-36, 1993. [Online]. Dostupno na: https://hrcak.srce.hr/150514. [Citirano: 02.03.2021.]

Sažetak
A tabu search algorithm for the traveling salesman problem (TSP) is developed. The algorithm is based on the well known 2-opt move which is implemented in parallel on the connection machine CM-2. This involves decomposing the evaluation of the whole 2-opt neighborhood into small independent steps that can be executed in parallel by different processors. The implementation is efficient and highly scalable. Implementation details and results of computation for some TSPs from the literature are presented.

Hrčak ID: 150514

URI
https://hrcak.srce.hr/150514

Posjeta: 156 *