Tony Wauters

Orcid: 0000-0002-1014-6340

According to our database1, Tony Wauters authored at least 36 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The exam location problem: Mathematical formulations and variants.
Comput. Oper. Res., January, 2024

2023
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems.
Comput. Oper. Res., 2023

2022
A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints.
Eur. J. Oper. Res., 2022

A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation.
Eur. J. Oper. Res., 2022

2021
Dispatch and conflict-free routing of capacitated vehicles with storage stack allocation.
J. Oper. Res. Soc., 2021

An automatic constructive matheuristic for the shift minimization personnel task scheduling problem.
J. Heuristics, 2021

A fast and scalable algorithm to solve nesting problems using a semi-discrete representation.
CoRR, 2021

Extracting maximal objects from three-dimensional solid materials.
Comput. Oper. Res., 2021

The impact of loading restrictions on the two-echelon location routing problem.
Comput. Ind. Eng., 2021

Neighborhood Enumeration in Local Search Metaheuristics.
Proceedings of the Optimization and Learning - 4th International Conference, 2021

A heuristic approach to feasibility verification for truck loading.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

2020
The prisoner transportation problem.
Eur. J. Oper. Res., 2020

Exploring search space trees using an adapted version of Monte Carlo tree search for a combinatorial optimization problem.
CoRR, 2020

A matheuristic framework for the Three-dimensional Single Large Object Placement Problem with practical constraints.
Comput. Oper. Res., 2020

2019
Heuristics for vehicle routing problems: Sequence or set optimization?
Comput. Oper. Res., 2019

Exact methods for three-dimensional cutting and packing: A comparative study concerning single container problems.
Comput. Oper. Res., 2019

2018
Stochastic local search with learning automaton for the swap-body vehicle routing problem.
Comput. Oper. Res., 2018

2017
A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem.
Eur. J. Oper. Res., 2017

Multi-machine energy-aware scheduling.
EURO J. Comput. Optim., 2017

MILP and Max-Clique based heuristics for the Eternity II puzzle.
CoRR, 2017

2016
The Multi-Mode Resource-Constrained Multi-Project Scheduling Problem - The MISTA 2013 challenge.
J. Sched., 2016

The one-dimensional cutting stock problem with sequence-dependent cut losses.
Int. Trans. Oper. Res., 2016

Branch-and-bound with decomposition-based lower bounds for the Traveling Umpire Problem.
Eur. J. Oper. Res., 2016

A decomposition approach to dual shuttle automated storage and retrieval systems.
Comput. Ind. Eng., 2016

Neighborhood Composition Strategies in Stochastic Local Search.
Proceedings of the Hybrid Metaheuristics - 10th International Workshop, 2016

2015
A learning-based optimization approach to multi-project scheduling.
J. Sched., 2015

2014
Decomposition and local search based methods for the traveling umpire problem.
Eur. J. Oper. Res., 2014

The concrete delivery problem.
Comput. Oper. Res., 2014

2013
Boosting Metaheuristic Search Using Reinforcement Learning.
Proceedings of the Hybrid Metaheuristics, 2013

A Guide-and-Observe Hyper-Heuristic Approach to the Eternity II Puzzle.
J. Math. Model. Algorithms, 2013

An effective shaking procedure for 2D and 3D strip packing problems.
Comput. Oper. Res., 2013

2012
Reinforcement Learning Enhanced Heuristic Search for CombinatorialOptimizationReinforcement Learning Enhanced Heuristic Search for CombinatorialOptimization (Reinforcement Learning gebaseerde heuristieken voorcombinatorische optimalisatie).
PhD thesis, 2012

Real-world production scheduling for the food industry: An integrated approach.
Eng. Appl. Artif. Intell., 2012

Fast Permutation Learning.
Proceedings of the Learning and Intelligent Optimization - 6th International Conference, 2012

2011
Learning agents for the multi-mode project scheduling problem.
J. Oper. Res. Soc., 2011

2010
A game theoretic approach to decentralized multi-project scheduling.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010


  Loading...