A Greedy algorithm for a bi-team orienteering problem with time window

In this paper an algorithm is designed to solve the bi-team orienteering problem with time window (BTOPTW). Aim of this study is to minimize the total travel cost and maximize the score gained by the salesman. In the real cases, minimizing the salesmen total travel costs is very important for bosses. In this study, a greedy solution approach is proposed. Different approaches of extracting non-dominated solutions were analyzed. The algorithms were compared by some measures such as: non-dominated Pareto size (NPS), spacing metric SM), generational distance (GD) and inverse generational distance (IGD). The effect of the time window is discussed in this paper and a comparison for orienteering problem with and without time windows is discussed. The results confirm that the proposed greedy algorithm has a satisfactory efficiency.