Tony Wauters

Tony Wauters

Katholieke Universiteit Leuven

H-index: 18

Europe-Belgium

About Tony Wauters

Tony Wauters, With an exceptional h-index of 18 and a recent h-index of 15 (since 2020), a distinguished researcher at Katholieke Universiteit Leuven, specializes in the field of Operational research, hybrid heuristics, combinatorial optimization, scheduling, cutting and packing.

His recent articles reflect a diverse array of research interests and contributions to the field:

Instance space analysis for 2D bin packing mathematical models

The exam location problem: Mathematical formulations and variants

Monte Carlo Tree Search and Instance Space Analysis for the 0-1 Knapsack Problem

Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems

Instances for the Exam Location Problem

A constructive matheuristic approach for the vertex colouring problem

A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints

A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation

Tony Wauters Information

University

Position

Department of Computer Science CODeS

Citations(all)

1188

Citations(since 2020)

765

Cited By

705

hIndex(all)

18

hIndex(since 2020)

15

i10Index(all)

25

i10Index(since 2020)

19

Email

University Profile Page

Katholieke Universiteit Leuven

Google Scholar

View Google Scholar Profile

Tony Wauters Skills & Research Interests

Operational research

hybrid heuristics

combinatorial optimization

scheduling

cutting and packing

Top articles of Tony Wauters

Title

Journal

Author(s)

Publication Date

Instance space analysis for 2D bin packing mathematical models

European Journal of Operational Research

Chang Liu

Kate Smith-Miles

Tony Wauters

Alysson M Costa

2024/6/1

The exam location problem: Mathematical formulations and variants

Computers & Operations Research

Hatice Çalık

Tony Wauters

Greet Vanden Berghe

2024/1/1

Monte Carlo Tree Search and Instance Space Analysis for the 0-1 Knapsack Problem

Jorik Jooken

Patrick De Causmaecker

Pieter Leyman

Jan Goedgebeur

Tony Wauters

2023/6/12

Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems

Computers & Operations Research

Jorik Jooken

Pieter Leyman

Tony Wauters

Patrick De Causmaecker

2023/2/1

Instances for the Exam Location Problem

Hatice Çalik

Tony Wauters

Greet Vanden Berghe

2023

A constructive matheuristic approach for the vertex colouring problem

Reshma Chirayil Chandrasekharan

Tony Wauters

2022

A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints

European Journal of Operational Research

Jeroen Gardeyn

Tony Wauters

2022/9/1

A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation

European Journal of Operational Research

Sahar Chehrazad

Dirk Roose

Tony Wauters

2022/8/1

Integrated Yard Management Optimisation

Emmanouil Thanos

2022/1/27

A Parallel Bucket-Based Bottom-Left-Fill Algorithm for Nesting Problems Using a Semi-Discrete Representation

Sahar Chehrazad

Dirk Roose

Tony Wauters

2022

Neighborhood Enumeration in Local Search Metaheuristics

Michiel Van Lancker

Greet Vanden Berghe

Tony Wauters

2021/6/23

An automatic constructive matheuristic for the shift minimization personnel task scheduling problem

Journal of Heuristics

Reshma Chirayil Chandrasekharan

Pieter Smet

Tony Wauters

2021/4

The impact of loading restrictions on the two-echelon location routing problem

Computers & Industrial Engineering

Vinícius Martins Santos Gandra

Hatice Çalık

Tony Wauters

Túlio AM Toffolo

Marco Antonio M Carvalho

...

2021/10/1

Constructive matheuristics for combinatorial optimization problems

Reshma Chirayil Chandrasekharan

2021/3/9

Dispatch and conflict-free routing of capacitated vehicles with storage stack allocation

Journal of the Operational Research Society

Emmanouil Thanos

Tony Wauters

Greet Vanden Berghe

2021/8/3

Multithreaded incremental solving for local search based metaheuristics with step chasing

Geoffrey De Smet

Tony Wauters

2021

Extracting maximal objects from three-dimensional solid materials

Computers & Operations Research

Everton Fernandes Silva

Hatice Calık

Wim Vancroonenburg

Aline Aparecida Souza Leao

Tony Wauters

2021/8/1

A heuristic approach to feasibility verification for truck loading

Vinicius Gandra

Hatice Çalik

Tony Wauters

Greet Vanden Berghe

2021/7/7

The prisoner transportation problem

European Journal of Operational Research

Jan Christiaens

Hatice Çalık

Tony Wauters

Reshma Chirayil Chandrasekharan

Greet Vanden Berghe

2020/1/17

Algorithms for solving 3D cutting and packing problems with real-world constraints

Everton Fernandes da Silva

2020/6/11

See List of Professors in Tony Wauters University(Katholieke Universiteit Leuven)

Co-Authors

H-index: 49
Greet Vanden Berghe

Greet Vanden Berghe

Katholieke Universiteit Leuven

H-index: 44
Patrick De Causmaecker

Patrick De Causmaecker

Katholieke Universiteit Leuven

H-index: 33
Jeroen Belien

Jeroen Belien

Katholieke Universiteit Leuven

H-index: 17
Pieter Smet

Pieter Smet

Katholieke Universiteit Leuven

H-index: 14
Joris Kinable

Joris Kinable

Carnegie Mellon University

H-index: 10
Hatice Çalık

Hatice Çalık

Katholieke Universiteit Leuven

academic-engine