<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>04616ntm a22005657i 4500</leader>
  <controlfield tag="001">000698955</controlfield>
  <controlfield tag="003">CZ-PrVSE</controlfield>
  <controlfield tag="005">20230610093205.0</controlfield>
  <controlfield tag="006">m        d</controlfield>
  <controlfield tag="007">cr n||||||||||</controlfield>
  <controlfield tag="008">230610s2023    xr     fsbm   000 0 eng d</controlfield>
  <datafield tag="STA" ind1=" " ind2=" ">
   <subfield code="a">NEZPRACOVANÝ IMPORT</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
   <subfield code="a">ABA006</subfield>
   <subfield code="b">cze</subfield>
   <subfield code="c">ABA006</subfield>
   <subfield code="d">ABA006</subfield>
   <subfield code="e">rda</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Pappová, Alexandra</subfield>
   <subfield code="%">ISIS:157700</subfield>
   <subfield code="4">dis</subfield>
  </datafield>
  <datafield tag="242" ind1="1" ind2="0">
   <subfield code="a">Optimalizace svozových tras pro společnost BRANTNER Slovakia s.r.o.</subfield>
   <subfield code="y">eng</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Optimization and optimal distribution network proposal of waste pick-up routes in BRANTNER GmbH. /</subfield>
   <subfield code="c">Alexandra Pappová</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="0">
   <subfield code="c">2023</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
   <subfield code="a">?? stran :</subfield>
   <subfield code="3">digital, PDF soubor</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
   <subfield code="a">Vedoucí práce: Jaroslav Halík</subfield>
  </datafield>
  <datafield tag="502" ind1=" " ind2=" ">
   <subfield code="a">Bakalářská práce (Bc.)—Vysoká škola ekonomická v Praze. Fakulta mezinárodních vztahů, 2023</subfield>
  </datafield>
  <datafield tag="504" ind1=" " ind2=" ">
   <subfield code="a">Obsahuje bibliografii</subfield>
  </datafield>
  <datafield tag="516" ind1=" " ind2=" ">
   <subfield code="a">Textový (vysokoškolská kvalifikační práce)</subfield>
  </datafield>
  <datafield tag="518" ind1=" " ind2=" ">
   <subfield code="a">Rok obhajoby 2023</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">This thesis addresses the pressing issue of waste collection route optimization for a subsidiary of the Austrian company Brantner, which offers a broadening portfolio of sustainable waste management solutions across Slovakia. Together with Brantner’s growing innovations and expanding operational areas, the complexity follows, necessitating optimization. Thus, the primary objective of this thesis is to identify key operational inefficiencies in the waste collection pickup-routes of Brantner and in turn optimize the majority of these inefficiencies on a subset of the routes. Initially, the thesis introduces the concepts of mathematical optimization and the optimization problem, while delving deeper into specific types of optimization problem methods and algorithms, such as the Heuristics and Metaheuristics methods, or the Ruin and Recreate algorithm. Within the practical part of this thesis, Brantner’s waste collection routes are identified to be a CHVRPTW-LR optimization problem type, which is a specific variant derived from the original VRP. Moreover, a detailed analysis was performed, using a prominent analytical and visualization tool, that uncovered key insights into Brantner’s waste collection operations. A part of this analysis was also dedicated to highlighting the crucial role that data quality holds in generating added value insights and feasible optimization solutions. With the provided analytics, the thesis was able to discover many data discrepancies, waste collection inefficiencies and bottlenecks that were then addressed by the optimization. For the optimization, the thesis used a specialized DW software that employs a meta-heuristic Ruin &amp; Recreate algorithm with the use of the Jsprit open-source tool. The optimization showed very promising results, while it also had its limitations which were caused by the optimization problem simplifications and poor data quality.</subfield>
  </datafield>
  <datafield tag="520" ind1="8" ind2=" ">
   <subfield code="a">Overall the approach applied in this thesis has demonstrated a great potential for the improvement of Brantner’s waste collection pickup-routes, as well as the optimization of similar routing problems. The findings, show that 65% of the waste collection transit time, 63% of the vehicle-related costs, and 64% of the total distance travelled have the potential to be reduced, generating a promissing saving potential. Thus, concluding that the hypothesis expectation of this thesis was met considerably well (almost three fold).</subfield>
  </datafield>
  <datafield tag="538" ind1=" " ind2=" ">
   <subfield code="a">Způsob přístupu: Internet</subfield>
  </datafield>
  <datafield tag="653" ind1="0" ind2=" ">
   <subfield code="a">international business [obor bakal. práce]</subfield>
  </datafield>
  <datafield tag="655" ind1=" " ind2="7">
   <subfield code="a">bakalářské práce</subfield>
   <subfield code="7">fd132403</subfield>
   <subfield code="2">czenas</subfield>
  </datafield>
  <datafield tag="655" ind1=" " ind2="9">
   <subfield code="a">bachelor's theses</subfield>
   <subfield code="2">eczenas</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2=" ">
   <subfield code="a">Ruin &amp; Recreate</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2=" ">
   <subfield code="a">Routing Optimization</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2=" ">
   <subfield code="a">Vehicle Routing Problem</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2=" ">
   <subfield code="a">Waste Collection</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2=" ">
   <subfield code="a">Pickup-Routes</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2=" ">
   <subfield code="a">Meta-heuristics</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2=" ">
   <subfield code="a">Jsprit</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2=" ">
   <subfield code="a">Combinatorial Optimization Problem</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Halík, Jaroslav,</subfield>
   <subfield code="d">1961-</subfield>
   <subfield code="7">xx0051501</subfield>
   <subfield code="4">ths</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Hladík, Tomáš</subfield>
   <subfield code="4">opn</subfield>
  </datafield>
  <datafield tag="710" ind1="2" ind2=" ">
   <subfield code="a">Vysoká škola ekonomická v Praze.</subfield>
   <subfield code="b">Fakulta mezinárodních vztahů</subfield>
   <subfield code="7">kn20010709400</subfield>
   <subfield code="4">dgg</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://insis.vse.cz/zp/81915/podrobnosti</subfield>
   <subfield code="y">VŠKP v InSIS</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://insis.vse.cz/zp/81915</subfield>
   <subfield code="y">Hlavní práce</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://insis.vse.cz/zp/81915/posudek/vedouci</subfield>
   <subfield code="y">Hodnocení vedoucího</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://insis.vse.cz/zp/81915/posudek/oponent/78043</subfield>
   <subfield code="y">Oponentura</subfield>
  </datafield>
  <datafield tag="999" ind1="4" ind2="0">
   <subfield code="u">https://insis.vse.cz/zp/81915/podrobnosti</subfield>
   <subfield code="y">dc:identifier</subfield>
  </datafield>
  <datafield tag="993" ind1=" " ind2=" ">
   <subfield code="x">NEPOSILAT</subfield>
   <subfield code="y">VSKP</subfield>
  </datafield>
  <datafield tag="999" ind1="4" ind2="9">
   <subfield code="a">vse81915</subfield>
   <subfield code="b">230609</subfield>
  </datafield>
  <datafield tag="999" ind1="4" ind2="5">
   <subfield code="x">81915</subfield>
  </datafield>
 </record>
</collection>
