Putro, Angger Priyardhan (2016) Items Arrangement in Container using Particle Swarm Optimization Algorithm. Other thesis, Fakultas Ilmu Komputer UNIKA Soegijapranata Semarang.
|
Text (COVER)
11.02.0065 Angger Priyardhan Putro COVER.pdf Download (649kB) | Preview |
|
Text (BAB I)
11.02.0065 Angger Priyardhan Putro BAB I.pdf Restricted to Registered users only Download (642kB) |
||
Text (BAB II)
11.02.0065 Angger Priyardhan Putro BAB II.pdf Restricted to Registered users only Download (644kB) |
||
Text (BAB III)
11.02.0065 Angger Priyardhan Putro BAB III.pdf Restricted to Registered users only Download (643kB) |
||
Text (BAB IV)
11.02.0065 Angger Priyardhan Putro BAB IV.pdf Restricted to Registered users only Download (648kB) |
||
Text (BAB V)
11.02.0065 Angger Priyardhan Putro BAB V.pdf Restricted to Registered users only Download (659kB) |
||
Text (BAB VI)
11.02.0065 Angger Priyardhan Putro BAB VI.pdf Restricted to Registered users only Download (642kB) |
||
|
Text (DAFTAR PUSTAKA)
11.02.0065 Angger Priyardhan Putro DAFTAR PUSTAKA.pdf Download (639kB) | Preview |
Abstract
Abstract — For the shipping companies, items arrangement in containers is an important issue. To earn profits as much as possible the preparation of the goods in the container must be as efficient as possible so it can minimize the transportation costs. That is why it needs an algorithm that can help to resolve this problem. One algorithm that can solve this problem is the Particle Swarm Optimization algorithm. This project was made using the Java programming language and the algorithm using Particle Swarm Optimization algorithm. How it works is at first the Particle Swarm Optimization is begin to formed a random solution, after that every solution will counting its fitness, after fitness value is obtained, a solution with a best value will be used as a reference to create a new solution in the next iteration by updating its speed and position. In this project every particle has several attributes I.e. the code, size and position of the goods in the container. The fitness value is determined from how much free space is available in that solution, the more free space available and the more items available in the container, the more fitness value is.
Item Type: | Thesis (Other) |
---|---|
Subjects: | 000 Computer Science, Information and General Works > 004 Data processing & computer science |
Divisions: | Faculty of Computer Science > Department of Informatics Engineering |
Depositing User: | Mr Ign. Setya Dwiana |
Date Deposited: | 31 May 2016 06:24 |
Last Modified: | 04 Jan 2023 06:12 |
URI: | http://repository.unika.ac.id/id/eprint/9712 |
Actions (login required)
View Item |