| Jurnal Angkasa Tahun 2011 Oleh Yuliani Indrianingsih |
Algoritma Genetik Untuk Seleksi Peti Kemas Pada Pelabuhan |
| ABSTRAK |
| The fast growing technology era, needs faster, perfect, and efficient performance of work. For example is packaging company. If they want to be survive, the company should move faster than the other companies in their delivery service. Besides, they should also consider the efficiency to get the maximum profit. This paper talks about genetic algorithm for selecting the correct packaging to be loaded in a containership.The criteria of efficiency in this paper is the space of the containership left as small as possible, packaging to be loaded in the containership as many as with the maximum profit. Knapsack problem select some different subset of items available and each item has a weight and profit. Genetic algorithm is a randomize, searching method that mimic the metaphor of natural biological evolution, like natural selection, crossover,and mutation. In genetic algorithm as called as fitness function term, that is fittest value of a chromosome. The fittest chromosome will be stay on so it has a probability to be parents which produces offsprings. The fitness value in genetic algorithm is identical with objective function which will be maximized. The experiment for results show that the increasing of fitness value will increase the maximized objective function value. The best conditions for knapsack problem with population size of 30, generations of 75, crossover rate of 0.6 and mutation rate of 0.2. In this case means that genetic algorithms can be applied in a complete selection of cargo in containers on containership. Key words: container, containership, knapsack problem, genetic algorithm. |
| download |