Array
(
[page] => 114
[item_count] => 2086
[items_per_page] => 15
[data] => Array
(
[0] => Array
(
[vysledek_id] => 108681
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 109914
[vysledek_rok] => 2001
[nazev] => Distribution Problems, Their Modifications and Applications
[nazev_orig] => Distribution Problems, Their Modifications and Applications
[duvernost_udaju_id] => S
[popis] => In this paper, we deal with well-known distribution problems and discuss their restrictions, extensions and modifications including a possible application in agriculture. We show that the transportation problem can be transformed to an assignment problem using special constraints, but because of NP-hardness it needs quite different methods of its solving. Another modification of the transportation problem, the crop problem, has an application in agriculture, but we must deal with uncertain data. We propose a genetic algorithm and fuzzy logic approach for solving these problems.
[popis_orig] => In this paper, we deal with well-known distribution problems and discuss their restrictions, extensions and modifications including a possible application in agriculture. We show that the transportation problem can be transformed to an assignment problem using special constraints, but because of NP-hardness it needs quite different methods of its solving. Another modification of the transportation problem, the crop problem, has an application in agriculture, but we must deal with uncertain data. We propose a genetic algorithm and fuzzy logic approach for solving these problems.
[klicova_slova] => transportation; assignment problem; crop problem, PERT; heuristic; genetic algorithm; fuzzy number
[klicova_slova_orig] => transportation; assignment problem; crop problem, PERT; heuristic; genetic algorithm; fuzzy number
[url] =>
[oecd_obor_id] => 10103
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] =>
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M.; ROUPEC, J.; ŠEDOVÁ, J.
[pocet_tvurcu] => 3
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 978-1-61804-208-8
[identifikator_popis] => ISBN - Recent Advances in Applied Mathematics and Computational Methods
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M.; ROUPEC, J.; ŠEDOVÁ, J. Distribution Problems, Their Modifications and Applications. In Recent Advances in Applied Mathematics and Computational Methods. Venice (Italy): AMCM, 2001. p. 284-289. ISBN: 978-1-61804-208-8.
[citace_html] => ŠEDA, M.; ROUPEC, J.; ŠEDOVÁ, J. Distribution Problems, Their Modifications and Applications. In Recent Advances in Applied Mathematics and Computational Methods. Venice (Italy): AMCM, 2001. p. 284-289. ISBN: 978-1-61804-208-8.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT108681,
author="Miloš {Šeda} and Jan {Roupec} and Jindřiška {Šedová}",
title="Distribution Problems, Their Modifications and Applications",
booktitle="Recent Advances in Applied Mathematics and Computational Methods",
year="2001",
number="1",
pages="284--289",
publisher="AMCM",
address="Venice (Italy)",
isbn="978-1-61804-208-8"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10100
[oecd_tree_obor_nazev] => 1.1 Mathematics
[oecd_tree_podobor_id] => 10103
[oecd_tree_podobor_nazev] => Statistics and probability
[poznamka_metriky] =>
[nazev_en] => Distribution Problems, Their Modifications and Applications
[popis_en] => In this paper, we deal with well-known distribution problems and discuss their restrictions, extensions and modifications including a possible application in agriculture. We show that the transportation problem can be transformed to an assignment problem using special constraints, but because of NP-hardness it needs quite different methods of its solving. Another modification of the transportation problem, the crop problem, has an application in agriculture, but we must deal with uncertain data. We propose a genetic algorithm and fuzzy logic approach for solving these problems.
[klicova_slova_en] => transportation; assignment problem; crop problem, PERT; heuristic; genetic algorithm; fuzzy number
[vysledek_datum] => 2001-05-05T00:00:00+02:00
)
[1] => Array
(
[vysledek_id] => 108682
[vysledek_druh_id] => ART
[ex_vysledek_id] => 109915
[vysledek_rok] => 2014
[nazev] => Transportation Problem and Related Tasks with Application in Agriculture
[nazev_orig] => Transportation Problem and Related Tasks with Application in Agriculture
[duvernost_udaju_id] => S
[popis] => In this paper, we deal with well-known distribution problems and discuss their restrictions, extensions and modifications including a possible application in agriculture. We show that the transportation problem can be transformed to an allocation, location and set covering problem using special constraints, but because of NP-hardness of the last problem it needs quite different methods of its solving. Another modification of the transportation problem, the crop problem, has an application in agriculture, but we must deal with uncertain data. We propose a genetic algorithm and fuzzy logic approach for solving these problems.
[popis_orig] => In this paper, we deal with well-known distribution problems and discuss their restrictions, extensions and modifications including a possible application in agriculture. We show that the transportation problem can be transformed to an allocation, location and set covering problem using special constraints, but because of NP-hardness of the last problem it needs quite different methods of its solving. Another modification of the transportation problem, the crop problem, has an application in agriculture, but we must deal with uncertain data. We propose a genetic algorithm and fuzzy logic approach for solving these problems.
[klicova_slova] => crop problem, set covering problem, transportation, fuzzy number
[klicova_slova_orig] => crop problem, set covering problem, transportation, fuzzy number
[url] =>
[oecd_obor_id] => 10103
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M.; ROUPEC, J.; ŠEDOVÁ, J.
[pocet_tvurcu] => 3
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Článek recenzovaný mimo WoS a Scopus
[druh_popis] => Ostatní články v odborných recenzovaných periodicích splňující definici druhu výsledku
[stav] => Schválený
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISSN 2074-1278
[identifikator_popis] => ISSN - International Journal of Applied Mathematics and Informatics (GB)
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M.; ROUPEC, J.; ŠEDOVÁ, J. Transportation Problem and Related Tasks with Application in Agriculture. International Journal of Applied Mathematics and Informatics, 2014, vol. 8, no. 1, p. 26-33. ISSN: 2074-1278.
[citace_html] => ŠEDA, M.; ROUPEC, J.; ŠEDOVÁ, J. Transportation Problem and Related Tasks with Application in Agriculture. International Journal of Applied Mathematics and Informatics, 2014, vol. 8, no. 1, p. 26-33. ISSN: 2074-1278.
[citace_rtf] =>
[citace_bibtex] => @article{BUT108682,
author="Miloš {Šeda} and Jan {Roupec} and Jindřiška {Šedová}",
title="Transportation Problem and Related Tasks with Application in Agriculture",
journal="International Journal of Applied Mathematics and Informatics",
year="2014",
volume="8",
number="1",
pages="26--33",
issn="2074-1278"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10100
[oecd_tree_obor_nazev] => 1.1 Mathematics
[oecd_tree_podobor_id] => 10103
[oecd_tree_podobor_nazev] => Statistics and probability
[poznamka_metriky] =>
[nazev_en] => Transportation Problem and Related Tasks with Application in Agriculture
[popis_en] => In this paper, we deal with well-known distribution problems and discuss their restrictions, extensions and modifications including a possible application in agriculture. We show that the transportation problem can be transformed to an allocation, location and set covering problem using special constraints, but because of NP-hardness of the last problem it needs quite different methods of its solving. Another modification of the transportation problem, the crop problem, has an application in agriculture, but we must deal with uncertain data. We propose a genetic algorithm and fuzzy logic approach for solving these problems.
[klicova_slova_en] => crop problem, set covering problem, transportation, fuzzy number
[vysledek_datum] => 2014-01-15T00:00:00+01:00
)
[2] => Array
(
[vysledek_id] => 108717
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 109926
[vysledek_rok] => 2014
[nazev] => SPATIAL GUIDANCE TO RRT PLANNER USING CELL-DECOMPOSITION ALGORITHM
[nazev_orig] => SPATIAL GUIDANCE TO RRT PLANNER USING CELL-DECOMPOSITION ALGORITHM
[duvernost_udaju_id] => S
[popis] => Motion planning is problematic issue in robotics domain. In this paper we compare very well-known planners, the probabilistic path planning method Rapidly Exploring Random Tree (RRT) and spatial planner as exact Cells-decomposition (CD). We try to make some tradeoff between the efficiency of planning using CD in 2D space and dynamic of planning using RRT by giving the path-point of CD to RRTs planner as spatial guidance to overcome the drawback of this two planners.
[popis_orig] => Motion planning is problematic issue in robotics domain. In this paper we compare very well-known planners, the probabilistic path planning method Rapidly Exploring Random Tree (RRT) and spatial planner as exact Cells-decomposition (CD). We try to make some tradeoff between the efficiency of planning using CD in 2D space and dynamic of planning using RRT by giving the path-point of CD to RRTs planner as spatial guidance to overcome the drawback of this two planners.
[klicova_slova] => RRTs, Cell-decomposition, hybrid planner, randomize samples-based planners, Robot, path planning, motion planning.
[klicova_slova_orig] => RRTs, Cell-decomposition, hybrid planner, randomize samples-based planners, Robot, path planning, motion planning.
[url] =>
[oecd_obor_id] => 10201
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ABBADI, A.; MATOUŠEK, R.; OŠMERA, P.; KNISPEL, L.
[pocet_tvurcu] => 4
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.13140/2.1.3411.2006
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 978-80-214-4984-8 ISSN 1803-3814
[identifikator_popis] => ISBN - 20th International Conference on Soft Computing, MENDEL 2014 (id 22122) ISSN - Mendel Journal series (CZ)
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ABBADI, A.; MATOUŠEK, R.; OŠMERA, P.; KNISPEL, L. SPATIAL GUIDANCE TO RRT PLANNER USING CELL-DECOMPOSITION ALGORITHM. In 20th International Conference on Soft Computing, MENDEL 2014 (id 22122). Mendel Journal series. 2014. Brno: VUT, 2014. no. 1, p. 273-278. ISBN: 978-80-214-4984-8. ISSN: 1803-3814.
[citace_html] => ABBADI, A.; MATOUŠEK, R.; OŠMERA, P.; KNISPEL, L. SPATIAL GUIDANCE TO RRT PLANNER USING CELL-DECOMPOSITION ALGORITHM. In 20th International Conference on Soft Computing, MENDEL 2014 (id 22122). Mendel Journal series. 2014. Brno: VUT, 2014. no. 1, p. 273-278. ISBN: 978-80-214-4984-8. ISSN: 1803-3814.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT108717,
author="Ahmad {Abbadi} and Radomil {Matoušek} and Pavel {Ošmera} and Lukáš {Knispel}",
title="SPATIAL GUIDANCE TO RRT PLANNER USING CELL-DECOMPOSITION ALGORITHM",
booktitle="20th International Conference on Soft Computing, MENDEL 2014 (id 22122)",
year="2014",
series="2014",
journal="Mendel Journal series",
volume="2014",
number="1",
pages="273--278",
publisher="VUT",
address="Brno",
doi="10.13140/2.1.3411.2006",
isbn="978-80-214-4984-8",
issn="1803-3814"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10200
[oecd_tree_obor_nazev] => 1.2 Computer and information sciences
[oecd_tree_podobor_id] => 10201
[oecd_tree_podobor_nazev] => Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
[poznamka_metriky] =>
[nazev_en] => SPATIAL GUIDANCE TO RRT PLANNER USING CELL-DECOMPOSITION ALGORITHM
[popis_en] => Motion planning is problematic issue in robotics domain. In this paper we compare very well-known planners, the probabilistic path planning method Rapidly Exploring Random Tree (RRT) and spatial planner as exact Cells-decomposition (CD). We try to make some tradeoff between the efficiency of planning using CD in 2D space and dynamic of planning using RRT by giving the path-point of CD to RRTs planner as spatial guidance to overcome the drawback of this two planners.
[klicova_slova_en] => RRTs, Cell-decomposition, hybrid planner, randomize samples-based planners, Robot, path planning, motion planning.
[vysledek_datum] => 2014-06-25T00:00:00+02:00
)
[3] => Array
(
[vysledek_id] => 108986
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 110135
[vysledek_rok] => 2014
[nazev] => BATCH SIZE OPTIMIZATION USING COMPUTER SIMULATION FOR THE PURPOSE OF STREAMLINE THE PRODUCTION AND SUSTAINING MARKET POSITION
[nazev_orig] => BATCH SIZE OPTIMIZATION USING COMPUTER SIMULATION FOR THE PURPOSE OF STREAMLINE THE PRODUCTION AND SUSTAINING MARKET POSITION
[duvernost_udaju_id] => S
[popis] => This article refers to the practical application of computer simulation of the
manufacturing system. Computer simulation of specific manufacturing system is used for the purpose of batch size optimization. Results from simulation model and simulation experiments should lead to streamline production of production system and to sustain company market position.
[popis_orig] => This article refers to the practical application of computer simulation of the
manufacturing system. Computer simulation of specific manufacturing system is used for the purpose of batch size optimization. Results from simulation model and simulation experiments should lead to streamline production of production system and to sustain company market position.
[klicova_slova] => computer simulation, optimization, production system, production batch, production scheduling, diagnostic analysis.
[klicova_slova_orig] => computer simulation, optimization, production system, production batch, production scheduling, diagnostic analysis.
[url] =>
[oecd_obor_id] =>
[odpovedny_utvar_id] => 183
[odpovedny_utvar_nazev] => Ústav výrobních strojů, systémů a robotiky
[odpovedny_utvar_zkratka] => ÚVSSR
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2016-05-24
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => SIMEONOVOVÁ, I.; KNOFLÍČEK, R.
[pocet_tvurcu] => 2
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISSN 1310-3946
[identifikator_popis] => ISSN - Sbornik dokladi ot dvadeset i treta meždunarodna naučno-techničeska konferencia (BG)
[riv_dodavka_id] => 1318
[riv_dodavka_oznaceni] => RIV16-MSM-26210___
[riv_dodavka_rok] => 2016
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => SIMEONOVOVÁ, I.; KNOFLÍČEK, R. BATCH SIZE OPTIMIZATION USING COMPUTER SIMULATION FOR THE PURPOSE OF STREAMLINE THE PRODUCTION AND SUSTAINING MARKET POSITION. In Sbornik dokladi ot dvadeset i treta meždunarodna naučno-techničeska konferencia. Sbornik dokladi ot dvadeset i treta meždunarodna naučno-techničeska konferencia. Sozopol: Technická univerzita Sofie, 2014. p. 1-6. ISSN: 1310-3946.
[citace_html] => SIMEONOVOVÁ, I.; KNOFLÍČEK, R. BATCH SIZE OPTIMIZATION USING COMPUTER SIMULATION FOR THE PURPOSE OF STREAMLINE THE PRODUCTION AND SUSTAINING MARKET POSITION. In Sbornik dokladi ot dvadeset i treta meždunarodna naučno-techničeska konferencia. Sbornik dokladi ot dvadeset i treta meždunarodna naučno-techničeska konferencia. Sozopol: Technická univerzita Sofie, 2014. p. 1-6. ISSN: 1310-3946.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT108986,
author="Ivana {Hromková} and Radek {Knoflíček}",
title="BATCH SIZE OPTIMIZATION USING COMPUTER SIMULATION FOR THE PURPOSE OF STREAMLINE THE PRODUCTION AND SUSTAINING MARKET POSITION",
booktitle="Sbornik dokladi ot dvadeset i treta meždunarodna naučno-techničeska konferencia",
year="2014",
journal="Sbornik dokladi ot dvadeset i treta meždunarodna naučno-techničeska konferencia",
pages="1--6",
publisher="Technická univerzita Sofie",
address="Sozopol",
issn="1310-3946"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] =>
[oecd_tree_oblast_nazev] =>
[oecd_tree_obor_id] =>
[oecd_tree_obor_nazev] =>
[oecd_tree_podobor_id] =>
[oecd_tree_podobor_nazev] =>
[poznamka_metriky] =>
[nazev_en] => BATCH SIZE OPTIMIZATION USING COMPUTER SIMULATION FOR THE PURPOSE OF STREAMLINE THE PRODUCTION AND SUSTAINING MARKET POSITION
[popis_en] => This article refers to the practical application of computer simulation of the
manufacturing system. Computer simulation of specific manufacturing system is used for the purpose of batch size optimization. Results from simulation model and simulation experiments should lead to streamline production of production system and to sustain company market position.
[klicova_slova_en] => computer simulation, optimization, production system, production batch, production scheduling, diagnostic analysis.
[vysledek_datum] => 2014-06-19T00:00:00+02:00
)
[4] => Array
(
[vysledek_id] => 108987
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 110141
[vysledek_rok] => 2014
[nazev] => The RRT algorithms and a spatial index
[nazev_orig] => The RRT algorithms and a spatial index
[duvernost_udaju_id] => S
[popis] => The Rapidly-exploring Random Trees algorithm (RRT), based on incremental sampling, is a popular and powerful tool for motion planning problems. Although the RRT algorithm returns the solution relatively quickly, the computational cost of every new algorithm loop increases as the tree grows because of the nearest neighbor searching procedure. This paper solves this problem and improves the RRT performance using a spatial index. Through a series of simulation experiments we evaluate and compare the performance of RRT-based algorithms with and without a spatial index. We report on the results verifying the efficiency of the use of a spatial index
[popis_orig] => The Rapidly-exploring Random Trees algorithm (RRT), based on incremental sampling, is a popular and powerful tool for motion planning problems. Although the RRT algorithm returns the solution relatively quickly, the computational cost of every new algorithm loop increases as the tree grows because of the nearest neighbor searching procedure. This paper solves this problem and improves the RRT performance using a spatial index. Through a series of simulation experiments we evaluate and compare the performance of RRT-based algorithms with and without a spatial index. We report on the results verifying the efficiency of the use of a spatial index
[klicova_slova] => Motion planning, Rapidly-exploring random trees algorithm, spatial index
[klicova_slova_orig] => Motion planning, Rapidly-exploring random trees algorithm, spatial index
[url] =>
[oecd_obor_id] => 10201
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => GULINA, I.; MATOUŠEK, R.
[pocet_tvurcu] => 2
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 978-80-214-4984-8 ISSN 1803-3814
[identifikator_popis] => ISBN - 20th International Conference on Soft Computing, MENDEL 2014 (id 22122) ISSN - Mendel Journal series (CZ)
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => GULINA, I.; MATOUŠEK, R. The RRT algorithms and a spatial index. In 20th International Conference on Soft Computing, MENDEL 2014 (id 22122). Mendel Journal series. 2014. 2014. no. 1, p. 279-284. ISBN: 978-80-214-4984-8. ISSN: 1803-3814.
[citace_html] => GULINA, I.; MATOUŠEK, R. The RRT algorithms and a spatial index. In 20th International Conference on Soft Computing, MENDEL 2014 (id 22122). Mendel Journal series. 2014. 2014. no. 1, p. 279-284. ISBN: 978-80-214-4984-8. ISSN: 1803-3814.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT108987,
author="Irina {Gulina} and Radomil {Matoušek}",
title="The RRT algorithms and a spatial index",
booktitle="20th International Conference on Soft Computing, MENDEL 2014 (id 22122)",
year="2014",
series="2014",
journal="Mendel Journal series",
volume="2014",
number="1",
pages="279--284",
isbn="978-80-214-4984-8",
issn="1803-3814"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10200
[oecd_tree_obor_nazev] => 1.2 Computer and information sciences
[oecd_tree_podobor_id] => 10201
[oecd_tree_podobor_nazev] => Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
[poznamka_metriky] =>
[nazev_en] => The RRT algorithms and a spatial index
[popis_en] => The Rapidly-exploring Random Trees algorithm (RRT), based on incremental sampling, is a popular and powerful tool for motion planning problems. Although the RRT algorithm returns the solution relatively quickly, the computational cost of every new algorithm loop increases as the tree grows because of the nearest neighbor searching procedure. This paper solves this problem and improves the RRT performance using a spatial index. Through a series of simulation experiments we evaluate and compare the performance of RRT-based algorithms with and without a spatial index. We report on the results verifying the efficiency of the use of a spatial index
[klicova_slova_en] => Motion planning, Rapidly-exploring random trees algorithm, spatial index
[vysledek_datum] => 2014-06-25T00:00:00+02:00
)
[5] => Array
(
[vysledek_id] => 108994
[vysledek_druh_id] => ART
[ex_vysledek_id] => 110134
[vysledek_rok] => 2014
[nazev] => APPLICATION OF COMPUTER SIMULATION TO INCREASE THE PRODUCTION RATE OF PICKLING LINE
[nazev_orig] => APPLICATION OF COMPUTER SIMULATION TO INCREASE THE PRODUCTION RATE OF PICKLING LINE
[duvernost_udaju_id] => S
[popis] => This article describes the practical application of computer simulation of the pickling line. . The field of modelling and simulation is as diverse as a group of people. Each discipline has developed or is developing its own models and their own approaches and tools for exploring these models.
[popis_orig] => This article describes the practical application of computer simulation of the pickling line. . The field of modelling and simulation is as diverse as a group of people. Each discipline has developed or is developing its own models and their own approaches and tools for exploring these models.
[klicova_slova] => production system, simulation, optimization, simulation analysis, pickling line, production rate
[klicova_slova_orig] => production system, simulation, optimization, simulation analysis, pickling line, production rate
[url] =>
[oecd_obor_id] =>
[odpovedny_utvar_id] => 183
[odpovedny_utvar_nazev] => Ústav výrobních strojů, systémů a robotiky
[odpovedny_utvar_zkratka] => ÚVSSR
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => SIMEONOVOVÁ, I.; KNOFLÍČEK, R.
[pocet_tvurcu] => 2
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Článek recenzovaný mimo WoS a Scopus
[druh_popis] => Ostatní články v odborných recenzovaných periodicích splňující definici druhu výsledku
[stav] => Schválený
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISSN 1805-0646
[identifikator_popis] => ISSN - MM Science Journal (CZ)
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => SIMEONOVOVÁ, I.; KNOFLÍČEK, R. APPLICATION OF COMPUTER SIMULATION TO INCREASE THE PRODUCTION RATE OF PICKLING LINE. MM Science Journal, 2014, vol. 20124, no. 3, p. 1-3. ISSN: 1805-0646.
[citace_html] => SIMEONOVOVÁ, I.; KNOFLÍČEK, R. APPLICATION OF COMPUTER SIMULATION TO INCREASE THE PRODUCTION RATE OF PICKLING LINE. MM Science Journal, 2014, vol. 20124, no. 3, p. 1-3. ISSN: 1805-0646.
[citace_rtf] =>
[citace_bibtex] => @article{BUT108994,
author="Ivana {Hromková} and Radek {Knoflíček}",
title="APPLICATION OF COMPUTER SIMULATION TO INCREASE THE PRODUCTION RATE OF PICKLING LINE",
journal="MM Science Journal",
year="2014",
volume="20124",
number="3",
pages="1--3",
issn="1805-0646"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] =>
[oecd_tree_oblast_nazev] =>
[oecd_tree_obor_id] =>
[oecd_tree_obor_nazev] =>
[oecd_tree_podobor_id] =>
[oecd_tree_podobor_nazev] =>
[poznamka_metriky] =>
[nazev_en] => APPLICATION OF COMPUTER SIMULATION TO INCREASE THE PRODUCTION RATE OF PICKLING LINE
[popis_en] => This article describes the practical application of computer simulation of the pickling line. . The field of modelling and simulation is as diverse as a group of people. Each discipline has developed or is developing its own models and their own approaches and tools for exploring these models.
[klicova_slova_en] => production system, simulation, optimization, simulation analysis, pickling line, production rate
[vysledek_datum] => 2014-03-03T00:00:00+01:00
)
[6] => Array
(
[vysledek_id] => 109015
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 110149
[vysledek_rok] => 2013
[nazev] => Motion planning in challenging environments using rapidly-exploring random trees
[nazev_orig] => Motion planning in challenging environments using rapidly-exploring random trees
[duvernost_udaju_id] => S
[popis] => This paper presents an efficient approach to trajectory planning for a holonomic mobile robot moving in static challenging environments including, for example, cluttered environments and spaces with narrow passages. It is an extension of the connect version of Rapidly-exploring random trees (RRT-connect) algorithm. The main idea presented here is to store randomly sampled configuration states which can not be reached because of collision, and then set them as roots to grow other random trees. It presumes growing of many trees in different hard to reach regions of environment to find bridges between them. Both simulation and experimental results demonsrate that it reduces the complexity of the original problem and thus resulting in fast space covering and increase the probability of finding the goal state
[popis_orig] => This paper presents an efficient approach to trajectory planning for a holonomic mobile robot moving in static challenging environments including, for example, cluttered environments and spaces with narrow passages. It is an extension of the connect version of Rapidly-exploring random trees (RRT-connect) algorithm. The main idea presented here is to store randomly sampled configuration states which can not be reached because of collision, and then set them as roots to grow other random trees. It presumes growing of many trees in different hard to reach regions of environment to find bridges between them. Both simulation and experimental results demonsrate that it reduces the complexity of the original problem and thus resulting in fast space covering and increase the probability of finding the goal state
[klicova_slova] => Rapidly-exploring random trees (RRTs) algorithm, multi-trees, motion planning, holonomic mobile robot
[klicova_slova_orig] => Rapidly-exploring random trees (RRTs) algorithm, multi-trees, motion planning, holonomic mobile robot
[url] =>
[oecd_obor_id] => 10201
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => GULINA, I.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 978-80-214-4755-4 ISSN 1803-3814
[identifikator_popis] => ISBN - 19th International Conference on Soft Computing, MENDEL 2013 ISSN - Mendel Journal series (CZ)
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => GULINA, I. Motion planning in challenging environments using rapidly-exploring random trees. In 19th International Conference on Soft Computing, MENDEL 2013. Mendel Journal series. 2013. 2013. no. 1, p. 153-160. ISBN: 978-80-214-4755-4. ISSN: 1803-3814.
[citace_html] => GULINA, I. Motion planning in challenging environments using rapidly-exploring random trees. In 19th International Conference on Soft Computing, MENDEL 2013. Mendel Journal series. 2013. 2013. no. 1, p. 153-160. ISBN: 978-80-214-4755-4. ISSN: 1803-3814.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT109015,
author="Irina {Gulina}",
title="Motion planning in challenging environments using rapidly-exploring random trees",
booktitle="19th International Conference on Soft Computing, MENDEL 2013",
year="2013",
series="2013",
journal="Mendel Journal series",
volume="2013",
number="1",
pages="153--160",
isbn="978-80-214-4755-4",
issn="1803-3814"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10200
[oecd_tree_obor_nazev] => 1.2 Computer and information sciences
[oecd_tree_podobor_id] => 10201
[oecd_tree_podobor_nazev] => Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
[poznamka_metriky] =>
[nazev_en] => Motion planning in challenging environments using rapidly-exploring random trees
[popis_en] => This paper presents an efficient approach to trajectory planning for a holonomic mobile robot moving in static challenging environments including, for example, cluttered environments and spaces with narrow passages. It is an extension of the connect version of Rapidly-exploring random trees (RRT-connect) algorithm. The main idea presented here is to store randomly sampled configuration states which can not be reached because of collision, and then set them as roots to grow other random trees. It presumes growing of many trees in different hard to reach regions of environment to find bridges between them. Both simulation and experimental results demonsrate that it reduces the complexity of the original problem and thus resulting in fast space covering and increase the probability of finding the goal state
[klicova_slova_en] => Rapidly-exploring random trees (RRTs) algorithm, multi-trees, motion planning, holonomic mobile robot
[vysledek_datum] => 2013-06-26T00:00:00+02:00
)
[7] => Array
(
[vysledek_id] => 109309
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 110368
[vysledek_rok] => 2014
[nazev] => Mathematical Method for Multicriterial Project Selection
[nazev_orig] => Mathematical Method for Multicriterial Project Selection
[duvernost_udaju_id] => S
[popis] => In this paper basic idea of method enabling a multicriterial selection of projects is given. The requirement for such a selection occurs, for example, when creating project portfolio of companies or ministerial departments. Main attention is dedicated to cases with a great number
of projects and criterions. Here, it is also respected a hierarchical contingency relationship among candidate projects and synergistic effects in criterion functions and in resource requirements, as well as the possibility of the dialogue in the creation of weights of criterion functions.
[popis_orig] => In this paper basic idea of method enabling a multicriterial selection of projects is given. The requirement for such a selection occurs, for example, when creating project portfolio of companies or ministerial departments. Main attention is dedicated to cases with a great number
of projects and criterions. Here, it is also respected a hierarchical contingency relationship among candidate projects and synergistic effects in criterion functions and in resource requirements, as well as the possibility of the dialogue in the creation of weights of criterion functions.
[klicova_slova] => project selection, decision support, multi-criterial optimization, mathematical programming
[klicova_slova_orig] => project selection, decision support, multi-criterial optimization, mathematical programming
[url] => http://www.fhi.sk/en/katedry-fakulty/kove/ssov/papers/
[oecd_obor_id] => 10103
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 17484
[schvaleno] => 2015-09-18
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEVČÍK, V.; KLAPKA, J.
[pocet_tvurcu] => 2
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 978-80-225-3868-8
[identifikator_popis] => ISBN - Proceedings of the International Scientific Conference Quantitative Methods in Economics (Multiple Criteria Decision Making XVII)
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEVČÍK, V.; KLAPKA, J. Mathematical Method for Multicriterial Project Selection. In Proceedings of the International Scientific Conference Quantitative Methods in Economics (Multiple Criteria Decision Making XVII). Bratislava: EKONÓM, 2014. p. 269-275. ISBN: 978-80-225-3868-8.
[citace_html] => ŠEVČÍK, V.; KLAPKA, J. Mathematical Method for Multicriterial Project Selection. In Proceedings of the International Scientific Conference Quantitative Methods in Economics (Multiple Criteria Decision Making XVII). Bratislava: EKONÓM, 2014. p. 269-275. ISBN: 978-80-225-3868-8.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT109309,
author="Vítězslav {Popovský} and Jindřich {Klapka}",
title="Mathematical Method for Multicriterial Project Selection",
booktitle="Proceedings of the International Scientific Conference Quantitative Methods in Economics (Multiple Criteria Decision Making XVII)",
year="2014",
number="1",
pages="269--275",
publisher="EKONÓM",
address="Bratislava",
isbn="978-80-225-3868-8",
url="http://www.fhi.sk/en/katedry-fakulty/kove/ssov/papers/"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10100
[oecd_tree_obor_nazev] => 1.1 Mathematics
[oecd_tree_podobor_id] => 10103
[oecd_tree_podobor_nazev] => Statistics and probability
[poznamka_metriky] =>
[nazev_en] => Mathematical Method for Multicriterial Project Selection
[popis_en] => In this paper basic idea of method enabling a multicriterial selection of projects is given. The requirement for such a selection occurs, for example, when creating project portfolio of companies or ministerial departments. Main attention is dedicated to cases with a great number
of projects and criterions. Here, it is also respected a hierarchical contingency relationship among candidate projects and synergistic effects in criterion functions and in resource requirements, as well as the possibility of the dialogue in the creation of weights of criterion functions.
[klicova_slova_en] => project selection, decision support, multi-criterial optimization, mathematical programming
[vysledek_datum] => 2014-01-01T00:00:00+01:00
)
[8] => Array
(
[vysledek_id] => 109667
[vysledek_druh_id] => ARTWOS
[ex_vysledek_id] => 110617
[vysledek_rok] => 2014
[nazev] => Rapid Matrix-Assisted Laser Desorption/Ionization Time-of-Flight Mass Spectrometry Imaging with Scanning Desorption Laser Beam
[nazev_orig] => Rapid Matrix-Assisted Laser Desorption/Ionization Time-of-Flight Mass Spectrometry Imaging with Scanning Desorption Laser Beam
[duvernost_udaju_id] => S
[popis] => Matrix-assisted laser desorption/ionization time-of-flight mass spectrometry (MALDI TOF MS) imaging of surfaces and tissues is a rapidly evolving technique having great potential in the field of biosciences. In earlier times, acquisition of a single high-resolution MS image could take days. Despite the recent introduction of high-repetition rate lasers to increase sample throughput of axial TOF MS instruments, obtaining a high-resolution image still requires a few hours. This paper shows that a substantial increase in the throughput of the TOF MS-based tissue imaging can be achieved by incorporating a mirror providing high-speed precision scanning of the laser beam along the sample surface. Equipped with the scanning mirror, a laboratory-built axial MALDI TOF MS instrument utilizing a 4-kHz UV laser recorded a 100 x 100 pixel MS image in -11 min using 100 laser shots per pixel. This is almost an order of magnitude faster when compared to a modern commercial instrument equipped with 1-kHz laser.
[popis_orig] => Matrix-assisted laser desorption/ionization time-of-flight mass spectrometry (MALDI TOF MS) imaging of surfaces and tissues is a rapidly evolving technique having great potential in the field of biosciences. In earlier times, acquisition of a single high-resolution MS image could take days. Despite the recent introduction of high-repetition rate lasers to increase sample throughput of axial TOF MS instruments, obtaining a high-resolution image still requires a few hours. This paper shows that a substantial increase in the throughput of the TOF MS-based tissue imaging can be achieved by incorporating a mirror providing high-speed precision scanning of the laser beam along the sample surface. Equipped with the scanning mirror, a laboratory-built axial MALDI TOF MS instrument utilizing a 4-kHz UV laser recorded a 100 x 100 pixel MS image in -11 min using 100 laser shots per pixel. This is almost an order of magnitude faster when compared to a modern commercial instrument equipped with 1-kHz laser.
[klicova_slova] => mass spectrometry imaging; laser beam scanning; MALDI; TOF; high-throughput
[klicova_slova_orig] => mass spectrometry imaging; laser beam scanning; MALDI; TOF; high-throughput
[url] =>
[oecd_obor_id] => 10406
[odpovedny_utvar_id] => 20935
[odpovedny_utvar_nazev] => NCK energetika - sekce procesního inženýrství
[odpovedny_utvar_zkratka] => NCK en - SPI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2019-08-07
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => BEDNAŘÍK, A.; KUBA, P.; MOSKOVETS, E.; TOMALOVÁ, I.; KRÁSENSKÝ, P.; HOUŠKA, P.; PREISLER, J.
[pocet_tvurcu] => 7
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.1021/ac402823n
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Článek WoS
[druh_popis] => Článek v odborném periodiku je obsažen v databázi Web of Science společností Thomson Reuters s příznakem „Article“, „Review“ nebo „Letter“
[stav] => Schválený
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISSN 0003-2700
[identifikator_popis] => ISSN - ANALYTICAL CHEMISTRY (US)
[riv_dodavka_id] => 2117
[riv_dodavka_oznaceni] => RIV15-MSM-26210___
[riv_dodavka_rok] => 2015
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => BEDNAŘÍK, A.; KUBA, P.; MOSKOVETS, E.; TOMALOVÁ, I.; KRÁSENSKÝ, P.; HOUŠKA, P.; PREISLER, J. Rapid Matrix-Assisted Laser Desorption/Ionization Time-of-Flight Mass Spectrometry Imaging with Scanning Desorption Laser Beam. ANALYTICAL CHEMISTRY, 2014, vol. 86, no. 2, p. 982-986. ISSN: 0003-2700.
[citace_html] => BEDNAŘÍK, A.; KUBA, P.; MOSKOVETS, E.; TOMALOVÁ, I.; KRÁSENSKÝ, P.; HOUŠKA, P.; PREISLER, J. Rapid Matrix-Assisted Laser Desorption/Ionization Time-of-Flight Mass Spectrometry Imaging with Scanning Desorption Laser Beam. ANALYTICAL CHEMISTRY, 2014, vol. 86, no. 2, p. 982-986. ISSN: 0003-2700.
[citace_rtf] =>
[citace_bibtex] => @article{BUT109667,
author="Antonín {Bednařík} and Jan {Preisler} and Iva {Tomalová} and Eugene {MOSKOVETS} and Pavel {Krásenský} and Pavel {Houška} and Pavel {Kuba}",
title="Rapid Matrix-Assisted Laser Desorption/Ionization Time-of-Flight Mass Spectrometry Imaging with Scanning Desorption Laser Beam",
journal="ANALYTICAL CHEMISTRY",
year="2014",
volume="86",
number="2",
pages="982--986",
doi="10.1021/ac402823n",
issn="0003-2700"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10400
[oecd_tree_obor_nazev] => 1.4 Chemical sciences
[oecd_tree_podobor_id] => 10406
[oecd_tree_podobor_nazev] => Analytical chemistry
[poznamka_metriky] =>
[nazev_en] => Rapid Matrix-Assisted Laser Desorption/Ionization Time-of-Flight Mass Spectrometry Imaging with Scanning Desorption Laser Beam
[popis_en] => Matrix-assisted laser desorption/ionization time-of-flight mass spectrometry (MALDI TOF MS) imaging of surfaces and tissues is a rapidly evolving technique having great potential in the field of biosciences. In earlier times, acquisition of a single high-resolution MS image could take days. Despite the recent introduction of high-repetition rate lasers to increase sample throughput of axial TOF MS instruments, obtaining a high-resolution image still requires a few hours. This paper shows that a substantial increase in the throughput of the TOF MS-based tissue imaging can be achieved by incorporating a mirror providing high-speed precision scanning of the laser beam along the sample surface. Equipped with the scanning mirror, a laboratory-built axial MALDI TOF MS instrument utilizing a 4-kHz UV laser recorded a 100 x 100 pixel MS image in -11 min using 100 laser shots per pixel. This is almost an order of magnitude faster when compared to a modern commercial instrument equipped with 1-kHz laser.
[klicova_slova_en] => mass spectrometry imaging; laser beam scanning; MALDI; TOF; high-throughput
[vysledek_datum] => 2014-01-21T00:00:00+01:00
)
[9] => Array
(
[vysledek_id] => 109673
[vysledek_druh_id] => ABSTR
[ex_vysledek_id] => 110657
[vysledek_rok] => 2014
[nazev] => Hybrid Algorithm for Here-and-Now Stochastic Network Design Problem with Pricing
[nazev_orig] => Hybrid Algorithm for Here-and-Now Stochastic Network Design Problem with Pricing
[duvernost_udaju_id] => S
[popis] => The purpose of the paper is to discuss an advanced hybrid algorithm for the solution of a hereand-now scenario-based expected objective reformulation of an underlying stochastic program dealing with transportation problem involving random demand parameters and 0-1 network design variables. At the beginning, the deterministic transportation model with network design variables is reviewed. Then, uncertain demand parameters are introduced and modeled by random variables. The following deterministic reformulation is based on the here-and-now (HN) approach. The model is enhanced with implemetation of pricing. A finite discrete probability distribution is assumed for a random vector involving all stochastic parameters. Then, the obtained nonlinear binary program can be solved by GAMS solvers. However, the large problems represent true challenge, so the authors combine a classical optimization algorithm and a suitable genetic algorithm to obtain a hybrid algorithm that is modified for the HN case. The implementation and test results illustrated by figures are included.
[popis_orig] => The purpose of the paper is to discuss an advanced hybrid algorithm for the solution of a hereand-now scenario-based expected objective reformulation of an underlying stochastic program dealing with transportation problem involving random demand parameters and 0-1 network design variables. At the beginning, the deterministic transportation model with network design variables is reviewed. Then, uncertain demand parameters are introduced and modeled by random variables. The following deterministic reformulation is based on the here-and-now (HN) approach. The model is enhanced with implemetation of pricing. A finite discrete probability distribution is assumed for a random vector involving all stochastic parameters. Then, the obtained nonlinear binary program can be solved by GAMS solvers. However, the large problems represent true challenge, so the authors combine a classical optimization algorithm and a suitable genetic algorithm to obtain a hybrid algorithm that is modified for the HN case. The implementation and test results illustrated by figures are included.
[klicova_slova] => Hybrid algorithm, stochastic network design, pricing
[klicova_slova_orig] => Hybrid algorithm, stochastic network design, pricing
[url] =>
[oecd_obor_id] => 10103
[odpovedny_utvar_id] => 148
[odpovedny_utvar_nazev] => Ústav matematiky
[odpovedny_utvar_zkratka] => ÚM
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => HRABEC, D.; POPELA, P.; ROUPEC, J.; HAUGEN, K.
[pocet_tvurcu] => 4
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Abstrakt
[druh_popis] => Abstrakt
[stav] => Schválený
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] =>
[identifikator_popis] =>
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => HRABEC, D.; POPELA, P.; ROUPEC, J.; HAUGEN, K. Hybrid Algorithm for Here-and-Now Stochastic Network Design Problem with Pricing. 2014.
[citace_html] => HRABEC, D.; POPELA, P.; ROUPEC, J.; HAUGEN, K. Hybrid Algorithm for Here-and-Now Stochastic Network Design Problem with Pricing. 2014.
[citace_rtf] =>
[citace_bibtex] => @misc{BUT109673,
author="Dušan {Hrabec} and Pavel {Popela} and Jan {Roupec} and Kjetil Kare {Haugen}",
title="Hybrid Algorithm for Here-and-Now Stochastic Network Design Problem with Pricing",
year="2014",
note="Abstract"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10100
[oecd_tree_obor_nazev] => 1.1 Mathematics
[oecd_tree_podobor_id] => 10103
[oecd_tree_podobor_nazev] => Statistics and probability
[poznamka_metriky] =>
[nazev_en] => Hybrid Algorithm for Here-and-Now Stochastic Network Design Problem with Pricing
[popis_en] => The purpose of the paper is to discuss an advanced hybrid algorithm for the solution of a hereand-now scenario-based expected objective reformulation of an underlying stochastic program dealing with transportation problem involving random demand parameters and 0-1 network design variables. At the beginning, the deterministic transportation model with network design variables is reviewed. Then, uncertain demand parameters are introduced and modeled by random variables. The following deterministic reformulation is based on the here-and-now (HN) approach. The model is enhanced with implemetation of pricing. A finite discrete probability distribution is assumed for a random vector involving all stochastic parameters. Then, the obtained nonlinear binary program can be solved by GAMS solvers. However, the large problems represent true challenge, so the authors combine a classical optimization algorithm and a suitable genetic algorithm to obtain a hybrid algorithm that is modified for the HN case. The implementation and test results illustrated by figures are included.
[klicova_slova_en] => Hybrid algorithm, stochastic network design, pricing
[vysledek_datum] => 2014-09-01T00:00:00+02:00
)
[10] => Array
(
[vysledek_id] => 109774
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 110691
[vysledek_rok] => 2012
[nazev] => Production rate optimization by using simulation approach for designing of acid pickling lines
[nazev_orig] => Production rate optimization by using simulation approach for designing of acid pickling lines
[duvernost_udaju_id] => S
[popis] => This paper is focused on developing of simulation model of acid pickling line. This type of production system contains discrete events so it leads to discrete simulation model. The pickling line issue is characterized by complicated mechanism of controlli ng, because for example the exposition times in acid has to be meet. The paper discussed using simulation approach for designing of acid pickling lines. The various experiments with simulation model was performed. In this paper are described 2 experiments dealing with different approach for loading and unloading of coils witch are pickled. Later in this article are evaluated and compared simulation results of alternatives with regard to production rate of production system, transport units utilization during shifts, optimal count of hooks and so on.
[popis_orig] => This paper is focused on developing of simulation model of acid pickling line. This type of production system contains discrete events so it leads to discrete simulation model. The pickling line issue is characterized by complicated mechanism of controlli ng, because for example the exposition times in acid has to be meet. The paper discussed using simulation approach for designing of acid pickling lines. The various experiments with simulation model was performed. In this paper are described 2 experiments dealing with different approach for loading and unloading of coils witch are pickled. Later in this article are evaluated and compared simulation results of alternatives with regard to production rate of production system, transport units utilization during shifts, optimal count of hooks and so on.
[klicova_slova] => Discrete simulation, acid pickling lines, production rate, loading, unloading
[klicova_slova_orig] => Discrete simulation, acid pickling lines, production rate, loading, unloading
[url] =>
[oecd_obor_id] =>
[odpovedny_utvar_id] => 183
[odpovedny_utvar_nazev] => Ústav výrobních strojů, systémů a robotiky
[odpovedny_utvar_zkratka] => ÚVSSR
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2016-05-24
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => SIMEONOVOVÁ, I.; SIMEONOV, S.
[pocet_tvurcu] => 2
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISSN 1310-3946
[identifikator_popis] => ISSN - Sbornik dokladi ot dvadeset i treta meždunarodna naučno-techničeska konferencia (BG)
[riv_dodavka_id] => 1318
[riv_dodavka_oznaceni] => RIV16-MSM-26210___
[riv_dodavka_rok] => 2016
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => SIMEONOVOVÁ, I.; SIMEONOV, S. Production rate optimization by using simulation approach for designing of acid pickling lines. In Sbornik dokladi ot dvadeset i treta meždunarodna naučno-techničeska konferencia. Sbornik dokladi ot dvadeset i treta meždunarodna naučno-techničeska konferencia. Varna: The Scientific Technical union of mechanical engineering, 2012. no. 5/134, p. 1-5. ISSN: 1310-3946.
[citace_html] => SIMEONOVOVÁ, I.; SIMEONOV, S. Production rate optimization by using simulation approach for designing of acid pickling lines. In Sbornik dokladi ot dvadeset i treta meždunarodna naučno-techničeska konferencia. Sbornik dokladi ot dvadeset i treta meždunarodna naučno-techničeska konferencia. Varna: The Scientific Technical union of mechanical engineering, 2012. no. 5/134, p. 1-5. ISSN: 1310-3946.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT109774,
author="Ivana {Hromková} and Simeon {Simeonov}",
title="Production rate optimization by using simulation approach for designing of acid pickling lines",
booktitle="Sbornik dokladi ot dvadeset i treta meždunarodna naučno-techničeska konferencia",
year="2012",
journal="Sbornik dokladi ot dvadeset i treta meždunarodna naučno-techničeska konferencia",
volume="20",
number="5/134",
pages="1--5",
publisher="The Scientific Technical union of mechanical engineering",
address="Varna",
issn="1310-3946"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] =>
[oecd_tree_oblast_nazev] =>
[oecd_tree_obor_id] =>
[oecd_tree_obor_nazev] =>
[oecd_tree_podobor_id] =>
[oecd_tree_podobor_nazev] =>
[poznamka_metriky] =>
[nazev_en] => Production rate optimization by using simulation approach for designing of acid pickling lines
[popis_en] => This paper is focused on developing of simulation model of acid pickling line. This type of production system contains discrete events so it leads to discrete simulation model. The pickling line issue is characterized by complicated mechanism of controlli ng, because for example the exposition times in acid has to be meet. The paper discussed using simulation approach for designing of acid pickling lines. The various experiments with simulation model was performed. In this paper are described 2 experiments dealing with different approach for loading and unloading of coils witch are pickled. Later in this article are evaluated and compared simulation results of alternatives with regard to production rate of production system, transport units utilization during shifts, optimal count of hooks and so on.
[klicova_slova_en] => Discrete simulation, acid pickling lines, production rate, loading, unloading
[vysledek_datum] => 2012-09-19T00:00:00+02:00
)
)
)
Array
(
[total] => 2086
[page] => 114
[count] => 11
[n_pages] => 140
[pagelen] => 15
[odkaz] => typVysledku=&rok=&ftext=&btnSubmit=1
[base_detail] => /veda/publikace/detail/
[base_page] => /veda/publikace
[vysledek] => Array
(
[0] => Array
(
[quotations] => ŠEDA, M.; ROUPEC, J.; ŠEDOVÁ, J.
[title] => Distribution Problems, Their Modifications and Applications
[typ] => PV
[year] => 2001
[id_vav] => 108681
)
[1] => Array
(
[quotations] => ŠEDA, M.; ROUPEC, J.; ŠEDOVÁ, J.
[title] => Transportation Problem and Related Tasks with Application in Agriculture
[typ] => PV
[year] => 2014
[id_vav] => 108682
)
[2] => Array
(
[quotations] => ABBADI, A.; MATOUŠEK, R.; OŠMERA, P.; KNISPEL, L.
[title] => SPATIAL GUIDANCE TO RRT PLANNER USING CELL-DECOMPOSITION ALGORITHM
[typ] => PV
[year] => 2014
[id_vav] => 108717
)
[3] => Array
(
[quotations] => SIMEONOVOVÁ, I.; KNOFLÍČEK, R.
[title] => BATCH SIZE OPTIMIZATION USING COMPUTER SIMULATION FOR THE PURPOSE OF STREAMLINE THE PRODUCTION AND SUSTAINING MARKET POSITION
[typ] => PV
[year] => 2014
[id_vav] => 108986
)
[4] => Array
(
[quotations] => GULINA, I.; MATOUŠEK, R.
[title] => The RRT algorithms and a spatial index
[typ] => PV
[year] => 2014
[id_vav] => 108987
)
[5] => Array
(
[quotations] => SIMEONOVOVÁ, I.; KNOFLÍČEK, R.
[title] => APPLICATION OF COMPUTER SIMULATION TO INCREASE THE PRODUCTION RATE OF PICKLING LINE
[typ] => PV
[year] => 2014
[id_vav] => 108994
)
[6] => Array
(
[quotations] => GULINA, I.
[title] => Motion planning in challenging environments using rapidly-exploring random trees
[typ] => PV
[year] => 2013
[id_vav] => 109015
)
[7] => Array
(
[quotations] => ŠEVČÍK, V.; KLAPKA, J.
[title] => Mathematical Method for Multicriterial Project Selection
[typ] => PV
[year] => 2014
[id_vav] => 109309
)
[8] => Array
(
[quotations] => BEDNAŘÍK, A.; KUBA, P.; MOSKOVETS, E.; TOMALOVÁ, I.; KRÁSENSKÝ, P.; HOUŠKA, P.; PREISLER, J.
[title] => Rapid Matrix-Assisted Laser Desorption/Ionization Time-of-Flight Mass Spectrometry Imaging with Scanning Desorption Laser Beam
[typ] => PV
[year] => 2014
[id_vav] => 109667
)
[9] => Array
(
[quotations] => HRABEC, D.; POPELA, P.; ROUPEC, J.; HAUGEN, K.
[title] => Hybrid Algorithm for Here-and-Now Stochastic Network Design Problem with Pricing
[typ] => PV
[year] => 2014
[id_vav] => 109673
)
[10] => Array
(
[quotations] => SIMEONOVOVÁ, I.; SIMEONOV, S.
[title] => Production rate optimization by using simulation approach for designing of acid pickling lines
[typ] => PV
[year] => 2012
[id_vav] => 109774
)
)
)