prikaz prve stranice dokumenta Rješavanje problema premještanja kontejnera pomoću Reshuffle Index with Look-Ahead prioritetnog pravila
  Download
PDF 9.16 MB
undergraduate thesis
Rješavanje problema premještanja kontejnera pomoću Reshuffle Index with Look-Ahead prioritetnog pravila
2024. urn:nbn:hr:126:235952
Butumović, Iva
Josip Juraj Strossmayer University of Osijek
School of Applied Mathematics and Informatics

Cite this document

Butumović, I. (2024). Rješavanje problema premještanja kontejnera pomoću Reshuffle Index with Look-Ahead prioritetnog pravila (Undergraduate thesis). Osijek: Josip Juraj Strossmayer University of Osijek, School of Applied Mathematics and Informatics. Retrieved from https://urn.nsk.hr/urn:nbn:hr:126:235952

Butumović, Iva. "Rješavanje problema premještanja kontejnera pomoću Reshuffle Index with Look-Ahead prioritetnog pravila." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, School of Applied Mathematics and Informatics, 2024. https://urn.nsk.hr/urn:nbn:hr:126:235952

Butumović, Iva. "Rješavanje problema premještanja kontejnera pomoću Reshuffle Index with Look-Ahead prioritetnog pravila." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, School of Applied Mathematics and Informatics, 2024. https://urn.nsk.hr/urn:nbn:hr:126:235952

Butumović, I. (2024). 'Rješavanje problema premještanja kontejnera pomoću Reshuffle Index with Look-Ahead prioritetnog pravila', Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, School of Applied Mathematics and Informatics, accessed 11 November 2024, https://urn.nsk.hr/urn:nbn:hr:126:235952

Butumović I. Rješavanje problema premještanja kontejnera pomoću Reshuffle Index with Look-Ahead prioritetnog pravila [Undergraduate thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, School of Applied Mathematics and Informatics; 2024 [cited 2024 November 11] Available at: https://urn.nsk.hr/urn:nbn:hr:126:235952

I. Butumović, "Rješavanje problema premještanja kontejnera pomoću Reshuffle Index with Look-Ahead prioritetnog pravila", Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, School of Applied Mathematics and Informatics, Osijek, 2024. Available at: https://urn.nsk.hr/urn:nbn:hr:126:235952

Please login to the repository to save this object to your list.
Metadata
TitleRješavanje problema premještanja kontejnera pomoću Reshuffle Index with Look-Ahead prioritetnog pravila
Title (english)Solving the Container Relocation Problem Using the Reshuffle Index with Look-Ahead Priority Rule
AuthorIva Butumović
MentorMateja Đumić (mentor)
GranterJosip Juraj Strossmayer University of Osijek
School of Applied Mathematics and Informatics
Osijek
Defense date and country2024-09-30, Croatia
Scientific / art field,
discipline and subdiscipline		NATURAL SCIENCES
Mathematics
Mathematical Logic and Accounting
Abstract
Problem realokacije kontejnera (engl. Container Relocation Problem) jedan je od ključnih izazova u upravljanju kontejnerskim terminalima, posebno tijekom operacija utovara i istovara brodova. U ovom problemu, svaki kontejner ima određeni prioritet. Cilj je dohvatiti sve kontejnere u definiranom redoslijedu, a koji je određen danim prioritetom. Kada je kontejner koji treba dohvatiti blokiran drugim kontejnerima, nužno je premjestiti te blokirajuće kontejnere kako bi se omogućio pristup kontejneru s većim prioritetom. U ovom radu prikazana su tri prioritetna pravila The Lowest Point (TLP), Reshuffle Index (RI) i Reshuffle Index with Lookahead (RIL) koja se koriste u rješavanju CRPa. Za pravila TLP i RI dani su primjeri njihove primjene, dok je pravilo RIL implementirano zajedno s grafičkim sučeljem koje prikazuje korake rješavanja problema.
Abstract (english)
The Container Relocation Problem (CRP) is one of the key challenges in managing container terminals, particularly during loading and unloading operations. In this problem, each container has a specified priority, and the goal is to retrieve all containers in the defined priority order. When other containers block a container that needs to be retrieved, it is necessary to move those blocking containers to allow access to the container according to its priority. This paper presents three priority rules for solving the Container Relocation Problem (CRP): The Lowest Point (TLP), Reshuffle Index (RI), and Reshuffle Index with Lookahead (RIL). Examples of applying the TLP and RI rules are provided, while the RIL rule is implemented along with a graphical interface that displays the steps for solving the problem.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:126:235952
Study programmeTitle: Bachelor of Mathematics and Computer Science
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) matematike i računarstva (sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) matematike i računarstva)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2024-10-07 10:53:45