Results 41 to 50 of about 108,421 (273)

The geometric maximum traveling salesman problem [PDF]

Journal of the ACM, 2003
We consider the traveling salesman problem when the cities are points in ℝ d for some fixed d and distances are computed according to geometric distances, determined by some norm.
Barvinok, A., Fekete, Sandor, Johnson, D.S., Tamir, T., Woeginger, Gerhard, Woodroofe, Russ   +5 more
openaire   +4 more sources

Solving the Travelling Salesman Problem by Using Artificial Bee Colony Algorithm

Journal of Computing Research and Innovation, 2022
Travelling Salesman Problem (TSP) is a list of cities that must visit all cities that start and end in the same city to find the minimum cost of time or distance. The Artificial Bee Colony (ABC) algorithm was used in this study to resolve the TSP.
Siti Hafawati Jamaluddin, Noor Ainul Hayati Mohd Naziri, Norwaziah Mahmud, Nur Syuhada Muhammat Pazil   +3 more
doaj   +3 more sources

Optimizing Cycle Time of Industrial Robotic Tasks with Multiple Feasible Configurations at the Working Points

Robotics, 2022
Industrial robot applications should be designed to allow the robot to provide the best performance for increasing throughput. In this regard, both trajectory and task order optimization are crucial, since they can heavily impact cycle time. Moreover, it
Matteo Bottin, Giovanni Boschetti, Giulio Rosati   +2 more
doaj   +1 more source

Solving multiple travelling salesman problem through deep convolutional neural network

IET Cyber-systems and Robotics, 2023
The multiple travelling salesman problem (mTSP) is a classical optimisation problem that is widely applied in various fields. Although the mTSP was solved using both classical algorithms and artificial neural networks, reiteration is inevitable for these
Zhengxuan Ling, Yueling Zhou, Yu Zhang
doaj   +1 more source

Two phase heuristic algorithm for the multiple-travelling salesman problem

Soft Computing - A Fusion of Foundations, Methodologies and Applications, 2017
The multiple-travelling salesman problem (MTSP) is a computationally complex combinatorial optimisation problem, with several theoretical and real-world applications. However, many state-of-the-art heuristic approaches intended to specifically solve MTSP,
Xiaolong Xu, Hao Yuan, Mark Liptrott, M. Trovati   +3 more
semanticscholar   +1 more source

Robot Path Planning Based On The Travelling Salesman Problem

Chemical Engineering Transactions, 2015
Against the background of "Robot Travelling China" competition, this paper introduces the idea of TSP to seek optimal motion path. Applying the knowledge of graph theory to analyze and transform the map of competition.
G.Q. Wang, J. Wang, M. Li, H.J. Li, Y. Yuan   +4 more
doaj   +1 more source

Designing Memristive Materials for Artificial Dynamic Intelligence

Advanced Intelligent Discovery, EarlyView.
Key characteristics required of memristors for realizing next‐generation computing, along with modeling approaches employed to analyze their underlying mechanisms. These modeling techniques span from the atomic scale to the array scale and cover temporal scales ranging from picoseconds to microseconds. Hardware architectures inspired by neural networks
Youngmin Kim, Ho Won Jang
wiley   +1 more source

Random-key cuckoo search for the travelling salesman problem [PDF]

Soft Computing - A Fusion of Foundations, Methodologies and Applications, 2014
Combinatorial optimization problems are typically NP-hard, and thus very challenging to solve. In this paper, we present the random-key cuckoo search (RKCS) algorithm for solving the famous travelling salesman problem (TSP).
Aziz Ouaarab, B. Ahiod, Xin-She Yang
semanticscholar   +1 more source

Large‐Scale and Highly Reliable Hopfield Neural Networks Using Vertical NAND Flash Memory for the In‐Memory Associative Computing

Advanced Intelligent Systems, EarlyView.
Large‐scale Hopfield neural networks (HNNs) for associative computing are implemented using vertical NAND (VNAND) flash memory. The proposed VNAND HNN with the asynchronous update scenario achieve robust image restoration performance despite fabrication variations, while significantly reducing chip area (≈117× smaller than resistive random‐access ...
Jin Ho Chang, Jae Seung Woo, Suk‐Kang Sung, Ki‐Whan Song, Woo Young Choi   +4 more
wiley   +1 more source

Genetic algorithm to the bi-objective multiple travelling salesman problem

Alexandria Engineering Journal
The travelling salesman problem (TSP) and its variants have been studied extensively due to its wide range of real-world applications, yet there are challenges in providing efficient algorithms to deal with some of its variants.
Shayathri Linganathan, Purusotham Singamsetty   +1 more
doaj   +1 more source