1,721,187 research outputs found
Complexity analysis and optimization for the shortest path tour problem
No full textThe shortest path tour problem consists of finding a shortest path from a given origin node s to a given destination node d in a graph with nonnegative arc lengths with the constraint that the path should successively pass through at least one node from given node subsets T1 ,T2 ,...,Tk [i.e., start at s, move to some node in T1 (possibly through some intermediate nodes that are not in T1), then move to some node in T2 (possibly through some intermediate nodes that are not in T2, but may be in T1 ),etc., move to some node in Tk ,and then to d (possibly through some intermediate nodes not equal to d)].
In this talk, the complexity class will be demostrated to which the problem belongs and several alternative techniques will be presented to exactly solve it
On some variants of the shortest path tour problem as facility location problems
No full textThe shortest path tour problem consists of finding a shortest path from a given origin node s to a given destination node d in a graph with nonnegative arc lengths with the constraint that the path should successively pass through at least one node from given node subsets T1 ,T2 ,...,Tk [i.e., start at s, move to some node in T1 (possibly through some intermediate nodes that are not in T1), then move to some node in T2 (possibly through some intermediate nodes that are not in T2, but may be in T1 ),etc., move to some node in Tk ,and then to d (possibly through some intermediate nodes not equal to d)].
In this talk, some variants of the problem will be formally described and stated as special facility location problems
GRASP with Path-Relinking for Data Clustering: A Case Study for Biological Data
No full textCluster analysis has been applied to several domains with numerous applications. We propose several GRASP with path-relinking heuristics for data clustering problems using as case study biological datasets. To our knowledge, GRASP with path-relinking has never been applied
to cluster biological datasets. Extensive comparative experiments with
other algorithms on a large set of test instances, according to different
distance metrics (Euclidean, city block, cosine, and Pearson), show that the best of the proposed variants is both effective and efficient
Book Review - Cooperative Networks, Control and Optimization
No full textThis book contains an edited collection of 17 interesting chapters. The emphasis is definitively in presenting models and mathematics that have been developed by researchers in a broad set of disciplines, and focuses on a wide range of subjects, including networks of unmanned vehicles in uncertain environments, networks subject to eavesdropping and jamming, optimal node task allocation, network complexity analysis, cooperative search involving multiple unmanned vehicles,
and cooperative communications in ad hoc networks, optimal control and optimization in man-in-the-loop scenarios
- …
