Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Joanna Karbowska-Chilinska"'
Autor:
Jolanta Koszelew, Joanna Karbowska-Chilinska, Krzysztof Ostrowski, Piotr Kuczyński, Eric Kulbiej, Piotr Wołejsza
Publikováno v:
Sensors, Vol 20, Iss 15, p 4115 (2020)
A single anti-collision trajectory generation problem for an “own” vessel only is significantly different from the challenge of generating a whole set of safe trajectories for multi-surface vehicle encounter situations in the open sea. Effective
Externí odkaz:
https://doaj.org/article/badfcd6c4d0e482f892e60aea5896ab7
Publikováno v:
Computer Information Systems and Industrial Management ISBN: 9783030476786
CISIM
CISIM
The problem of selection points of interest which tourist wants to visit the most in the case when tourist travels by electric vehicle (EV) is examined in this paper. Furthermore the battery capacity of EVs is limited so charging stations are selecte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::49c71ac462cdbcab646fdedf9e17ba71
https://doi.org/10.1007/978-3-030-47679-3_31
https://doi.org/10.1007/978-3-030-47679-3_31
Publikováno v:
Annals of Operations Research. 253:519-543
The orienteering problem (OP) is defined on a graph with scores assigned to the vertices and weights attached to the links. The objective of solutions to the OP is to find a route over a subset of vertices, limited in length, that maximizes the colle
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::279853b89493e70db55b7a892e2b6647
https://doi.org/10.1007/s10479-016-2278-1
https://doi.org/10.1007/s10479-016-2278-1
Autor:
Piotr Wołejsza, Piotr Kuczynski, Eric Kulbiej, Krzysztof Ostrowski, Jolanta Koszelew, Joanna Karbowska-Chilinska
Publikováno v:
Sensors
Volume 19
Issue 24
Sensors (Basel, Switzerland)
Volume 19
Issue 24
Sensors (Basel, Switzerland)
The biggest challenges in the maritime environment are accidents and excessive fuel consumption. In order to improve the safety of navigation at sea and to reduce fuel consumption, the strategy of anti-collision, shortest trajectory planning is propo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bad225c8f253c4b977cf4fba6c384d41
https://doi.org/10.3390/s19245338
https://doi.org/10.3390/s19245338
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9783319911885
CSOS (2)
CSOS (2)
This paper presents heuristics approach for the problem of generation an optimal multistage tourist route of electric vehicle (EV). For the given starting and a final point (being EV charging stations) the points of interests (POIs) are included whic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8ad1fb9feb72b601f12446119079898f
https://doi.org/10.1007/978-3-319-91189-2_19
https://doi.org/10.1007/978-3-319-91189-2_19
Publikováno v:
Computer Information Systems and Industrial Management ISBN: 9783319591049
CISIM
Lecture Notes in Computer Science
16th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM)
16th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Jun 2017, Bialystok, Poland. pp.514-525, ⟨10.1007/978-3-319-59105-6_44⟩
CISIM
Lecture Notes in Computer Science
16th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM)
16th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Jun 2017, Bialystok, Poland. pp.514-525, ⟨10.1007/978-3-319-59105-6_44⟩
Part 6: Modelling and Optimization; International audience; This paper presents model and an algorithmic approach for the problem of generation optimal tourist route for electric vehicles (EVs). In the discussed problem a starting and a final point o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dfb7bc6d71db19d85fac32a008e9d71f
https://doi.org/10.1007/978-3-319-59105-6_44
https://doi.org/10.1007/978-3-319-59105-6_44
Publikováno v:
Scopus-Elsevier
The Orienteering Problem with Time Windows (OPTW) is an optimisation NP-hard problem. This paper proposes a hybrid genetic algorithm (GAPR) for approximating a solution to the OPTW. Instead of a crossover we use a path relinking (PR) strategy as a fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::78f0ac71a4dd201e6d1df99e0d66be1c
https://doi.org/10.3233/fi-2014-1132
https://doi.org/10.3233/fi-2014-1132
Publikováno v:
Intelligent Information and Database Systems ISBN: 9783319157047
ACIIDS (2)
ACIIDS (2)
In the Orienteering Problem (OP), a set of linked vertices, each with a score, is given. The objective is to find a route, limited in length, over a subset of vertices that maximises the collective score of the visited vertices. In this paper, we pre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::07440d69ff84901cc5485d8d98e25ca7
https://doi.org/10.1007/978-3-319-15705-4_4
https://doi.org/10.1007/978-3-319-15705-4_4
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9783319018560
ICSS
ICSS
The Orienteering Problem with Time Windows (OPTW) is a well-known routing problem in which a given positive profit and time interval are associated with each location. The solution to the OPTW finds a route comprising a subset of the locations, with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e182eb70233d7c97870642dbfa4fe2e
https://doi.org/10.1007/978-3-319-01857-7_59
https://doi.org/10.1007/978-3-319-01857-7_59
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642373428
KES (Selected Papers)
KES (Selected Papers)
The Orienteering problem (OP) can be modelled as a weighted graph with set of vertices where each has a score. The main OP goal is to find a route that maximises the sum of scores, in addition the length of the route not exceeded the given limit. In
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7ecb681cb27bf789572c3bc5153632e1
https://doi.org/10.1007/978-3-642-37343-5_2
https://doi.org/10.1007/978-3-642-37343-5_2