Heuristics for the time dependent team orienteering problem: Application to tourist route planning

Gavalas, Damianos; Konstantopoulos, Charalampos; Mastakas, Konstantinos; Pantziou, Grammati; Vathis, Nikolaos

doi:10.1016/j.cor.2015.03.016

Cited by 81 publications

(67 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The time-dependent variant of the OP is relatively new and has, to the best of our knowledge, only been studied in (Fomin and Lingas, 2002;Abbaspour and Samadzadegan, 2011;Garcia et al, 2013;Li et al, 2010;Li, 2011;Gavalas et al, 2014Gavalas et al, , 2015. Fomin and Lingas (2002) were the first authors to mention the TD-OP and state that it is NP-hard because the OP is NP-hard.…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

The time-dependent orienteering problem with time windows: a fast ant colony system

2017

View full text Add to dashboard Cite

This paper proposes a fast ant colony system based solution method to solve realistic instances of the time-dependent orienteering problem with time windows within a few seconds of computation time. Orienteering problems occur in logistic situations where an optimal combination of locations needs to be selected and the routing between these selected locations needs to be optimized. For the time-dependent problem, the travel time between two locations depends on the departure time at the first location. The main contribution of this paper is the design of a fast and effective algorithm for this problem. Numerous experiments on realistic benchmark instances with varying size confirm the state-of-the-art performance and practical relevance of the algorithm.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

“…They exploit the fixed frequency of bus services to come up with an efficient solution technique. The most recent work is from Gavalas et al (2014) and Gavalas et al (2015). The authors propose several cluster-based heuristics for the TD-TOP applied to tourist trip planning.…”

Section: Literature Reviewmentioning

confidence: 99%

The time-dependent orienteering problem with time windows: a fast ant colony system

2017

View full text Add to dashboard Cite

show abstract

“…However, for the pesticide spraying process, the profit from each farmland after spraying pesticides also changes with the temperature [9]. The relation between the efficacy of the sprayed farmland and the time is not fixed on one function, and it could be another functional relationship.…”

Section: Mathematical Problems In Engineeringmentioning

confidence: 99%

Optimization of Pesticide Spraying Tasks via Multi-UAVs Using Genetic Algorithm

Luo

Niu

Zhu

et al. 2017

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Task allocation is the key factor in the spraying pesticides process using unmanned aerial vehicles (UAVs), and maximizing the effects of pesticide spraying is the goal of optimizing UAV pesticide spraying. In this study, we first introduce each UAV's kinematic constraint and extend the Euclidean distance between fields to the Dubins path distance. We then analyze the two factors affecting the pesticide spraying effects, which are the type of pesticides and the temperature during the pesticide spraying. The time window of the pesticide spraying is dynamically generated according to the temperature and is introduced to the pesticide spraying efficacy function. Finally, according to the extensions, we propose a team orienteering problem with variable time windows and variable profits model. We propose the genetic algorithm to solve the above model and give the methods of encoding, crossover, and mutation in the algorithm. The experimental results show that this model and its solution method have clear advantages over the common manual allocation strategy and can provide the same results as those of the enumeration method in small-scale scenarios. In addition, the results also show that the algorithm parameter can affect the solution, and we provide the optimal parameters configuration for the algorithm.

show abstract

“…However, decisions on what places to include among the PoI are largely made based on tourists' preferences, often overlooking the difficulties that one may have to get there (transportation) [37][38][39][40][41][42].…”

Section: Sightseeingmentioning

confidence: 99%

A multi-user decision support system for online city bus tour planning

et al. 2017

View full text Add to dashboard Cite

Tourism is rapidly becoming a sustainable pathway toward economic prosperity for host countries and communities. Recent advances in information and communications technology, the smartphone, the Internet and Wi-Fi have given a boost to the tourism industry. The city bus tour (CBT) service is one of the most successful businesses in the tourism industry. However, there exists no smart decision support system determining the most efficient way to plan the itinerary of a CBT. In this research, we report on the ongoing development of a mobile application (app) and a website for tourists, hoteliers and travel agents to connect with city bus operators and book/purchase the best CBT both in terms of cost and time. Firstly, the CBT problem is formulated as an asymmetric sequential three-stage arc routing problem. All places of interest (PoI) and pickup/dropout points are identified with arcs of the network (instead of nodes), each of which can be visited at least once (instead of exactly once). Secondly, the resulting pure integer programming (IP) problem is solved using a leading optimization software known as General Algebraic Modeling System (GAMS). The GAMS code developed for this project returns: (1) the exact optimal solution identifying the footprints of the city bus relative to all the arcs forming the minimal cost network; (2) the augmenting paths corresponding to the pickup stage, the PoI visiting stage and the drop-off stage. Finally, we demonstrate the applicability of the mobile app/website via a pilot study in the city of Melbourne (Australia). All the computations relative to the initial tests show that the ability of the app to answer users' inquiries in a fraction of a minute.

show abstract

Heuristics for the time dependent team orienteering problem: Application to tourist route planning

Cited by 81 publications

References 27 publications

The time-dependent orienteering problem with time windows: a fast ant colony system

The time-dependent orienteering problem with time windows: a fast ant colony system

Optimization of Pesticide Spraying Tasks via Multi-UAVs Using Genetic Algorithm

A multi-user decision support system for online city bus tour planning

Contact Info

Product

Resources

About