Solving the stochastic time-dependent orienteering problem with time windows

Verbeeck, Cédric; Vansteenwegen, Pieter; Aghezzaf, El‐Houssaine

doi:10.1016/j.ejor.2016.05.031

Cited by 44 publications

(16 citation statements)

References 81 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The experimental data shows that the coverage and accuracy of the system in this paper have been greatly improved, and the comprehensive performance has been further optimized [1][2][3] really become a leisure sport in modern life. As a new sport, orienteering refers to athletes using North needle and map to nd the location of each point on the drawing, and reach all points in the shortest time to win the game.…”

Section: Introductionmentioning

confidence: 92%

Application of Intelligent Orienteering Based on Internet of Things

Zhang

Liu

2020

Preprint

View full text Add to dashboard Cite

Orienteering has gradually changed from a professional sport to a civilian sport. Especially in recent years, orienteering has been widely popularized. Many colleges and universities in China have also set up this course. With the improvement of people's living conditions, orienteering has really become a leisure sport in modern people's life. The reduced difficulty of sports enables more people to participate, but it also exposes a series of problems. As the existing positioning technology is relatively backward, the progress in personnel tracking, emergency services and other aspects is slow. To solve these problems, a new intelligent Orienteering application system is developed based on the Internet of things. ZigBee network architecture is adopted in the system. ZigBee is the mainstream scheme in the current wireless sensor network technology, which has many advantages such as convenient carrying, low power consumption, and signal stability. Due to the complex communication environment in mobile signal, the collected information is processed by signal amplification and signal anti-interference technology. By adding anti-interference devices, video isolators and other devices, the signal is guaranteed to the maximum extent. In order to verify the actual effect of this system, through a number of experimental studies including the relationship between error and traffic radius and the relationship between coverage and the number of anchor nodes, the data shows that the scheme studied in this paper has a greater improvement in comprehensive performance than the traditional scheme, significantly improving the accuracy and coverage. Especially the coverage is close to 100% in the simulation experiment. This research has achieved good results and can be widely used in Orienteering Training and competition.

show abstract

Section: Introductionmentioning

confidence: 92%

Application of Intelligent Orienteering Based on Internet of Things

Zhang

Liu

2020

Preprint

View full text Add to dashboard Cite

show abstract

“…Zhang et al [12] regarded wait time at a customer as random variables, and tailored a variable neighborhood search for OPTW. Verbeeck et al [13] focused on the stochastic time-dependent orienteering problem with time windows, designed a stochastic ant colony system. However, the premise of probability theory is that the cumulative frequency distribution is close enough to the true probability, that is to say, there must be enough sampling data.…”

Section: Literature Reviewmentioning

confidence: 99%

Uncertain Team Orienteering Problem With Time Windows Based on Uncertainty Theory

et al. 2019

View full text Add to dashboard Cite

Uncertainty theory is a branch of mathematics for modeling indeterminacy, especially belief degrees. This paper considers an application of uncertainty theory in team orienteering problem with time windows. In the problem, travel time is uncertain with known uncertainty distribution, and the impact of uncertainties on visit time and total profit cannot be ignored. Based on the uncertainty theory, a model of uncertain team orienteering problem with time windows (UTOPTW) is established. Since the UTOPTW cannot be solved to optimality within polynomial time, an improved iterated search algorithm is designed considering uncertainties in the insertion step. Finally, several numerical instances are used to verify the effectiveness of the proposed model and algorithm. INDEX TERMS Uncertainty theory, team orienteering problem with time windows, uncertain programming, iterated local search.

show abstract

“…Verbeeck, Aghezzaf, and Vansteenwegen (2014) provided a fast solution method for the TDOP based on an ant colony optimization algorithm. Recently, Verbeeck, Vansteenwegen, and Aghezzaf (2016) presented an ant colony optimization based algorithm for the stochastic variant of the TDOP, which is addressed as the stochastic time-dependent orienteering problem with time windows. For more details about the OP and its variants, readers are referred to Vansteenwegen, Souffriau, and Oudheusden (2011) and Gunawan, Lau, and Vansteenwegen (2016) .…”

Section: The Traveling Salesman Problem With Profits (Tsp With Profits)mentioning

confidence: 99%

The time-dependent capacitated profitable tour problem with time windows and precedence constraints

Sun

Veelenturf

Dabia

et al. 2018

European Journal of Operational Research

View full text Add to dashboard Cite

We introduce the time-dependent capacitated profitable tour problem with time windows and precedence constraints. This problem concerns determining a tour and its departure time at the depot that maximizes the collected profit minus the total travel cost (measured by total travel time). To deal with road congestion, travel times are considered to be time-dependent. We develop a tailored labeling algorithm to find the optimal tour. Furthermore, we introduce dominance criteria to discard unpromising labels. Our computational results demonstrate that the algorithm is capable of solving instances with up to 150 locations (75 pickup and delivery requests) to optimality. Additionally, we present a restricted dynamic programing heuristic to improve the computation time. This heuristic does not guarantee optimality, but is able to find the optimal solution for 32 instances out of the 34 instances.

show abstract

Solving the stochastic time-dependent orienteering problem with time windows

Cited by 44 publications

References 81 publications

Application of Intelligent Orienteering Based on Internet of Things

Application of Intelligent Orienteering Based on Internet of Things

Uncertain Team Orienteering Problem With Time Windows Based on Uncertainty Theory

The time-dependent capacitated profitable tour problem with time windows and precedence constraints

Contact Info

Product

Resources

About