Admi Syarif, AS and Muludi, Kurnia and Gen, Mitsuo Pengecekan Plagiasi - Implementation of Hybridized Genetic Algorithm for Fuzzy Traveling Salesman Problem. Intelligent Networks and Systems Society.

Preview

Text SI_14_IMS_China_2014.pdf Download (1MB) | Preview

Abstract

The Traveling Salesman Problem (TSP) is known as one of NP-complete optimization problems that has taken great interest of the researchers. The common objective is to determine route through some cities facilities in order to minimize travel distance. The classic TSP usually assumes that the travel costs are deterministic. In the real- world applications, due to the complexity of social and economic factors, it is often difficult to have deterministic value of travel costs (i.e. travel time). One way of handling such uncertainty in decision making is by introducing fuzzy programming approach. Since TSP is also usually very large, huge research efforts have been devoted to develop heuristic algorithms for solving TSP. It has also been reported that Genetic Algorithm could give a good solution of TSP within reasonable time. In this paper, we consider a more realistic model called fuzzy TSP. By assuming that the travel costs between cities are represented by triangular fuzzy number, we examine how the route should be designed. We develop a GA hybridized with local approach to solve the problem. Several numerical experiments are done to show the effectiveness of the proposed method.

Item Type:	Other
Subjects:	A General Works > AC Collections. Series. Collected works
Depositing User:	DR Admi Syarif
Date Deposited:	24 Dec 2021 10:32
Last Modified:	24 Dec 2021 10:32
URI:	http://repository.lppm.unila.ac.id/id/eprint/36979

Actions (login required)

View Item