The orienteering problem (OP) is a well established problem in combinatorial optimization. In this problem, there is a set of n nodes or cities, V , and each node i has an associated non-negative score S(i). If a city is visited on a route, then its score is gathered (but visiting a city more than once does not yield additional scoring). Hence, the score associated with a path visiting a set of...

Wildfires are a natural phenomenon that regularly occurs in many terrestrial ecosystems. Due to global warming, the rate and span of wildfires have remarkably increased during last years, causing important economic losses human casualties. Several initiatives been undertaken years order apply operations research tools help firefighting teams schedule optimize their protection activities when de...

In this paper we study a variant of the Capacitated Team Orienteering Problem (CTOP), that is the problem where a fleet of vehicles, each with a constraint on the time available, is given to serve profitable customers with the objective of maximizing the collected profit. We study the variant where customers may be only partially served (incomplete service) and, if beneficial, also by more than...

A key task of sales representatives in operational planning is to select the most profitable customers visit within next few days. strongly varying set scoring methods predicting or approximating expected response exists for this customer selection phase. However, case field forces, final interrelated with tour decisions. To end, we formalize variants problem as a multi-period team orienteering...

Mathematical elements of maps, in addition to the methods presenting content with cartographic symbols and criteria generalization, are most important modern ground plan view maps. At same time, on maps for orienteering disciplines, which internationally unified world, mathematical basis is not defined very detailed specifications. In this paper, we describe background reasons apparent insignif...

This paper describes a branch-and-cut algorithm to solve the Team Orienteering Problem (TOP). TOP is a variant of the Vehicle Routing Problem (VRP) in which the aim is to maximize the total amount of collected profits from visiting customers while not exceeding the predefined travel time limit of each vehicle. In contrast to the exact solving methods in the literature, our algorithm is based on...

In this paper we propose an adaptation of the GRASP metaheuristic to solve multi-objective combinatorial optimization problems. In particular we describe several alternatives to specialize the construction and improvement components of GRASP when two or more objectives are considered. GRASP has been successfully coupled with path-relinking for single-objective optimization. In this paper, we pr...

In this study, the problem is to find a route for UAV that takes off from Istanbul observe damages may occur after possible earthquake within first 24 hours. problem, 230 candidate grid points can visit on are determined and weight values combining risk based degree zones population densities of calculated each point. It aimed maximize total weights visited under range constraint. The described...