Work

Items Arrangement in Container using Particle Swarm Optimization Algorithm

Year: 2016
Type: dissertation
Abstract: — For the shipping companies, items arrangement in \ncontainers is an important issue. To earn profits as much as possible \nthe preparation of the goods in the container must be as efficient as \npossible so it can minimize the transportation costs. That is why it \nneeds an algorithm that can help to resolve this problem. One \nalgorithm that can solve this problem is the Particle Swarm \nOptimization algorithm. \nThis project was made using the Java programming language and \nthe algorithm using Particle Swarm Optimization algorithm. How it \nworks is at first the Particle Swarm Optimization is begin to formed a \nrandom solution, after that every solution will counting its fitness, after \nfitness value is obtained, a solution with a best value will be used as a \nreference to create a new solution in the next iteration by updating its \nspeed and position. \nIn this project every particle has several attributes I.e. the code, \nsize and position of the goods in the container. The fitness value is \ndetermined from how much free space is available in that solution, the \nmore free space available and the more items available in the \ncontainer, the more fitness value is.
Author: Putro, Angger Priyardhan
Language: English
Open Access status: green
OpenAlex ID: W2909824468
Cites:
Cited by:
Related to: 10