TBU Publications
Repository of TBU Publications

Increasing the efficiency of logistics in warehouse using the combination of simple optimization methods

DSpace Repository

Show simple item record


dc.title Increasing the efficiency of logistics in warehouse using the combination of simple optimization methods en
dc.contributor.author Jemelka, Milan
dc.contributor.author Chramcov, Bronislav
dc.contributor.author Kříž, Pavel
dc.relation.ispartof Advances in Intelligent Systems and Computing
dc.identifier.issn 2194-5357 Scopus Sources, Sherpa/RoMEO, JCR
dc.identifier.isbn 978-3-319-67617-3
dc.date.issued 2018
utb.relation.volume 661
dc.citation.spage 225
dc.citation.epage 235
dc.event.title International Conference on Computational Methods in Systems and Software, CoMeSySo 2017
dc.event.sdate 2017-09-12
dc.event.edate 2017-09-14
dc.type conferenceObject
dc.language.iso en
dc.publisher Springer Verlag
dc.identifier.doi 10.1007/978-3-319-67618-0_21
dc.relation.uri https://link.springer.com/chapter/10.1007/978-3-319-67618-0_21
dc.subject ABC classification en
dc.subject all combinations algorithm en
dc.subject inventory en
dc.subject logistics en
dc.subject optimization en
dc.subject random solutions algorithm en
dc.subject simulation en
dc.subject warehouse en
dc.description.abstract The paper focuses on increasing the efficiency of logistics process in warehouse. Today’s trend is to use simulation tools. To obtain effective solutions exist various optimization methods, optimization algorithms and heuristics. The presented experiment uses the combination of two simple optimization methods for searching the effective solution in reasonable time. The Random solutions algorithm and the All combinations algorithm are used together. Random solutions algorithm generates random combinations and can help indicate how solutions will vary, by giving a picture of the shape of the entire solution space for a scenario. All combinations algorithm is a method, which runs all constrained combinations. If sufficient time is available, this method guarantees that the optimal result will be found. An estimate of the time to be taken can be obtained in advance. This concrete two algorithms demonstration is a high quality and fast way to achieve effective (optimal) results in a short time. The Witness simulation environment is used for the experiments. © 2018, Springer International Publishing AG. en
utb.faculty Faculty of Applied Informatics
dc.identifier.uri http://hdl.handle.net/10563/1007510
utb.identifier.obdid 43877395
utb.identifier.scopus 2-s2.0-85029604510
utb.identifier.wok 000430738700021
utb.source d-scopus
dc.date.accessioned 2017-10-16T14:43:40Z
dc.date.available 2017-10-16T14:43:40Z
dc.description.sponsorship ERDF, European Regional Development Fund
dc.description.sponsorship Ministry of Education, Youth and Sports of the Czech Republic within the National Sustainability Programme [LO1303 (MSMT-7778/2014)]; European Regional Development Fund [CZ.1.05/2.1.00/03.0089]; Internal Grant Agency of Tomas Bata University [IGA/FAI/2017/003]
utb.contributor.internalauthor Jemelka, Milan
utb.contributor.internalauthor Chramcov, Bronislav
utb.contributor.internalauthor Kříž, Pavel
utb.fulltext.affiliation Milan Jemelka, Bronislav Chramcov, Pavel Kříž Faculty of Applied Informatics, Tomas Bata University in Zlín, Nad Stráněmi 4511, 760 05 Zlín, Czech Republic {jemelka,chramcov,kriz}@fai.utb.cz
utb.fulltext.dates -
utb.scopus.affiliation Faculty of Applied Informatics, Tomas Bata University in Zlín, Nad Stráněmi 4511, Zlín, Czech Republic
utb.fulltext.faculty Faculty of Applied Informatics
utb.fulltext.faculty Faculty of Applied Informatics
utb.fulltext.faculty Faculty of Applied Informatics
Find Full text

Files in this item

Show simple item record