A Viral System to Solve Generalized Orienteering Problem

Transportation problem is one of combinatorial problems interesting to discuss. Generalized Orienteering Problem (GOP) is a transportation problem. GOP is the development of Traveling Salesman Problem. The purpose of GOP is to maximize total score with a maximum mileage limit. In GOP, there is set of scores which represents level of satisfaction that can be achieved by an orienteer by visiting some places. GOP is a combinatorial optimization problem where metaheuristics is suitable tool to solve it. In this paper, Viral System (VS) is used to solve GOP. VS is a new algorithm that mimics the pattern of virus life. The algorithm performed good enough for other combinatorial cases. To evaluate our VS on GOP, the test data of 27 cities were used. Five different weights have been tried and VS showed promising performance. Therefore, VS still needs further modification in order to compete with other algorithm s.