Results 41 to 50 of about 30,647 (208)
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 hybrid genetic algorithm and inver over approach for the travelling salesman problem [PDF]
, 2010 This article posted here with permission of the IEEE - Copyright @ 2010 IEEEThis paper proposes a two-phase hybrid approach for the travelling salesman problem (TSP).
Arshad, S, Yang, S
core +2 more sources
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 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
Surrogate Assisted Optimisation for Travelling Thief Problems
, 2020 The travelling thief problem (TTP) is a multi-component optimisation problem involving two interdependent NP-hard components: the travelling salesman problem (TSP) and the knapsack problem (KP).
Namazi, Majid +3 more
core +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
Genetic algorithm to the bi-objective multiple travelling salesman problem
Alexandria Engineering JournalThe 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 +1 more
doaj +1 more source
Two Phase Heuristic Algorithm for theMultiple-Travelling Salesman Problem [PDF]
, 2018 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,
CQ Hu +10 more
core +1 more source
Multi‐Agent Reinforcement Learning for Joint Police Patrol and Dispatch
Naval Research Logistics (NRL), EarlyView.ABSTRACT Police patrol units need to split their time between performing preventive patrol and being dispatched to serve emergency incidents. In the existing literature, patrol and dispatch decisions are often studied separately. We consider joint optimization of these two decisions to improve police operations efficiency and reduce response time to ...
Matthew Repasky, He Wang, Yao Xie
wiley +1 more source