Study on the Time-Dependent Orienteering Problem

Li, Jin; Wu, Qinmin; Li, Xueqian; Dao-li, Zhu

doi:10.1109/iceee.2010.5660232

Cited by 9 publications

(10 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

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%

“…They are able to solve multi-modal routing problems in the city of Tehran, although no absolute performance measure (gap) was reported. Li et al (2010) propose a mixed integer programming model of the TD-OP combined with an optimal pre-node labelling algorithm based on the idea of network planning and dynamic programming. However, this algorithm is not tested on benchmark instances and therefore no performance metrics are proposed.…”

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%

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

“…The time-dependent variant of the OP is relatively new and has, to the best of our knowledge, only been studied in [1,48,53,55,56,89,90]. Fomin and Lingas [48] were the first authors to mention the TD-OP and state that it is NP-hard because the OP is NP-hard.…”

Section: Orienteering Problems With Deterministic Timedependent Travementioning

confidence: 99%

“…They are able to solve multi-modal routing problems in the city of Tehran, although no absolute performance measure (gap) was reported. Li et al [90] propose a mixed integer programming model of the TD-OP combined with an optimal pre-node labelling algorithm based on the idea of network planning and dynamic programming. However, this algorithm is not tested on benchmark instances and therefore no performance metrics are proposed.…”

Section: Orienteering Problems With Deterministic Timedependent Travementioning

confidence: 99%

Optimizing practical orienteering problems with stochastic time-dependent travel times: towards congestion free routes

Verbeeck¹

2016

4OR-Q J Oper Res

View full text Add to dashboard Cite

“…The time-dependent variant of the OP is relatively new and has, to the best of our knowledge, only been studied by [13,1,14,32,31]. Fomin & Lingas [13] 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%

A fast solution method for the time-dependent orienteering problem

Verbeeck¹,

Sörensen²,

Aghezzaf³

et al. 2014

European Journal of Operational Research

View full text Add to dashboard Cite

This paper introduces a fast solution procedure to solve 100-node instances of the time-dependent orienteering problem (TD-OP) within a few seconds of computation time. Orienteering problems occur in logistic situations were an optimal combination of locations needs to be selected and the routing between the selected locations needs to be optimized. In the time-dependent variant, the travel time between two locations depends on the departure time at the first location. Next to a mathematical formulation of the TD-OP, the main contribution of this paper is the design of a fast and effective algorithm to tackle this problem. This algorithm combines the principles of an ant colony system (ACS) with a time-dependent local search procedure equipped with a local evaluation metric. Additionally, realistic benchmark instances with varying size and properties are constructed. The average score gap with the known optimal solution on these test instances is only 1.4% with an average computation time of 0.5 seconds. An extensive sensitivity analysis shows that the performance of the algorithm is insensitive to small changes in its parameter settings.

show abstract

Study on the Time-Dependent Orienteering Problem

Cited by 9 publications

References 15 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

Optimizing practical orienteering problems with stochastic time-dependent travel times: towards congestion free routes

A fast solution method for the time-dependent orienteering problem

Contact Info

Product

Resources

About