• New OP variant with service time dependent profits and travel times. Mathematical formulation possible applications of this problem. Metaheuristic solution approach composed specific local moves. Benchmark instances known optimal solutions to verify the approach. Real data instance evaluate proposed model method. This paper addresses orienteering problem windows (TDOPTW-STP). In TDOPTW-STP, e...

The Team Orienteering Problem with Time Windows (TOPTW) is the extension of the Team Orienteering Problem (TOP) by incorporating the time window constraints. Given a set of nodes including their scores, service times and time windows, the goal is to maximize the total of scores collected by a fixed number of routes considering a predefined time window during which the service has to start. In t...

We address the Home Health Care Delivery Problem (HHCDP), which is concerned with staff scheduling in the home health care industry. The goal is to schedule health care providers to serve patients at their homes that maximizes the total collected preference scores from visited patients subject to several constraints, such as workload of the health care providers, time budget for each provider a...

In this paper, we formulate and study the Multi-agent Orienteering Problem with Time-dependent Capacity Constraints (MOPTCC). MOPTCC is similar to the classical orienteering problem at the single-agent level: given a limited time budget, an agent travels around the network and collects rewards by visiting different nodes, with the objective of maximizing the sum of his collected rewards. The mo...

Stochastic Combinatorial Optimization Problems (SCOPs) are many times used to model more accurately realistic situations. However, the stochasticity introduced also perplexes the computation of the objective function making it either difficult to solve or in our case very timeconsuming. In this paper, we present different techniques of evaluating the objective function of the Orienteering Probl...

In this paper we study the Arc Orienteering Problem in directed and undirected graphs. To the best of our knowledge, we give the fist approximation algorithms for both the undirected and the directed versions of the problem. Our main results are the following: (i) We give an O( log 2(m) log log(m) )−approximation algorithm for the AOP in directed graphs, where m is the number of arcs of the gra...

The Traveling Salesman Problem is a major foundational problem in the fields of Computer Science, Operations Research, and Applied Mathematics, in which an agent wants to visit a set of target points with the shortest path possible. This problem is of the highest interest both theoretically in practice. When the agent is a vehicle whose trajectory must satisfy a set of dynamic constraints and t...

In this paper, a novel discrete particle swarm optimization (PSO) algorithm is proposed to solve the team orienteering problem (TOP). Discrete evaluation is achieved by redefining all operators and operands used in PSO. To obtain better results, a strengthened PSO, which improves both exploration and exploitation during the search process, is employed. Our algorithm achieves the best known solu...