Results 41 to 50 of about 4,258 (228)
Some new results on the travelling salesman problem
Vallis Aurea, 2015 The travelling salesman problem (or The sales representative problem) has been insufficiently explored so far. One of the first results on this issue was provided by Euler in 1759 (The problem of moving a knight on the chess board), Knight's Tour Problem.
Dominika Crnjac Milić +1 more
doaj +1 more source
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
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
A comparison of heuristic and human performance on open versions of the traveling salesperson problem. [PDF]
, 2006 We compared the performance of three heuristics with that of subjects on variants of a well-known combinatorial optimization task, the Traveling Salesperson Problem (TSP). The present task consisted of finding the shortest path through an array of points
MacGregor, James N. +6 more
core +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 Electronic Materials, EarlyView.Ising machines are emerging as specialized hardware solvers for computationally hard optimization problems. This review examines five major platforms—digital CMOS, analog CMOS, emerging devices, coherent optics, and quantum systems—highlighting physics‐rooted advantages and shared bottlenecks in scalability and connectivity.
Hyunjun Lee, Joon Pyo Kim, Sanghyeon Kim
wiley +1 more source
Business Strategy and the Environment, EarlyView.ABSTRACT This study demonstrates how a profitable, lean, and environmentally responsible e‐waste reverse logistics system can be designed using integrated Operations Research (OR) techniques. Addressing the growing urgency of responsible consumption (UN SDG 12) and the projected rise of the e‐waste sector to USD 137.60 billion by 2029, the research ...
Sheeba Pathak, Hajar Fatorachian
wiley +1 more source
The centred travelling salesman at high temperature [PDF]
, 2006 A recently formulated statistical mechanics method is used to study the phase transition occurring in a generalisation of the Traveling Salesman Problem (TSP) known as the centred TSP. The method shows that the problem has clear signs of a crossover, but
Lancaster, D.J.
core +1 more source