ComTech: Computer, Mathematics and Engineering Applications
Vol 3, No 2 (2012): ComTech

Perancangan Aplikasi Penjadwalan Traveling Salesman Problem dengan Algoritma Genetika

Tannady, Hendy (Unknown)
Limas, Andrew Verrayo (Unknown)



Article Info

Publish Date
01 Dec 2012

Abstract

Supply chain management plays an important role in enhancing the efficiency and effectiveness of manufacturing industry business process. In this research, the problem is taken from a sales division in a company in determining the optimal sequence when delivering goods into nine cities. This problem is oftenreferred as travelling salesman problem. This problem is considered important since the optimal sequence can cut off operational cost. Creating an artificial intelligence for the company in determining the location and the optimal sequence of delivering goods is the main objective of this research. A genetic algorithm is utilized to determine the location and the optimal sequence. While for processing the data and concluding the result, researcher designed a Java-based application that provides the capability of automatic computing. The result of this computation is a sequence of locations with a fitness number for each. The best fitness number for the sequence location will be used for the final result and the conclusion to answer the company?s problem.

Copyrights © 2012






Journal Info

Abbrev

comtech

Publisher

Subject

Computer Science & IT Engineering Mathematics

Description

The journal invites professionals in the world of education, research, and entrepreneurship to participate in disseminating ideas, concepts, new theories, or science development in the field of Information Systems, Architecture, Civil Engineering, Computer Engineering, Industrial Engineering, Food ...