An efficient and fast approach to the orienteering problem using hybrid genetic algorithm

With the rapid modernization in the transportation sector, it is an important issue to deliver the products to the different destinations within a short span of time and as well as to earn maximum profit by serving more number of customers keeping in view of their priority level. The orienteering problem is a game that exactly relates with the above real life scenario. Here a set of nodes or cities having a score is given. The target is to find a route that has a length less than the maximum permitted length and visits some cities to maximize the sum of the scores. This paper applies a hybrid genetic algorithm to find a fast solution of the orienteering problem. The results are also promising and this algorithm converges very fast to produce the result. The algorithm is tested on the real data set of 27 cities in China.