CMSTR: A Constrained Minimum Spanning Tree Based Routing Protocol for Wireless Sensor Networks

D Lin, Z Lin, L Kong, YL Guan - Ad Hoc Networks, 2023 - Elsevier
How to extend the network lifetime with given limited energy budget is always one of the
main concerns in Wireless Sensor Networks (WSNs). However, imbalanced energy …

Which local search operator works best for the open-loop TSP?

L Sengupta, R Mariescu-Istodor, P Fränti - Applied Sciences, 2019 - mdpi.com
The traveling salesman problem (TSP) has been widely studied for the classical closed-loop
variant. However, very little attention has been paid to the open-loop variant. Most of the …

Converting MST to TSP path by branch elimination

P Fränti, T Nenonen, M Yuan - Applied Sciences, 2020 - mdpi.com
Travelling salesman problem (TSP) has been widely studied for the classical closed loop
variant but less attention has been paid to the open loop variant. Open loop solution has …

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

L Sengupta, P Fränti - 2021 - dspace.uef.fi
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 …

On randomness and structure in Euclidean TSP instances: A study with heuristic methods

GC Crişan, E Nechita, D Simian - IEEE Access, 2021 - ieeexplore.ieee.org
Prediction of the quality of the result provided by a specific solving method is an important
factor when choosing how to solve a given problem. The more accurate the prediction, the …

[PDF][PDF] Clustering with kNN Graph and k-Means

S Sieranoja - 2020 - erepo.uef.fi
Increase in the amount, variety and complexity of data has made it more difficult to
understand or process information. Data clustering provides one way to help in these …

[PDF][PDF] Distances in MOPSI

H Oulad Arifi - 2020 - erepo.uef.fi
Nowadays, our smartphones can do many useful things for facilitating our life as it proved in
the several applications of distances that exist in web stores [23]. In this study, we will try to …

[引用][C] Kauppamatkustajan ongelman ratkaiseminen Kruskalin algoritmin avulla

H Nenonen - 2019 - Itä-Suomen yliopisto

[引用][C] Modifying Kruskal algorithm to solve open loop TSP

PFH Nenonen

[引用][C] Modifying Kruskal algorithm to solve open loop TSP

P Fränti, H Nenonen - Multidisciplinary International Scheduling Conference …, 2019