Problem definition. The data-driven time-dependent orienteering problem with soft time windows (DD-TD-OP-STW) is stated as follows: A set of customers, each bearing a prize, may or may not be served during a single working day by a single vehicle that departs and returns to a depot.
In this paper, we study a single-vehicle routing problem with stochastic service times, stochastic time-dependent travel times, and soft time windows, where the ...
In this paper, we study an extension of the orienteering problem where travel times are random and time-dependent and service times are random.
This paper addresses the time dependent orienteering problem with time windows and service time dependent profits (TDOPTW-STP). In the TDOPTW-STP, each vertex ...
Missing: driven | Show results with:driven
People also ask
What is the orienteering problem with time windows?
What are soft time windows constraints?
The data-driven time-dependent orienteering problem with soft time windows ... Time dependent orienteering problem with time windows and service time dependent ...
To solve this problem, a mixed integer linear model is formulated and a metaheuristic algorithm based on variable neighborhood search (VNS) is developed. This ...
Missing: driven | Show results with:driven
This paper addresses the time dependent orienteering problem with time windows and service time dependent profits (TDOPTW-STP). In the TDOPTW-STP, ...
The time-dependent orienteering problem with time windows: a fast ...
www.semanticscholar.org › paper
A fast ant colony system based solution method to solve realistic instances of the time-dependent orienteering problem with time windows within a few ...
In this paper, we study a single-vehicle routing problem with stochastic service times, stochastic time-dependent travel times, and soft time windows, ...
Jun 20, 2020 · The orienteering problem with time windows and synchronisation constraints, known as the Cooperative Orienteering Problem with Time Windows ...