Results 31 to 40 of about 863 (188)
Penyelesaian Travelling Salesman Problem (TSP) Menggunakan Algoritma Hill Climbing dan MATLAB
Matematika, 2018 Abstrak. Travelling Salesman Problem (TSP) adalah permasalahan dimana seorang salesman harus mengunjungi semua kota yang mana tiap kota hanya dikunjungi sekali, dan harus kembali ke kota asal.
Muhammad Irfan
doaj +1 more source
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. +5 more
openaire +4 more sources
Solving open travelling salesman subset-tour problem through a hybrid genetic algorithm [PDF]
Journal of Project Management, 2021 In open travelling salesman subset-tour problem (OTSSP), the salesman needs to traverse a set of k (≤n) out of n cities and after visiting the last city, the salesman does not necessarily return to the central depot.
Singamsetty, Purusotham +2 more
doaj +1 more source
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 +3 more
doaj +3 more sources
An effective method for solving multiple travelling salesman problem based on NSGA-II
Systems Science & Control Engineering, 2019 In this paper, an effective multi-objective evolutionary algorithm is proposed to solve the multiple travelling salesman problem. In order to obtain minimum total visited distance and minimum range between all salesmen, some novel representation ...
Yang Shuai, Shao Yunfeng, Zhang Kai
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
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 +4 more
doaj +1 more source
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 +2 more
doaj +1 more source
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 +4 more
wiley +1 more source
Advanced Physics Research, EarlyView.This study demonstrates a versatile hardware platform using nano‐oscillators based on binary oxides for deterministic and probabilistic computing. By tailoring material physics, NbOx enables energy‐efficient synchronization for pattern recognition, while enhanced stochasticity in engineered SiOx provides robust entropy for p‐bits to solve complex ...
Jihyun Kim +3 more
wiley +1 more source