Results 41 to 50 of about 5,666,790 (163)
Ain Shams Engineering JournalThe Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem and is also categorized as NP-hard problem. The Multiple Traveling Salesmen Problem (MTSP) represents a variant of TSP, which is more complex and holds greater practical
Lun Zhu, Yongquan Zhou, Qifang Luo
doaj +1 more source
The application of machine learning models to optimal TSP tour length estimation
International Transactions in Operational Research, EarlyView.Abstract The traveling salesman problem (TSP) is a well‐known NP‐hard problem in combinatorial optimization, with numerous applications in logistics and elsewhere. This paper introduces a machine learning‐based approach to estimate the optimal tour length of the TSP, using linear regression, random forests (RF), and neural networks, including ...
Shuhan Kou, Bruce Golden, Luca Bertazzi
wiley +1 more source
A memetic ant colony optimization algorithm for the dynamic travelling salesman problem [PDF]
, 2010 Copyright @ Springer-Verlag 2010.Ant colony optimization (ACO) has been successfully applied for combinatorial optimization problems, e.g., the travelling salesman problem (TSP), under stationary environments.
Yang, S +5 more
core +1 more source
IEEE AccessFor mobile robots with multiple destinations that must be visited only once, the Traveling Salesman Problem (TSP) provides an optimal route. The optimality may not be achieved for crawler robots, which are often used in the forestry industry and have a ...
Namihei Adachi, Hisashi Date
doaj +1 more source
JOIN: Jurnal Online Informatika, 2018 Traveling salesman problem (TSP) is the problem of a salesman to visit the city of each city connected to each other and there is the weight of travel between the cities so as to form a complete weighted graph.
Rio Guntur Utomo +2 more
doaj +1 more source
International Transactions in Operational Research, Volume 33, Issue 6, Page 3714-3743, November 2026.Abstract This paper investigates an extension of the vehicle routing problem in which, in addition to minimizing the distance traveled, the sequencing of customer visits is subject to precedence constraints that impose visiting priorities among customers.
Eduardo dos Santos Teixeira +1 more
wiley +1 more source
Analisis Hibridisasi Pencarian Lokal Dengan Populasi Dalam Travelling Salesman Problem (TSP)
Jurnal Serambi Engineering, 2018 Traveling Salesman Problem (TSP) merupakan sebuah permasalah optimasi yang dapat diterapkan pada berbagai kegiatan seperti pendistribusian barang, pengambilan tagihan listirk dan pedagang keliling.
Erdiwansyah Erdiwansyah* +3 more
doaj +1 more source
A Memetic Algorithm Based on Breakout Local Search for the Generalized Traveling Salesman Problem
Applied Artificial Intelligence, 2020 The Traveling Salesman Problem (TSP) is one of the most popular Combinatorial Optimization Problem. It is well solicited for the large variety of applications that it can solve, but also for its difficulty to find optimal solutions.
Mehdi El Krari +2 more
doaj +1 more source
A Critical Analysis of Optimization Algorithms for Cultural Heritage Conservation and Management
Engineering Reports, Volume 8, Issue 10, October 2026.Methodological framework and decision‐support roadmap for optimization algorithms in cultural heritage conservation and management. ABSTRACT Heritage buildings symbolize cultural identity, architectural character, and historical epitome of communities.
Eslam Mohammed Abdelkader +6 more
wiley +1 more source
A Genetic Algorithm with New Local Operators for Multiple Traveling Salesman Problems
International Journal of Computational Intelligence Systems, 2018 Multiple Traveling Salesman Problem (MTSP) is able to model and solve various real-life applications such as multiple scheduling, multiple vehicle routing and multiple path planning problems, etc.
Kin-Ming Lo +5 more
doaj +1 more source