Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Radosław, Grymin"'
Publikováno v:
Archives of Control Sciences, Vol vol. 30, Iss No 4, Pp 653-666 (2020)
The article introduces an innovative approch for the inspection challenge that represents a generalization of the classical Traveling Salesman Problem. Its priciple idea is to visit continuous areas (circles) in a way, that minimizes travelled distan
Externí odkaz:
https://doaj.org/article/902cd3455fcc45d0ae386ef45c84120c
Publikováno v:
16th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2021) ISBN: 9783030878689
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2f0e6eb040b3618059ac9724ffda0741
https://doi.org/10.1007/978-3-030-87869-6_71
https://doi.org/10.1007/978-3-030-87869-6_71
Publikováno v:
National Information Processing Institute
The paper deals with scheduling and routing rail freight transportation. There are provided mathematical descriptions of constraints in the real rail transportation such as timetables of passenger trains, safety time buffers etc. We developed an algo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c7d4a4f399a40785458dcdf362416f82
https://doi.org/10.1016/j.proeng.2017.01.098
https://doi.org/10.1016/j.proeng.2017.01.098
Publikováno v:
Smart Innovations in Engineering and Technology ISBN: 9783030328603
An autonomous aerial inspection using unmanned aerial vehicles (UAVs) requires effective and nearly optimal algorithms for scheduling UAVs. A UAV performing aerial inspection does not need to take photos of inspected objects from exact given points i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b782f8cf0fe6ada1ec89035b0ff4be9e
https://doi.org/10.1007/978-3-030-32861-0_17
https://doi.org/10.1007/978-3-030-32861-0_17
Publikováno v:
Lecture Notes in Computer Science
15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM)
15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Sep 2016, Vilnius, Lithuania. pp.289-299, ⟨10.1007/978-3-319-45378-1_26⟩
Computer Information Systems and Industrial Management ISBN: 9783319453774
CISIM
15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM)
15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Sep 2016, Vilnius, Lithuania. pp.289-299, ⟨10.1007/978-3-319-45378-1_26⟩
Computer Information Systems and Industrial Management ISBN: 9783319453774
CISIM
Part 5: Scheduling in Manufacturing and Other Applications; International audience; In this paper a new efficient tabu search algorithm for assigning freight to the intermodal transport connections was developed. There were also formulated properties
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::026b68aa7ea6842b8e0c440841054b37
https://hal.inria.fr/hal-01637497/file/419526_1_En_26_Chapter.pdf
https://hal.inria.fr/hal-01637497/file/419526_1_En_26_Chapter.pdf
Autor:
Radosław Grymin, Szymon Jagiełło
Publikováno v:
Computer Information Systems and Industrial Management ISBN: 9783319453774
CISIM
Lecture Notes in Computer Science
15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM)
15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Sep 2016, Vilnius, Lithuania. pp.206-217, ⟨10.1007/978-3-319-45378-1_19⟩
CISIM
Lecture Notes in Computer Science
15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM)
15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Sep 2016, Vilnius, Lithuania. pp.206-217, ⟨10.1007/978-3-319-45378-1_19⟩
Part 4: Optimization, Tuning; International audience; New strategies are proposed for implementing algorithms based on Branch and Bound scheme. Those include two minimal spanning tree lower bound modifications, a design based on the fact that edges i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::221d161663fdce85e406f34b6b480868
https://doi.org/10.1007/978-3-319-45378-1_19
https://doi.org/10.1007/978-3-319-45378-1_19