Fast Branch and Bound Algorithm for the Travelling Salesman Problem

Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9842)

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.

Keywords

Branch-and-Bound Dynamic programming Parallel algorithm 
This is a preview of subscription content, log in to check access.

References

  1. 1.
    Bożejko, W.: Solving the flow shop problem by parallel programming. J. Parallel Distrib. Comput. 69, 470–481 (2009)CrossRefGoogle Scholar
  2. 2.
    Bożejko, W.: Parallel path relinking method for the single machine total weighted tardiness problem with sequence-dependent setups. J. Intell. Manuf. 21, 777–785 (2010)CrossRefGoogle Scholar
  3. 3.
    Bożejko, W.: On single-walk parallelization of the job shop problem solving algorithms. Comput. Oper. Res. 39, 2258–2264 (2012)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Bożejko, W., Wodecki, M.: Parallel genetic algorithm for the flow shop scheduling problem. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds.) PPAM 2004. LNCS, vol. 3019, pp. 566–571. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  5. 5.
    Bożejko, W., Wodecki, M.: Solving permutational routing problems by population-based metaheuristics. Comput. Ind. Eng. 57(1), 269–276 (2009)CrossRefGoogle Scholar
  6. 6.
    Cook, W.J.: In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation. Princeton University Press, Princeton (2012)MATHGoogle Scholar
  7. 7.
    Feiring, B.: An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem. Math. Comput. Modell. 13(3), 67–71 (1990)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Jagiełło, S., Żelazny, D.: Solving multi-criteria vehicle routing problem by parallel tabu search on GPU. Procedia Comput. Sci. 18, 2529–2532 (2013)CrossRefGoogle Scholar
  9. 9.
    Jünger, M., Rinaldi, G., Reinelt, G.: The traveling salesman problem. Handbooks Oper. Res. Manage. Sci. 7, 225–330 (1995)CrossRefMATHGoogle Scholar
  10. 10.
    Land, A.H., Doig, A.G.: An automatic method of solving discrete programming problems. Econometrica: J. Econometric Soc. 28, 497–520 (1960)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Morrison, D.R., Jacobson, S.H., Sauppe, J.J., Sewell, E.C.: Branch-and-Bound algorithms: a survey of recent advances in searching, branching, and pruning. Discrete Optim. 19, 79–102 (2016)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Toffolo, T.A.M., Wauters, T., Malderen, S.V., Berghe, G.V.: Branch-and-Bound with decomposition-based lower bounds for the Traveling Umpire Problem. Eur. J. Oper. Res. 250(3), 737–744 (2016)MathSciNetCrossRefGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2016

Authors and Affiliations

  1. 1.Department of Control Systems and Mechatronics, Faculty of ElectronicsWrocław University of Science and TechnologyWrocławPoland

Personalised recommendations