Greet Vanden Berghe

Orcid: 0000-0002-0275-5568

Affiliations:
  • Catholic University of Leuven, Department of Computer Science, Belgium


According to our database1, Greet Vanden Berghe authored at least 119 papers between 1998 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Operational Research: methods and applications.
J. Oper. Res. Soc., March, 2024

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

The constrained Bottleneck Spanning Tree Problem with upgrades.
Discret. Appl. Math., 2024

Robust personnel rostering: how accurate should absenteeism predictions be?
CoRR, 2024

Coarse-grained vs fine-grained optimisation in highly integrated problem environments: A case study featuring port terminal operations.
Comput. Ind. Eng., 2024

2023
Cargo securing under multi-drop and axle weight constraints.
Eur. J. Oper. Res., May, 2023

Models and algorithms for simple disjunctive temporal problems.
CoRR, 2023

2022
Advances in the practice and theory of automated timetabling.
J. Sched., 2022

Scheduling truck drivers with interdependent routes under European Union regulations.
Eur. J. Oper. Res., 2022

The vessel swap-body routing problem.
Eur. J. Oper. Res., 2022

Truck driver scheduling with interdependent routes and working time constraints.
EURO J. Transp. Logist., 2022

An Algorithm for Generating a Diverse Set of Multi-Modal Journeys.
Algorithms, 2022

2021
Quantifying and enforcing robustness in staff rostering.
J. Sched., 2021

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

Optimal decision trees for the algorithm selection problem: integer programming based approaches.
Int. Trans. Oper. Res., 2021

Achieving compromise solutions in nurse rostering by using automatically estimated acceptance thresholds.
Eur. J. Oper. Res., 2021

The tactical berth allocation problem with time-variant specific quay crane assignments.
Comput. Ind. Eng., 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

Efficient Duration-Based Workload Balancing for Interdependent Vehicle Routes.
Proceedings of the 21st Symposium on Algorithmic Approaches for Transportation Modelling, 2021

2020
Slack Induction by String Removals for Vehicle Routing Problems.
Transp. Sci., 2020

The extended roster quality staffing problem: addressing roster quality variation within a staffing planning period.
J. Sched., 2020

A periodic optimization approach to dynamic pickup and delivery problems with time windows.
J. Sched., 2020

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

Truck scheduling in tank terminals.
EURO J. Transp. Logist., 2020

2019
Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem.
Int. Trans. Oper. Res., 2019

The berth allocation problem in terminals with irregular layouts.
Eur. J. Oper. Res., 2019

Alternative e-commerce delivery policies.
EURO J. Transp. Logist., 2019

Compatibility of short and long term objectives for dynamic patient admission scheduling.
Comput. Oper. Res., 2019

The nurse rerostering problem: Strategies for reconstructing disrupted schedules.
Comput. Oper. Res., 2019

Crane-operated warehouses: Integrating location assignment and crane scheduling.
Comput. Ind. Eng., 2019

Strategic room type allocation for nursing wards through Markov chain modeling.
Artif. Intell. Medicine, 2019

The sport teams grouping problem.
Ann. Oper. Res., 2019

2018
Preface.
J. Sched., 2018

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

2017
Local and global constraint consistency in personnel rostering.
Int. Trans. Oper. Res., 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

Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation.
Comput. Oper. Res., 2017

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

Preface.
J. Sched., 2016

Good Laboratory Practice for optimization research.
J. Oper. Res. Soc., 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

Polynomially solvable personnel rostering problems.
Eur. J. Oper. Res., 2016

The lockmaster's problem.
Eur. J. Oper. Res., 2016

Measures of dynamism and urgency in logistics.
Eur. J. Oper. Res., 2016

Heuristic decomposition approaches for an integrated task scheduling and personnel rostering problem.
Comput. Oper. Res., 2016

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

A study of decision support models for online patient-to-room assignment planning.
Ann. Oper. Res., 2016

Simulation and optimization for ship lock scheduling: A case study.
Proceedings of the 7th International Conference on Information, 2016

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

An analysis of generalised heuristics for vehicle routing and personnel rostering problems.
J. Oper. Res. Soc., 2015

Balancing attainability, desirability and promotion steadiness in manpower planning systems.
J. Oper. Res. Soc., 2015

A Combinatorial Benders' decomposition for the lock scheduling problem.
Comput. Oper. Res., 2015

2014
School bus routing - a column generation approach.
Int. Trans. Oper. Res., 2014

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

Exact and heuristic methods for placing ships in locks.
Eur. J. Oper. Res., 2014

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

Modelling and evaluation issues in nurse rostering.
Ann. Oper. Res., 2014

Fast approximation of reach hierarchies in networks.
Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2014

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

Nurse Rostering: A Complex Example of Personnel Scheduling with Perspectives.
Proceedings of the Automated Scheduling and Planning - From Theory to Practice, 2013

The Multiconstraint Team Orienteering Problem with Multiple Time Windows.
Transp. Sci., 2013

A new hyper-heuristic as a general problem solver: an implementation in HyFlex.
J. Sched., 2013

