| Jurnal Angkasa Tahun 2012 Oleh Yuliani Indrianingsih |
PERBANDINGAN ALGORITMA BEST FIRST SEARCH DENGAN ALGORITMA GENETIK UNTUK SELEKSI PETI KEMAS PADA PELABUHAN |
| ABSTRAK |
| The era of increasingly advanced technology and growing rapidly, it needed performance quickly, accurately and efficiently. In addition to the use of technology that has been developed, is expected to improve the performance and cooperation between a company with another company. One example of a company that is needed in the trade is a cargo shipping company. Cargo companies sending goods between islands and countries. Delivery of goods is not only happened once, but can be repetitive. Therefore, we need a system that can assist officers in the field in the selection of cargo containers specifically for container ships. With a heavy load condition does not exceed the capacity of container ships, and each container has a high value Previous research has been done that is the title of Genetic Algorithms for the Selection of Container Port. In this research will be tested using best first search algorithm with the genetic algorithm as the benchmark for selection cargo containers at the port, which can lead to the selection of optimal container cargo, and the time required is also efficient. The results of studies that have been conducted found that the magnitude of the population size effect on the resulting fitness value. The best conditions on the size of the population that is 30, the number of generations 75, parameter crosses 0.6 and 0.2 mutation parameters. By using genetic algorithms, the selection of containers to be transported on board to produce the maximum total profit, taking into account the capacity of the vessel, the value of container and heavy container. Application of Genetic Algorithms for optimization problem solving, have weaknesses that are probabilistic, because it is always associated with random numbers. By using the algorithm A* Search the selection of containers by container values can generate optimal total container value. Key words: container, knapsack problem, genetic algorithm, A*Search. |
| download |