Perancangan Aplikasi Penjadwalan Traveling Salesman Problem dengan Algoritma Genetika
DOI:
https://doi.org/10.21512/comtech.v3i2.2332Keywords:
supply chain management, traveling salesman problem, genetic algorithmAbstract
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 often
referred 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.
Plum Analytics
References
Kusumadewi. S, Purnomo. H. (2005). Penyelesaian Masalah Optimasi dengan Teknik-Teknik Heuristik. Yogyakarta: Graha Ilmu.
Kylie Bryant, A. B. (2000). Genetic Algorithms and the Traveling Salesman Problem. Claremont: Harvey Mudd College.
Larranaga, P. et. al. (1999). Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators. Netherlands: Kluwer Academic Publishers.
Downloads
Published
Issue
Section
License
Authors who publish with this journal agree to the following terms:
a. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License - Share Alike that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
b. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
c. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
USER RIGHTS
All articles published Open Access will be immediately and permanently free for everyone to read and download. We are continuously working with our author communities to select the best choice of license options, currently being defined for this journal as follows:
