Optimizing Transportation Problems in Urban Management Area Using Orienteering Problem with Dependent Time Horizon

In urban management area, modeling and proposing new solving approaches to optimize different related transportation problems, is one of the most important and challengeable subject. In the literature, researchers have considered different problems related to public transportation and urban traffic, waste management, rescue and crisis, and even urban tourism in this context, and have discussed these works have caused decreasing costs, increasing rapidity and ease of transportation, decreasing pollution, and accelerating movement to build a sustainable city. This paper proposes, describes and models a new type of Orienteering Problem (OP) which has high level of compatibility with urban transportation problems, and in which the time horizon is not constant and changes depending on the events and conditions of visiting vertices. To solve this problem, a heuristic algorithm, based on greedy concepts is proposed and its performance has been investigated by 85 random samples.