Zobrazeno 1 - 10
of 433
pro vyhledávání: '"traveling salesman problem (tsp)"'
Autor:
LIANG Jianheng
Publikováno v:
Kongzhi Yu Xinxi Jishu, Iss 3, Pp 80-85 (2024)
The intelligent navigation system of tourism parks typically functions to recommend diverse sightseeing paths for tourists of different age groups, comprehensively considering factors such as path distances and the geographical location of all the sc
Externí odkaz:
https://doaj.org/article/f8b9b705ed1e4ec39f7e39b65879d645
Publikováno v:
Smart Agricultural Technology, Vol 8, Iss , Pp 100450- (2024)
This study investigates optimal routing with a road network to minimize the total traveling distance among scattered farm fields for smart agriculture. Based on the case of an agricultural corporation in Japan, the shortest paths between all pairs of
Externí odkaz:
https://doaj.org/article/cafc703acdc84c51b8c39320ca453958
Publikováno v:
IEEE Transactions on Quantum Engineering, Vol 5, Pp 1-12 (2024)
Grover adaptive search (GAS) is a quantum exhaustive search algorithm designed to solve binary optimization problems. In this article, we propose higher order binary formulations that can simultaneously reduce the numbers of qubits and gates required
Externí odkaz:
https://doaj.org/article/65632f20c39a487e8421403c4ec56e70
Publikováno v:
Jurnal Lebesgue, Vol 4, Iss 3, Pp 1560-1568 (2023)
Effectiveness and efficiency are very important for an expedition company in optimizing the delivery of goods by a courier. The Traveling salesman problem (TSP) method using the Nearest Neighbor Algorithm can optimize the delivery of goods to all con
Externí odkaz:
https://doaj.org/article/cc5373d93e494247ae1b1a1e52dfdd66
Autor:
Md. Azizur Rahman, Jinwen Ma
Publikováno v:
Mathematics, Vol 12, Iss 9, p 1340 (2024)
As a classical combinatorial optimization problem, the traveling salesman problem (TSP) has been extensively investigated in the fields of Artificial Intelligence and Operations Research. Due to being NP-complete, it is still rather challenging to so
Externí odkaz:
https://doaj.org/article/ca574ce0a0da4664a2a8b79f6d1846ea
Publikováno v:
Frontiers in Computer Science, Vol 5 (2023)
In the ever-evolving landscape of global trade and supply chain management, logistics optimization stands as a critical challenge. This study takes on the Vehicle Routing Problem (VRP), a variant of the Traveling Salesman Problem (TSP), by proposing
Externí odkaz:
https://doaj.org/article/183c3650f2a04115ada8ec446dd7f01b
Publikováno v:
IEEE Access, Vol 11, Pp 28190-28198 (2023)
This work aims to develop a search planning strategy to be used by a drone equipped with an inverse synthetic-aperture radar (ISAR) and an electro-optical sensor. After describing the specifics of our maritime scenario, we discuss four methodologies
Externí odkaz:
https://doaj.org/article/796fff892b784934aa088b91d36a6788
Publikováno v:
Jisuanji kexue yu tansuo, Vol 16, Iss 12, Pp 2797-2808 (2022)
In order to solve the problems of slow convergence speed and easy to fall into local optimum of tradi-tional ant colony algorithm in solving traveling salesman problem (TSP), the dual ant colony algorithm based on backtracking migration and matching
Externí odkaz:
https://doaj.org/article/87a27208832641499dd9beae2b45e151
Publikováno v:
Jisuanji kexue yu tansuo, Vol 16, Iss 6, Pp 1390-1404 (2022)
In order to solve the problems of traditional ant colony algorithm in traveling salesman problem (TSP), such as easy to fall into local optimum and slow convergence speed, this paper proposes an ant colony algorithm based on price fluctuation strateg
Externí odkaz:
https://doaj.org/article/a7533c9b7b4d43a5a2291439deaba283
Publikováno v:
Drones, Vol 7, Iss 10, p 642 (2023)
Small fixed-wing electric Unmanned Aerial Vehicles (UAVs) are perfect candidates to perform tasks in wide areas, such as photogrammetry, surveillance, monitoring, or search and rescue, among others. They are easy to transport and assemble, have much
Externí odkaz:
https://doaj.org/article/a2fbece7ad0b43a6a1b3bf146040a706