Results 51 to 60 of about 166,209 (267)

Solving Dynamic Traveling Salesman Problem Using Dynamic Gaussian Process Regression

Journal of Applied Mathematics, 2014
This paper solves the dynamic traveling salesman problem (DTSP) using dynamic Gaussian Process Regression (DGPR) method. The problem of varying correlation tour is alleviated by the nonstationary covariance function interleaved with DGPR to generate a ...
Stephen M. Akandwanaho, Aderemi O. Adewumi, Ayodele A. Adebiyi   +2 more
doaj   +1 more source

An Adaptive Ant Colony Optimization for Solving Large-Scale Traveling Salesman Problem

Mathematics, 2023
The ant colony algorithm faces dimensional catastrophe problems when solving the large-scale traveling salesman problem, which leads to unsatisfactory solution quality and convergence speed.
Kezong Tang, Xiong-Fei Wei, Yuan-Hao Jiang, Zi-Wei Chen, Lihua Yang   +4 more
doaj   +1 more source

The Quantum Approximate Algorithm for Solving Traveling Salesman Problem

Computers Materials & Continua, 2020
The Quantum Approximate Optimization Algorithm (QAOA) is an algorithmic framework for finding approximate solutions to combinatorial optimization problems.
Yue Ruan, S. Marsh, Xiling Xue, Zhihao Liu, Jingbo B. Wang   +4 more
semanticscholar   +1 more source

Quantifying Structural Complexity, Effort, and Performance: An Early Experiment Using Network Design Tasks

Systems Engineering, EarlyView.
ABSTRACT Structural Complexity is perceived as driving cost in system development, yet managing it effectively requires empirical understanding. This study investigates human decision‐making using a toy transportation‐style network design task, focusing on how Structural Complexity, Effort, and Performance interact. Seventy‐four participants (primarily
Alfonso Lanza, Joshua Sutherland, Marc‐Andre Chavy‐Macdonald, Olivier L. de Weck   +3 more
wiley   +1 more source

On the Nearest Neighbor Rule for the Metric Traveling Salesman Problem [PDF]

, 2014
We present a very simple family of traveling salesman instances with $n$ cities where the nearest neighbor rule may produce a tour that is $\Theta(\log n)$ times longer than an optimum solution.
Hougardy, Stefan, Wilde, Mirko
core  

Quantum annealing of the Traveling Salesman Problem

, 2004
We propose a path-integral Monte Carlo quantum annealing scheme for the symmetric Traveling Salesman Problem, based on a highly constrained Ising-like representation, and we compare its performance against standard thermal Simulated Annealing.
D. J. Wales, D. S. Johnson, Erio Tosatti, Giuseppe E. Santoro, Roman Martoňák   +4 more
core   +1 more source

Insights into the application of the traveling salesman problem to logistics without considering financial risk: A bibliometric study [PDF]

Management Science Letters
Suppliers can use different strategies to distribute their products, Among the most common complex optimization problems related to the transportation of products is the traveling salesman problem.
Amir Mohammad Larni-Fooeik, Nima Ghasemi, Emran Mohammadi   +2 more
doaj   +1 more source

Quantum heuristic algorithm for traveling salesman problem

, 2012
We propose a quantum heuristic algorithm to solve a traveling salesman problem by generalizing Grover search. Sufficient conditions are derived to greatly enhance the probability of finding the tours with extremal costs, reaching almost to unity and they
A. M. Childs, A. W. Harrow, B. P. Lanyon, C. A. Trugenburger, Changhyoup Lee, E. Biham, E. Farhi, E. Farhi, G. L. Long, J. Beardwood, James Lim, Jeongho Bang, Jinhyoung Lee, Junghee Ryu, L. K. Grover, L. K. Grover, L. K. Grover, M. Dobšíček, M. R. Garey, M. Znidaric, N. Burgess, N. Schuch, P. W. Shor, P. W. Shor, P. Zanardi, R. M. Karp, R. Martonak, S. Kirkpatrick, Seokwon Yoo, T. Hogg, T. Hogg, V. Cerny   +31 more
core   +1 more source

An Improved Whale Optimization Algorithm for the Traveling Salesman Problem

Symmetry, 2020
The whale optimization algorithm is a new type of swarm intelligence bionic optimization algorithm, which has achieved good optimization results in solving continuous optimization problems.
Jin Zhang, Li Hong, Qing Liu
semanticscholar   +1 more source

Constant-Factor Approximation for TSP with Disks [PDF]

, 2016
We revisit the traveling salesman problem with neighborhoods (TSPN) and present the first constant-ratio approximation for disks in the plane: Given a set of $n$ disks in the plane, a TSP tour whose length is at most $O(1)$ times the optimal can be ...
Dumitrescu, Adrian, Tóth, Csaba D.
core