An application of the self-organizing map in the non-Euclidean Traveling Salesman Problem

Faigl, Jan; Kulich, Miroslav; Vonásek, Vojtĕch; Přeučil, Libor

doi:10.1016/j.neucom.2010.08.026

Cited by 32 publications

(19 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In MSDGAS, some experiment parameters are optimized based on the work in [49,50]. e user requests in the experiment are simulated data generated by a developed computer program.…”

Section: Discussion Of Experiments Parametersmentioning

confidence: 99%

Multistage Dynamic Packet Access Mechanism of Internet of Things

Meng

Chen

Zhang

2018

Mobile Information Systems

View full text Add to dashboard Cite

In the scenario of mass control commands requesting for network access, confined by the best-effort network service mode, it is easy to bring about resource competition and thus a phenomenon of access failure on major and urgent service request at the data access center for the Internet of ings. In this event, the dynamic diversification of control command is unable to access the necessary resources on a comparatively fair basis, causing low efficiency in heterogeneous resource utilization at the access center. is paper defines the problem of group request dynamic resource allocation and further converts it into the problem of 0-1 integer and linear programming and proposes a multistage dynamic packet access strategy. is strategy works first on dynamic group division on the users' mass control requests using the high ability of self-organizing feature maps and then searches for the optimized matching resources based on the frog-leaping algorithm which has a better capacity for global searching for the best resources. is paper analyzes the feasibility of this strategy and its astringency. e experimental results demonstrate that the strategy can effectively improve the success rate of access to the data center for the Internet of ings and reduce network blockage and response delay.

show abstract

“…In MSDGAS, some experiment parameters are optimized based on the work in [49,50]. e user requests in the experiment are simulated data generated by a developed computer program.…”

Section: Discussion Of Experiments Parametersmentioning

confidence: 99%

Multistage Dynamic Packet Access Mechanism of Internet of Things

Meng

Chen

Zhang

2018

Mobile Information Systems

View full text Add to dashboard Cite

show abstract

“…Hereafter, we call our new system as Parallelized Memetic Self-Organizing Map (PMSOM). For the sake of simplicity, we will apply our algorithm over Euclidean TSP samples but some researchers have demonstrated that SOM is applicable on non-Euclidean TSP as well [34].…”

Section: Current Workmentioning

confidence: 99%

Parallelized neural network system for solving Euclidean traveling salesman problem

Avşar

Aliabadi

2015

Applied Soft Computing

View full text Add to dashboard Cite

“…A simple approximation of the shortest path based on a convex partition of the polygonal domain W has been used in [18]. The approximation is based on a refinement of a primary path found in a convex partition of W. A convex partition P is a set of convex cells C i , P = {C 1 , C 2 , .…”

Section: Approximation Of the Shortest Path In The Polygonal Domainmentioning

confidence: 99%

“…In [18], a simple, yet sufficient approximation of the shortest path in W has been used in SOM adaptation rules to decrease the computational burden. Although this approximation enables the application of SOM principles in W, the required computational time of self-organization is still significantly higher (hundreds of times) than for the Euclidean-TSP.…”

Section: Introductionmentioning

confidence: 99%

An application of the self-organizing map in the non-Euclidean Traveling Salesman Problem

Cited by 32 publications

References 24 publications

Multistage Dynamic Packet Access Mechanism of Internet of Things

Multistage Dynamic Packet Access Mechanism of Internet of Things

Parallelized neural network system for solving Euclidean traveling salesman problem

On the performance of self-organizing maps for the non-Euclidean Traveling Salesman Problem in the polygonal domain

Contact Info

Product

Resources

About