Zobrazeno 1 - 10
of 1 302
pro vyhledávání: '"Orienteering problem"'
Autor:
Ayşegül Atak, Diclehan Tezcaner Öztürk
Publikováno v:
Uludağ University Journal of The Faculty of Engineering, Vol 29, Iss 2, Pp 413-430 (2024)
İnsanlı veya insansız hava araç sistemleri ile birlikte keşif ve gözetleme, kara ve sınır güvenliği, arama ve kurtarma operasyonları gibi önemli faaliyetler yürütülür. Özellikle insansız hava araçlarının kullanımı ile hem sivil
Externí odkaz:
https://doaj.org/article/cc0f7984da04426d98cc0323660a0a07
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Zongtao Liu, Wei Dong, Chaoliang Wang, Haoqingzi Shen, Gang Sun, Qun jiang, Quanjin Tao, Yang Yang
Publikováno v:
AI Open, Vol 5, Iss , Pp 46-54 (2024)
Recently, several studies explore to use neural networks(NNs) to solve different routing problems, which is an auspicious direction. These studies usually design an encoder–decoder based framework that uses encoder embeddings of nodes and the probl
Externí odkaz:
https://doaj.org/article/542d311579d34ff49079420d12e31383
Publikováno v:
Mathematics, Vol 12, Iss 19, p 3089 (2024)
This study addresses the set orienteering problem with mandatory visits (SOPMV), a variant of the team orienteering problem (SOP). In SOPMV, certain critical sets must be visited. The study began by formulating the mathematical model for SOPMV. To ta
Externí odkaz:
https://doaj.org/article/3a4fb278d6cd42bf9eec9bd9f9188e7e
Publikováno v:
Mathematics, Vol 12, Iss 19, p 3140 (2024)
In urban logistics, effective maintenance is crucial for maintaining the reliability and efficiency of energy supply systems, impacting both asset performance and operational stability. This paper addresses the scheduling and routing plans for mainte
Externí odkaz:
https://doaj.org/article/64464eee6b9941649b6221473fb3f7e3
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Mathematics, Vol 12, Iss 11, p 1758 (2024)
The team orienteering problem (TOP) is a well-studied optimization challenge in the field of Operations Research, where multiple vehicles aim to maximize the total collected rewards within a given time limit by visiting a subset of nodes in a network
Externí odkaz:
https://doaj.org/article/e064e9ccc1ef4e6a9b3ff4806bee4c69
Autor:
Giovano Alberto, Carles Sitompul
Publikováno v:
Jurnal Optimasi Sistem Industri, Vol 22, Iss 2 (2023)
In today's travel and tourism landscape, the role of travel agents has become increasingly complex as they are challenged to explore a variety of potential destinations. More specifically, the complicated task of planning itineraries that truly satis
Externí odkaz:
https://doaj.org/article/4199488e832b4f04abcce885d4548920
Autor:
Roberto Montemanni, Derek H. Smith
Publikováno v:
Logistics, Vol 8, Iss 2, p 48 (2024)
Background: The Clustered Orienteering Problem is an optimization problem faced in last-mile logistics. The aim is, given an available time window, to visit vertices and to collect as much profit as possible in the given time. The vertices to visit h
Externí odkaz:
https://doaj.org/article/3bd1686f6a8b46ada052130b6af2742c