AKSES INFORMASI PENGIRIMAN BARANG DI KANTOR POS JEMUR SARI UNTUK AREA SURABAYA TIMUR MENGGUNAKAN METODE ANT COLONY OPTIMIZATION BERBASIS J2ME

Nowdays, the post office can be said as "public service center" because there are variety of services like payment of electricity bill, water bill, telephone bill and also saving. Taking advantage of information technology (IT) and telecommunications, all data are computerized. The system is capable for improving the quality of postal services. This final project will be made an information system on the delivery route with the shortest distance that facilitates the parcel post delivery staffs to distribute the package to the customer addresses. The selected algorithm is Optimizatian Ant Colony (ACO) which resulted in the order of route which can be accessed by the staffs via handphone based on Java 2 Micro Edition (J2ME). Another advantage is to save fleets� fuel. As a comparison, the Dijkstra algorithm is included to test the performance of ACO. From the result of the tests, it�s obtained same shortest distance. However, the ACO requires an average time of 16,326 seconds to get the shortest distance than the average time of Dijkstra, 0,036 seconds because the parameters used in Ant Colony more than Dijkstra. ACO parameters that most influence the course of program execution is the number of cycles and the number of ants also total node used. For the mobile client and server interaction, information access speed depends on the throughput given, average of 27,88 kbps. Login takes more time, averaging 14,57 seconds while to get the route takes an average of 4,9 seconds. Keywords: Ant Colony Optimization (ACO), Dijkstra, and Java 2 Micro Edition (J2ME)