期刊名称：International Scientific Journal of Management Information Systems
印刷版ISSN：1452-774X
出版年度：2008
卷号：3
期号：1
页码：017-022
出版社：University of Novi Sad
摘要：This article describes the application of Self Organizing Migrating Algorithm (SOMA) to the well-known optimization problem - Traveling Salesman Problem (TSP). SOMA is a relatively new optimization method that is based on Evolutionary Algorithms that are originally focused on solving non-linear programming problems that contain continuous variables. The TSP has model character in many branches of Operation Research because of its computational complexity; therefore the use of Evolutionary Algorithm requires some special approaches to guarantee feasibility of solutions. In this article two concrete examples of TSP as 8 cities set and 25 cities set are given to demonstrate the practical use of SOMA. Firstly, the penalty approach is applied as a simple way to guarantee feasibility of solution. Then, new approach that works only on feasible solutions is presented.
