Syarif, Admi and Muludi, Kurnia and Gen, Mitsuo (2008) Implemetation of Hybridized Genetic Algorithm for Fuzzy Travelling Salesman Problem. In: Thirteenth International Conference on Information and Management Sciences, 3-8 August 2014, Zhangjiajie, China.

Preview

Text admi.pdf Download (3MB) | 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 throug some cities facilities in order to minimize travel distance. The classic TSP usually assumes that the travel cost are deterministic. In the real world applications, due to 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. In this paper, we consider a more realistic model called fuzzy TSP. By assuning that the travel costs between cities are represented by triangular fuzzy number, we examine how the route should be designed. We devlope a Genetic Algorithm hybridized with local approach to solve problem. Several numerical experiments are done to show the effectiveness of the proposed method. Keywords: fuzzy number, logistic, Traveling Salesman Problem, genetic Algorithm, Local search

Item Type:	Conference or Workshop Item (Paper)
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:	Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA) > Prodi Ilmu Komputer
Depositing User:	Kurnia Muludi
Date Deposited:	25 Apr 2018 02:29
Last Modified:	25 Apr 2018 02:29
URI:	http://repository.lppm.unila.ac.id/id/eprint/6591

Actions (login required)

View Item