Add to ORKGIn recent years, the interest on Stochastic Combinatorial Optimization Problems has increased a lot, since through them it is possible to model the reality more accurately than with their deterministic counterparts. However, for many problems the added stochastic element introduces intricacies that make the objective function either difficult to solve or very time-consuming. In this paper, we propose alternative sampling-based techniques for approximating the objective function of the Orienteering Problem with Stochastic Travel and Service Times, a combinatorial optimization problem arising in logistic applications. The sampling-based techniques are finally compared from an experimental point of view
The Orienteering Problem (OP) is a routing problem which has many interesting applications in logist...
This paper introduces the stochastic time-dependent orienteering problem with time windows. The orie...
The Orienteering Problem (OP) is a generalization of the well-known traveling salesman problem and h...
In recent years, the interest on Stochastic Combinatorial Optimization Problems has increased a lot,...
Stochastic Combinatorial Optimization Problems (SCOPs) are many times used to model more accurately ...
In this paper, a variant of the orienteering problem in which the travel and service times are stoch...
In this paper we propose a new metaheuristic approach based on sampling for the Orienteering Problem...
The Orienteering Problem is a combinatorial optimization problem where a set of potential customers,...
In this paper, a variant of the orienteering problem in which the travel and service times are stoch...
The Probabilistic Orienteering Problem is a variant of the orienteering problem where customers are ...
This paper introduces a solution procedure to solve the time-dependent orienteering problem with tim...
This paper introduces a solution procedure to solve the time-dependent orienteering problem with tim...
The Probabilistic Orienteering Problem is a stochastic optimization problem about the delivery or go...
The field of logistics and combinatorial optimization features a wealth of NP-hard problems that are...
The Orienteering Problem (OP) is a routing problem which has many interesting applications in logist...
The Orienteering Problem (OP) is a routing problem which has many interesting applications in logist...
This paper introduces the stochastic time-dependent orienteering problem with time windows. The orie...
The Orienteering Problem (OP) is a generalization of the well-known traveling salesman problem and h...
In recent years, the interest on Stochastic Combinatorial Optimization Problems has increased a lot,...
Stochastic Combinatorial Optimization Problems (SCOPs) are many times used to model more accurately ...
In this paper, a variant of the orienteering problem in which the travel and service times are stoch...
In this paper we propose a new metaheuristic approach based on sampling for the Orienteering Problem...
The Orienteering Problem is a combinatorial optimization problem where a set of potential customers,...
In this paper, a variant of the orienteering problem in which the travel and service times are stoch...
The Probabilistic Orienteering Problem is a variant of the orienteering problem where customers are ...
This paper introduces a solution procedure to solve the time-dependent orienteering problem with tim...
This paper introduces a solution procedure to solve the time-dependent orienteering problem with tim...
The Probabilistic Orienteering Problem is a stochastic optimization problem about the delivery or go...
The field of logistics and combinatorial optimization features a wealth of NP-hard problems that are...
The Orienteering Problem (OP) is a routing problem which has many interesting applications in logist...
The Orienteering Problem (OP) is a routing problem which has many interesting applications in logist...
This paper introduces the stochastic time-dependent orienteering problem with time windows. The orie...
The Orienteering Problem (OP) is a generalization of the well-known traveling salesman problem and h...