Orienteering problem: A survey of recent variants, solution approaches and applications
Abstract The Orienteering Problem (OP) has received a lot of attention in the past few
decades. The OP is a routing problem in which the goal is to determine a subset of nodes to …
decades. The OP is a routing problem in which the goal is to determine a subset of nodes to …
A survey on algorithmic approaches for solving tourist trip design problems
D Gavalas, C Konstantopoulos, K Mastakas… - Journal of …, 2014 - Springer
The tourist trip design problem (TTDP) refers to a route-planning problem for tourists
interested in visiting multiple points of interest (POIs). TTDP solvers derive daily tourist tours …
interested in visiting multiple points of interest (POIs). TTDP solvers derive daily tourist tours …
Chapter 10: Vehicle routing problems with profits
10.1▪ Introduction The key characteristic of the class of Vehicle Routing Problems with Profits
(VRPPs) is that, contrary to what happens for the most classical vehicle routing problems …
(VRPPs) is that, contrary to what happens for the most classical vehicle routing problems …
The team orienteering problem with time windows: An lp-based granular variable neighborhood search
The Team Orienteering Problem (TOP) is a known NP-hard problem that typically arises in
vehicle routing and production scheduling contexts. In this paper we introduce a new …
vehicle routing and production scheduling contexts. In this paper we introduce a new …
The eCOMPASS multimodal tourist tour planner
Tour planning represents a challenging task for individuals visiting unfamiliar tourist
destinations, mainly due to the availability of numerous attractions (points of interest, POIs) …
destinations, mainly due to the availability of numerous attractions (points of interest, POIs) …
Heuristics for the time dependent team orienteering problem: Application to tourist route planning
D Gavalas, C Konstantopoulos, K Mastakas… - Computers & Operations …, 2015 - Elsevier
Abstract The Time Dependent Team Orienteering Problem with Time Windows (TDTOPTW)
can be used to model several real life problems. Among them, the route planning problem …
can be used to model several real life problems. Among them, the route planning problem …
An iterative three-component heuristic for the team orienteering problem with time windows
This paper studies the team orienteering problem with time windows, the aim of which is to
maximize the total profit collected by visiting a set of customers with a limited number of …
maximize the total profit collected by visiting a set of customers with a limited number of …
A GRASP to solve the multi-constraints multi-modal team orienteering problem with time windows for groups with heterogeneous preferences
Improving the travel experience is a goal of tourist destinations. Tourists demand information
and services that help plan and organise the trips adapted to their preferences and …
and services that help plan and organise the trips adapted to their preferences and …
[图书][B] Metaheuristics for vehicle routing problems
This book is dedicated to metaheuristics as applied to vehicle routing problems. Several
implementations are given as illustrative examples, along with applications to several typical …
implementations are given as illustrative examples, along with applications to several typical …
An effective memetic algorithm for the generalized bike-sharing rebalancing problem
Y Lu, U Benlic, Q Wu - Engineering Applications of Artificial Intelligence, 2020 - Elsevier
The generalized bike-sharing rebalancing problem (BRP) entails driving a fleet of
capacitated vehicles to rebalance bicycles among bike-sharing system stations at a …
capacitated vehicles to rebalance bicycles among bike-sharing system stations at a …