Implemetation of Hybridized Genetic Algorithm for Fuzzy Travelling Salesman Problem
| Main Authors: | syarif, admin, Muludi, Kurnia |
|---|---|
| Format: | Article PeerReviewed application/pdf |
| Terbitan: |
California polytechnic State University
, 2014
|
| Subjects: | |
| Online Access: |
http://repository.unila.ac.id/830/1/admi.pdf http://orsc.edu.cn/ims/ims2014/default.htm http://repository.unila.ac.id/830/ |
Daftar Isi:
- 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 tc, minimize travel distance. The classic TSP usually assumes that the travel costs are deterministic. In the re-al-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 Al-gorithm could give a good solution of TSP within reasona-ble 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 hy-bridized with local approach to solve the problem. Several numerical experiments are done to show the effectiveness of the proposed method.