Results 71 to 80 of about 496 (169)

K-DSA for the Multiple Traveling Salesman Problem

Journal of Systems Engineering and Electronics, 2023
Sheng Tong, Hong Qu, Junjie Xue
openaire   +1 more source

A hybrid genetic algorithm for the min–max Multiple Traveling Salesman Problem

Computers & Operations Research
This paper proposes a hybrid genetic algorithm for solving the Multiple Traveling Salesman Problem (mTSP) to minimize the length of the longest tour. The genetic algorithm utilizes a TSP sequence as the representation of each individual, and a dynamic programming algorithm is employed to evaluate the individual and find the optimal mTSP solution for ...
Sasan Mahmoudinazlou, Changhyun Kwon
openaire   +3 more sources

QUANTUM INSPIRED EVOLUTIONARY ALGORITHM FOR SOLVING MULTIPLE TRAVELLING SALESMAN PROBLEM

International Journal of Research in Engineering and Technology, 2013
Quantum computing is a relatively new but very promising field of computer science. It provides an alternative way of building computers which are significantly better than current day’s classical computers. Here in this paper, we attempt to develop an algorithm which makes use of the concepts of quantum computers but are actually run on classical ...
openaire   +1 more source

Algorithm for DNA sequence assembly by quantum annealing. [PDF]

BMC Bioinformatics, 2022
Nałęcz-Charkiewicz K, Nowak RM.
europepmc   +1 more source

A Goal-Directed Trajectory Planning Using Active Inference in UAV-Assisted Wireless Networks. [PDF]

Sensors (Basel), 2023
Krayani A, Khan K, Marcenaro L, Marchese M, Regazzoni C.   +4 more
europepmc   +1 more source

Clustering-Based Optimisation of Multiple Traveling Salesman Problem

Production Systems and Information Engineering, 2019
Agárdi, Anita, Kovács, László
openaire   +2 more sources

A Bi-level Approach for a Dynamic Multiple Traveling Salesman Problem

Journal of Optimization Theory and Applications
Abstract In this paper, we consider a routing problem with multiple dynamic targets and agents starting from a depot for which only the trajectories of the targets and depot are known. The objective is that each target is reached by exactly one agent and that all agents return to the depot in the minimum amount of time.
openaire   +1 more source

The Economy of Motion for Laparoscopic Ball Clamping Surgery: A Feedback Educational Tool. [PDF]

MethodsX, 2023
Shbool MA, Al-Bazi A, Kokash A, AlAlaween WH, Albashabsheh NT, Al-Taher R.   +5 more
europepmc   +1 more source

Data Collection in an IoT Off-Grid Environment Systematic Mapping of Literature. [PDF]

Sensors (Basel), 2022
Goulart A, Pinto ASR, Boava A, Branco K.
europepmc   +1 more source

Quantum computing for transport network design problems. [PDF]

Sci Rep, 2023
Dixit VV, Niu C.
europepmc   +1 more source