Browsing Luonnontieteiden, metsätieteiden ja tekniikan tiedekunta by Subject "TSP"

Now showing items 1-3 of 3

    • Comparison of eleven measures for estimating difficulty of open-loop TSP instances 

      Sengupta, Lahari; Fränti, Pasi (AIMS Press, 2021)
      From the theory of algorithms, we know that the time complexity of finding the optimal solution for a traveling salesman problem (TSP) grows exponentially with the number of targets. However, the size of the problem instance ...
      Tieteelliset aikakauslehtiartikkelit

    • Planning Your Route: Where to Start? 

      Sengupta, Lahari; Mariescu-Istodor, Radu; Fränti, Pasi (Springer Nature, 2018)
      Tour planning is an important part of location-based applications. A tour planner provides an optimized path through places of interests (targets) by minimizing the tour length or by applying some other constraints. It is ...
      Tieteelliset aikakauslehtiartikkelit

    • Solving the Large-Scale TSP Problem in 1 h: Santa Claus Challenge 2020 

      Mariescu-Istodor, Radu; Fränti, Pasi (Frontiers Media SA, 2021)
      The scalability of traveling salesperson problem (TSP) algorithms for handling large-scale problem instances has been an open problem for a long time. We arranged a so-called Santa Claus challenge and invited people to ...
      Tieteelliset aikakauslehtiartikkelit