Results 41 to 50 of about 21,266 (220)
Tạp chí Khoa học Đại học Đà Lạt, 2017 The Traveling Salesman Problem (TSP) is the most prominent of the combinatorial optimization problems that belongs to NP-Hard. The best algorithm for solving TSP is the branch-bound algorithm with exponential-time complexity.
Đỗ Như An
doaj +1 more source
A Hybrid Cellular Genetic Algorithm for the Traveling Salesman Problem
Mathematical Problems in Engineering, 2021 The traveling salesman problem (TSP), a typical non-deterministic polynomial (NP) hard problem, has been used in many engineering applications. Genetic algorithms are useful for NP-hard problems, especially the traveling salesman problem. However, it has
Yanlan Deng, Juxia Xiong, Qiuhong Wang
semanticscholar +1 more source
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 +2 more
doaj +1 more source
A collaborative neurodynamic optimization algorithm to traveling salesman problem
Complex & Intelligent Systems, 2022 This paper proposed a collaborative neurodynamic optimization (CNO) method to solve traveling salesman problem (TSP). First, we construct a Hopfield neural network (HNN) with $$n \times n$$ n × n neurons for the n cities.
Jing Zhong +5 more
doaj +1 more source
A Carnivorous Plant Algorithm With Heuristic Decoding Method for Traveling Salesman Problem
IEEE Access, 2022 The traveling salesman problem (TSP) is one of the most extensively studied problems in the combinatorial optimization area and still presents unsolved challenges due to its NP-hard attribute.
Jiquan Wang +6 more
doaj +1 more source
Optimization Approaches for the Traveling Salesman Problem with Drone
Transportation Science, 2016 The fast and cost-efficient home delivery of goods ordered online is logistically challenging. Many companies are looking for new ways to cross the last mile to their customers. One technology-enabled opportunity that recently has received much attention
Niels A. H. Agatz, P. Bouman, M. Schmidt
semanticscholar +1 more source
Solving the Traveling Salesman Problem: A Modified Metaheuristic Algorithm
Complex, 2021 The traveling salesman problem (TSP) is one of the most important issues in combinatorial optimization problems that are used in many engineering sciences and has attracted the attention of many scientists and researchers.
M. Yousefikhoshbakht
semanticscholar +1 more source
Traveling Salesman Problems With Replenishment Arcs and Improved Ant Colony Algorithms
IEEE Access, 2021 The traveling salesman problem (TSP), can be used as a typical combinatorial optimization problem, to describe a wide variety of practical engineering optimization problems in various fields.
Xiaoxu Zeng +4 more
doaj +1 more source
Traveling Salesman Problem with Transportation [PDF]
Computer Science Journal of Moldova, 2006 Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined – a synthesis of classical TSP and classical Transportation Problem.
Valeriu Ungureanu
doaj
Perbandingan Algoritma Genetika dan TSP Untuk Optimalisasi Jaringan Akses Fiber To The Home
JuTISI (Jurnal Teknik Informatika dan Sistem Informasi), 2017 Genetic algorithm and TSP are methods that can be solve optimization problem of route or path. This paper discusses the application of genetic algorithms and Traveling Salesman Problem modeling (TSP) to those problems.
Try Feby Ramadonna +2 more
doaj +1 more source