Narrow search
Showing 1 - 8 of 8
Cover Image
A unified ant colony optimization algorithm for continuous optimization
Liao, Tianjun; Stützle, Thomas G.; Montes de Oca, Marco A. - In: European journal of operational research : EJOR 234 (2014) 3, pp. 597-609
Persistent link: https://www.econbiz.de/10010360502
Cover Image
A computational study on ant colony optimization for the traveling salesman problem with dynamic demands
Oliveira, Sabrina M. de; Bezerra, Leonardo C. T.; … - In: Computers & operations research : and their … 135 (2021), pp. 1-19
Persistent link: https://www.econbiz.de/10012649728
Cover Image
Automatically improving the anytime behaviour of optimisation algorithms
López-Ibáñez, Manuel; Stützle, Thomas G. - In: European journal of operational research : EJOR 235 (2014) 3, pp. 569-582
Persistent link: https://www.econbiz.de/10010341291
Cover Image
Revisiting simulated annealing : a component-based analysis
Franzin, Alberto; Stützle, Thomas G. - In: Computers & operations research : and their … 104 (2019), pp. 191-206
Persistent link: https://www.econbiz.de/10011991222
Cover Image
A landscape-based analysis of fixed temperature and simulated annealing
Franzin, Alberto; Stützle, Thomas G. - In: European journal of operational research : EJOR 304 (2023) 2, pp. 395-410
Persistent link: https://www.econbiz.de/10013534527
Cover Image
Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems with additional constraints
Pagnozzi, Federico; Stützle, Thomas G. - In: Operations Research Perspectives 8 (2021), pp. 1-17
Automatic design of stochastic local search algorithms has been shown to be very effective in generating algorithms for the permutation flowshop problem for the most studied objectives including makespan, flowtime and total tardiness. The automatic design system uses a configuration tool to...
Persistent link: https://www.econbiz.de/10012662830
Cover Image
Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems with additional constraints
Pagnozzi, Federico; Stützle, Thomas G. - In: Operations research perspectives 8 (2021), pp. 1-17
Automatic design of stochastic local search algorithms has been shown to be very effective in generating algorithms for the permutation flowshop problem for the most studied objectives including makespan, flowtime and total tardiness. The automatic design system uses a configuration tool to...
Persistent link: https://www.econbiz.de/10012435328
Cover Image
An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
Dubois-Lacoste, Jérémie; Pagnozzi, Federico; … - In: Computers & operations research : and their … 81 (2017), pp. 160-166
Persistent link: https://www.econbiz.de/10011656030