Paper Title
A New Arithmetic Optimization Algorithm for Team Orienteering Problem

Abstract
Abstract - The major purpose of this research is to propose an optimization algorithm which can be employed to solve wide range of optimization problem. Arithmetic Optimization Algorithm (AOA) is developed to solve Team Orienteering problem. The developed algorithm is based on random crossover and mutation operation in the exploration phase, and two neighborhoods which are insert and swap in the exploitation phase. AOA was benchmarked for 12 test instances of the TOP. TOP is a specific vehicle routing problem in which the aim is to search a fixed number of paths that maximize the scores associated with a set of given locations within a limited time. The proposed algorithm detects all but one of the best-known solutions. The comparison conducted between AOA and the state-of-the-art based on statistical test. The results show that AOA outperformed most of state-of-the-art algorithms.