An improved best-fit heuristic for the orthogonal strip packing problem.
Int. Trans. Oper. Res., 2013

A Time Predefined Variable Depth Search for Nurse Rostering.
INFORMS J. Comput., 2013

Cooperative search for fair nurse rosters.
Expert Syst. Appl., 2013

The roster quality staffing problem - A methodology for improving the roster quality by modifying the personnel structure.
Eur. J. Oper. Res., 2013

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

A tabu search approach to the truck scheduling problem with multiple docks and time windows.
Comput. Ind. Eng., 2013

An investigation on the generality level of selection hyper-heuristics under different empirical conditions.
Appl. Soft Comput., 2013

Tour Suggestion for Outdoor Activities.
Proceedings of the Web and Wireless Geographical Information Systems, 2013

An Efficient Translation Scheme for Representing Nurse Rostering Problems as Satisfiability Problems.
Proceedings of the ICAART 2013, 2013

2012
A hyperheuristic approach to examination timetabling problems: benchmarks and a new problem from practice.
J. Sched., 2012

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

One hyper-heuristic approach to two timetabling problems in health care.
J. Heuristics, 2012

Outlier detection in relational data: A case study in geographical information systems.
Expert Syst. Appl., 2012

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

A comparison of two approaches to nurse rostering problems.
Ann. Oper. Res., 2012

Towards a reference model for timetabling and rostering.
Ann. Oper. Res., 2012

Local search neighbourhoods for dealing with a novel nurse rostering model.
Ann. Oper. Res., 2012

The Effect of the Set of Low-Level Heuristics on the Performance of Selection Hyper-heuristics.
Proceedings of the Parallel Problem Solving from Nature - PPSN XII, 2012

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

An Intelligent Hyper-Heuristic Framework for CHeSC 2011.
Proceedings of the Learning and Intelligent Optimization - 6th International Conference, 2012

Evolutionary synthesis of multi-agent systems for dynamic dial-a-ride problems.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

2011
A categorisation of nurse rostering problems.
J. Sched., 2011

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

The City Trip Planner: An expert system for tourists.
Expert Syst. Appl., 2011

2010
A scatter search methodology for the nurse rostering problem.
J. Oper. Res. Soc., 2010

A shift sequence based approach for nurse scheduling and a new benchmark dataset.
J. Heuristics, 2010

A Path Relinking approach for the Team Orienteering Problem.
Comput. Oper. Res., 2010

A multi-objective approach for robust airline scheduling.
Comput. Oper. Res., 2010

A hybrid tabu search algorithm for automatically assigning patients to beds.
Artif. Intell. Medicine, 2010

Hyper-heuristics with a dynamic heuristic set for the home care scheduling problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 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

2009
MamMoeT: An intelligent agent-based communication support platform for multimodal transport.
Expert Syst. Appl., 2009

A guided local search metaheuristic for the team orienteering problem.
Eur. J. Oper. Res., 2009

A decomposed metaheuristic approach for a real-world university timetabling problem.
Eur. J. Oper. Res., 2009

Iterated local search for the team orienteering problem with time windows.
Comput. Oper. Res., 2009

A Mobile Tourist Decision Support System for Small Footprint Devices.
Proceedings of the Bio-Inspired Systems: Computational and Ambient Intelligence, 2009

2008
Automated Parameterisation of a Metaheuristic for the Orienteering Problem.
Proceedings of the Adaptive and Multilevel Metaheuristics, 2008

A Personalized Tourist Trip Design Algorithm for Mobile Tourist Guides.
Appl. Artif. Intell., 2008

2007
An Ant Based Hyper-heuristic for the Travelling Tournament Problem.
Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, 2007

2006
Designing trust with software agents: A case study.
J. Inf. Commun. Ethics Soc., 2006

Metaheuristics for Handling Time Interval Coverage Constraints in Nurse Scheduling.
Appl. Artif. Intell., 2006

2004
Novel Metaheuristic Approaches to Nurse Rostering Problems in Belgian Hospitals.
Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

The State of the Art of Nurse Rostering.
J. Sched., 2004

Semantic Components for Timetabling.
Proceedings of the Practice and Theory of Automated Timetabling V, 2004

2002
An advanced model and novel meta-heuristic solution methods to personnel scheduling in healthcare.
PhD thesis, 2002

Storing and Adapting Repair Experiences in Employee Rostering.
Proceedings of the Practice and Theory of Automated Timetabling IV, 2002

Relaxation of Coverage Constraints in Hospital Personnel Rostering.
Proceedings of the Practice and Theory of Automated Timetabling IV, 2002

A multi criteria meta-heuristic approach to nurse rostering.
Proceedings of the 2002 Congress on Evolutionary Computation, 2002

2001
A Memetic Approach to the Nurse Rostering Problem.
Appl. Intell., 2001

Fitness evaluation for nurse scheduling problems.
Proceedings of the 2001 Congress on Evolutionary Computation, 2001

Sympathetic agents assist route in route planning.
Proceedings of the Fifth International Conference on Autonomous Agents, 2001

1998
A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem.
Proceedings of the Simulated Evolution and Learning, 1998


  Loading...