Similar Search Results

Stochastic local search with learning automaton for the swap-body vehicle routing problem

Toffolo, Túlio A. M.; Christiaens, Jan; Van Malderen, Sam - In: Computers & operations research : and their … 89 (2018), pp. 68-81

Persistent link: https://www.econbiz.de/10011755104

A variable neighborhood search method for the orienteering problem with hotel selection

Divsalar, Ali; Vansteenwegen, Pieter; Cattrysse, Dirk G. - In: International journal of production economics 145 (2013) 1, pp. 150-160

Persistent link: https://www.econbiz.de/10009785306

A fast solution method for the time-dependent orienteering problem

Verbeeck, Cedric; Sörensen, Kenneth; Aghezzaf, El-Houssaine - In: European journal of operational research : EJOR 236 (2014) 2, pp. 419-432

Persistent link: https://www.econbiz.de/10010366182

Solving the stochastic time-dependent orienteering problem with time windows

Verbeeck, Cedric; Vansteenwegen, Pieter; Aghezzaf, … - In: European journal of operational research : EJOR 255 (2016) 3, pp. 699-718

Persistent link: https://www.econbiz.de/10011556125

A fast metaheuristic for the travelling salesperson problem with hotel selection

Castro, Marco; Sörensen, Kenneth; Vansteenwegen, Pieter; … - In: 4OR : a quarterly journal of operations research 13 (2015) 1, pp. 15-34

Persistent link: https://www.econbiz.de/10010504966

A metaheuristic solution approach for the time-constrained project scheduling problem

Verbeeck, Cédric; Van Peteghem, Vincent; Vanhoucke, Mario - In: OR spectrum : quantitative approaches in management 39 (2017) 2, pp. 353-371

Persistent link: https://www.econbiz.de/10011707112

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

Verbeeck, Cédric; Vansteenwegen, Pieter; Aghezzaf, … - 2017

Persistent link: https://www.econbiz.de/10011711786

A fast solution method for the time-dependent orienteering problem

Verbeeck, C.; Sörensen, K.; Aghezzaf, E.-H.; … - In: European Journal of Operational Research 236 (2014) 2, pp. 419-432

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...

Persistent link: https://www.econbiz.de/10011052536