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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computers & operations research Ročník 85; s. 87 - 96
Hlavní autori:	Ozden, S.G., Smith, A.E., Gue, K.R.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Elsevier Ltd 01.09.2017 Pergamon Press Inc
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!