Solving large batches of traveling salesman problems with parallel and distributed computing

•Gives a practical and effective method for computationally solving numerous TSP instances.•Can use different TSP solvers we test an exact method and a heuristic.•Can handle TSPs of differing sizes efficiently with a simple processing rule.•This problem arises in design of transportation networks, d...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computers & operations research Jg. 85; S. 87 - 96
Hauptverfasser:	Ozden, S.G., Smith, A.E., Gue, K.R.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Elsevier Ltd 01.09.2017 Pergamon Press Inc
Schlagworte:	Computer networks Distributed computing Distributed processing Facilities design Heuristic Operations research Order picking Parallel computing Parallel processing Routing Traveling salesman problem TSP Warehouses TSP Facilities design Routing Parallel computing Distributed computing
ISSN:	0305-0548, 1873-765X, 0305-0548
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!