Results 51 to 60 of about 11,422 (178)
Redefining Optimal Coverage Path Planning for FLS‐Equipped AUVs With Deep Reinforcement Learning
Journal of Field Robotics, EarlyView.ABSTRACT Autonomous Underwater Vehicles (AUVs) have emerged as indispensable tools for a variety of subsea tasks, from habitat monitoring and seabed mapping to infrastructure inspection and mine countermeasures. A fundamental challenge in this field is Coverage Path Planning (CPP), the problem of ensuring complete and efficient area coverage.
Lorenzo Cecchi +3 more
wiley +1 more source
A New Generalized Partition Crossover for the Traveling Salesman Problem: Tunneling Between Local Optima [PDF]
, 2020 Generalized Partition Crossover (GPX) is a deterministic recombination operator developed for the Traveling Salesman Problem. Partition crossover operators return the best of 2 k reachable offspring, where k is the number of recombining components.
Tinós, Renato +2 more
core +1 more source
Genetiniai algoritmai komivojažieriaus uždaviniui: negatyvieji ir pozityvieji aspektai*
Informacijos Mokslai, 2009 Šiame straipsnyje nagrinėjami klausimai, susiję su genetinių algoritmų taikymu, sprendžiant gerai žinomą kombinatorinio optimizavimo uždavinį – komivojažieriaus uždavinį (KU) (angl. traveling salesman problem).
Alfonsas Misevičius +3 more
doaj +1 more source
Solving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm [PDF]
Journal of Optimization in Industrial Engineering, 2014 The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution.
Hossein Larki, Majid Yousefikhoshbakht
doaj
Random gravitational emulation search algorithm (RGES (in scheduling traveling salesman problem
International Journal of Industrial Engineering and Production Research, 2018 this article proposes a new algorithm for finding a good approximate set of non-dominated solutions for solving generalized traveling salesman problem.
Ahmad Sheibat Alhamdi +1 more
doaj +2 more sources
A Theoretical Approach for Structuring and Analysing Knowledge Provenance for Visual Analytics
Computer Graphics Forum, EarlyView.VAKG unfolds the interactions within the current knowledge model (A) into a temporal knowledge graph (B), which is structured as a 4‐way graph containing two temporal (green) and two static (yellow) knowledge graphs. By using VAKG, one can structure and store the user's knowledge‐gathering process and all related interactions for eventual analysis (C).
L. Christino +3 more
wiley +1 more source
OPTIMAL TOUR CONSTRUCTIONS FOR MULTIPLE MOBILE ROBOTS [PDF]
Journal of Engineering Science and Technology, 2011 The attempts to use mobile robots in a variety of environments are currently being limited by their navigational capability, thus a set of robots must be configured for one specific environment. The problem of navigating an environment is the fundamental
AMIR A. SHAFIE
doaj
Parallel DNA Algorithms of Generalized Traveling Salesman Problem-Based Bioinspired Computing Model
International Journal of Computational Intelligence Systems, 2020 Generalized traveling salesman problem (GTSP) is a classical combinatorial optimization problem, in which the optimization goal is the minimum route combination. Since the GTSP is a more complex problem than the traveling salesman problem (TSP), the GTSP
Xiaomin Ren +3 more
doaj +1 more source
Journal of Marine Science and Engineering, 2023 Sea transportation such as that by container ships has an essential role in the economy both locally and internationally. Ships are a major commodity in distributing goods over long distances due to their relatively low price compared to air shipping ...
Gunawan +4 more
doaj +1 more source
The intermittent travelling salesman problem [PDF]
International Transactions in Operational Research, 2018 AbstractIn this paper, we introduce a new variant of the travelling salesman problem, namely the intermittent travelling salesman problem (ITSP), which is inspired by real‐world drilling/texturing applications. In this problem, each vertex can be visited more than once and there is a temperature constraint enforcing a time lapse between two consecutive
Pham, Tú San +2 more
openaire +2 more sources