Underwater Data Collection Using Robotic Sensor Networks by Hollinger, Geoffrey A., Choudhary, Sunav, Qarabaqi, Parastoo, Murphy, Christopher, Mitra, Urbashi, Sukhatme, Gaurav S., Stojanovic, Milica, Singh, Hanumant, Hover, Franz S.

“…We propose AUV path planning methods that extend algorithms for variants of the Traveling Salesperson Problem (TSP). While executing a path, the AUV can improve performance by communicating with multiple nodes in the network at once. …”
Get full text
Get full text

Biological signaling pathways and potential mathematical network representations: biological discovery through optimization by Clara Isaza, Juan F. Rosas, Enery Lorenzo, Arlette Marrero, Cristina Ortiz, Michael R. Ortiz, Lynn Perez, Mauricio Cabrera‐Ríos

“…Afterward, application of the Traveling Salesperson Problem and Minimum Spanning Tree network optimization models are proposed to identify potential signaling pathways via the most correlated path among the genes of interest. …”
Get full text

A Canonical Experiment on System Complexity Metric and Its Impact on Engineering Management by Bortot Hopker, Ricardo

“…In this thesis, 25 people were part of an experiment using the travel salesperson problem, they completed 13 problems each with varying complexity. …”
Get full text
Get full text

Difficulty-aware time-bounded planning under uncertainty for large-scale robot missions by Staniaszek, M, Brudermüller, L, Bhattacharyya, R, Lacerda, B, Hawes, N

“…Due to the intractability of the general problem, we propose simplifications to allow planning in large domains, the key being constraining navigation using a solution to the travelling salesperson problem (TSP). We build a set of variant models for two domains with different characteristics: UV disinfection, and cleaning, evaluating them on maps generated from real-world environments. …”

Unconventional complexity measures for unconventional computers by Blakey, E

“…One particular motivation behind unconventional computation is the desire efficiently to solve classically difficult problems—we recall chemical-computer attempts at solving NP-complete problems such as the Travelling Salesperson Problem—, with computational complexity theory offering the criteria for judging this efficiency. …”

A Sequence-Based Hyper-Heuristic for Traveling Thieves by Daniel Rodríguez, Jorge M. Cruz-Duarte, José Carlos Ortiz-Bayliss, Ivan Amaya

“…One of these problems is the traveling thief problem (TTP), which combines elements from the knapsack and traveling salesperson problems. Hence, it is paramount to keep improving solvers to tackle combinatorial problems. …”
Get full text

AUTOMATIC BUILDING FOOTPRINT EXTRACTION FROM 3D LASERSCANS by P. Rottmann, J.-H. Haunert, Y. Dehbi

“…To this end, a pipeline of methods including non-parametric kernel density estimation (KDE) of an underlying probability density function, a solution of the Travelling Salesperson Problem (TSP), outlier elimination and line segmentation are presented to extract the underlying building footprint. …”
Get full text

Parallel Algorithm on GPU for Wireless Sensor Data Acquisition Using a Team of Unmanned Aerial Vehicles by Vincent Roberge, Mohammed Tarbouchi

“…A genetic algorithm supplemented with a 2-opt local search heuristic is used to solve the multi-travelling salesperson problem and to find optimized tours for each UAVs. …”
Get full text

On the Stochastic Travelling Salesman problem for the Dubin's vehicle by Itani, Sleiman M

Get full text