Fast Branch and Bound Algorithm for the Travelling Salesman Problem - Computer Information Systems and Industrial Management (CISIM 2016) Access content directly
Conference Papers Year : 2016

Fast Branch and Bound Algorithm for the Travelling Salesman Problem

Abstract

New strategies are proposed for implementing algorithms based on Branch and Bound scheme. Those include two minimal spanning tree lower bound modifications, a design based on the fact that edges in the optimal tour can never cross in the euclidean TSP and parallelization of Branch and Bound scheme. Proposed approaches are compared with primary algorithms.
Fichier principal
Vignette du fichier
419526_1_En_19_Chapter.pdf (363.33 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01637523 , version 1 (17-11-2017)

Licence

Attribution

Identifiers

Cite

Radosław Grymin, Szymon Jagiełło. Fast Branch and Bound Algorithm for the Travelling Salesman Problem. 15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Sep 2016, Vilnius, Lithuania. pp.206-217, ⟨10.1007/978-3-319-45378-1_19⟩. ⟨hal-01637523⟩
288 View
1548 Download

Altmetric

Share

Gmail Facebook X LinkedIn More