سال انتشار: ۱۳۸۷
محل انتشار: دومین کنگره مشترک سیستم های فازی و سیستم های هوشمند
تعداد صفحات: ۴
Danyal Bustan – Iran Electronic Industries
Hoda Moodi –
The travelling salesperson problem (TSP) is a well-known problem in combinatorial optimization; it belongs to a class of problems known as NP-complete. For this problem, SA hasfound more success in finding the optimal solution than other algorithms. But solving this problem with GA is still a challenge. Although, there are lot of efforts in using GA, because of nature of this problem, it leads to a complicated coding. In this paper a simple coding for this problem ispresented. This coding is showed that it has the ability to finding the suboptimal solution near the optimal one.