Noud Gademann
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Noud Gademann has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
Aart van Harten
University of Twente
2 shared publicationsMark Ebben
University of Twente
2 shared publicationsJeroen P. van Den Berg
Faculty of Mechanical Engineering , Production and Operations Management Group, University of Twente , P.O. Box 217, AE Enschede, 7500, The Netherlands
1 shared publication- Lotte van Hezewijk
Industrial Engineering & Innovation Sciences Eindhoven University of Technology P.O. Box 513 5600 MB Eindhoven The Netherlands
1 shared publication - Marco Schutten
University of Twente
1 shared publication Matthieu van der Heijden
University of Twente
1 shared publication
Latest Publications
- Open Access
- 7 April 2022
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 61 (6) , 1955-1978
Using the proximal policy optimisation algorithm for solving the stochastic capacitated lot sizing problem
This paper studies the multi-item stochastic capacitated lot-sizing problem with stationary demand to minimise set-up, holding, and backorder costs. This is a common problem in the industry, concerning both inventory management and production planning. We study the applicability of the Proximal Policy Optimisation (PPO) algorithm in this problem, which is a type of Deep Reinforcement Learning (DRL). The problem is modelled as a Markov Decision Process (MDP), which can be solved to optimality in small problem instances by using Dynamic Programming. In these settings, we show that the performance of PPO approaches the optimal solution. For larger problem instances with an increasing number of products, solving to optimality is intractable, and we demonstrate that the PPO solution outperforms the benchmark solution. Several adjustments to the standard PPO algorithm are implemented to make it more scalable to larger problem instances. We show the linear growth in computation time for the algorithm, and present a method for explaining the outcomes of the algorithm. We suggest future research directions that could improve the scalability and explainability of the PPO algorithm.
- 7 April 2022
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 61 (6) , 1955-1978
Open AccessUsing the proximal policy optimisation algorithm for solving the stochastic capacitated lot sizing problem
This paper studies the multi-item stochastic capacitated lot-sizing problem with stationary demand to minimise set-up, holding, and backorder costs. This is a common problem in the industry, concerning both inventory management and production planning. We study the applicability of the Proximal Policy Optimisation (PPO) algorithm in this problem, which is a type of Deep Reinforcement Learning (DRL). The problem is modelled as a Markov Decision Process (MDP), which can be solved to optimality in small problem instances by using Dynamic Programming. In these settings, we show that the performance of PPO approaches the optimal solution. For larger problem instances with an increasing number of products, solving to optimality is intractable, and we demonstrate that the PPO solution outperforms the benchmark solution. Several adjustments to the standard PPO algorithm are implemented to make it more scalable to larger problem instances. We show the linear growth in computation time for the algorithm, and present a method for explaining the outcomes of the algorithm. We suggest future research directions that could improve the scalability and explainability of the PPO algorithm.
- 1 February 2005
- Published by Taylor & Francis in IIE Transactions
- Vol. 37 (2) , 153-165
Linear-programming-based heuristics for project capacity planning
Many multi-project organizations are capacity driven, which means that their operations are constrained by various scarce resources. An important planning aspect in a capacity driven multi-project organization is capacity planning. By capacity planning, we mean the problem of matching demand for resources and availability of resources for the medium term. Capacity planning is a very useful method to support important tactical decisions such as due date quotation and price quotation for new projects, and to gain an insight into capacity requirements for the medium term. We present a capacity planning model in which aspects such as capacity flexibility, precedence relations between work packages, and maximum work content per period can be taken into account. For this model, we discuss several linear-programming-based heuristics. Using a large set of test instances, we compare these heuristics with some results from the literature. It turns out that some of these heuristics are very powerful for solving capacity planning problems.
- 1 February 2005
- Published by Taylor & Francis in IIE Transactions
- Vol. 37 (2) , 153-165
Linear-programming-based heuristics for project capacity planning
Many multi-project organizations are capacity driven, which means that their operations are constrained by various scarce resources. An important planning aspect in a capacity driven multi-project organization is capacity planning. By capacity planning, we mean the problem of matching demand for resources and availability of resources for the medium term. Capacity planning is a very useful method to support important tactical decisions such as due date quotation and price quotation for new projects, and to gain an insight into capacity requirements for the medium term. We present a capacity planning model in which aspects such as capacity flexibility, precedence relations between work packages, and maximum work content per period can be taken into account. For this model, we discuss several linear-programming-based heuristics. Using a large set of test instances, we compare these heuristics with some results from the literature. It turns out that some of these heuristics are very powerful for solving capacity planning problems.
- 1 January 2005
- Published by Springer Nature
- p. 259-286
Scheduling vehicles in automated transportation systems
- 1 January 2005
- Published by Springer Nature
- p. 259-286
Scheduling vehicles in automated transportation systems
- Top Cited Papers
- 1 January 2005
- Published by Taylor & Francis in IIE Transactions
- Vol. 37 (1) , 63-75
Order batching to minimize total travel time in a parallel-aisle warehouse
Although the picking of items may make up as much as 60% of all labor activities in a warehouse and may account for as much as 65% of all operating expenses, many order picking problems are still not well understood. Indeed, usually simple rules of thumb or straightforward constructive heuristics are used in practice, even in state-of-the-art warehouse management systems, however, it might well be that more attractive algorithmic alternatives could be developed. We address one such a fundamental materials handling problem: the batching of orders in a parallel-aisle warehouse so as to minimize the total traveling time needed to pick all items. Many heuristics have been proposed for this problem, however, a fundamental analysis of the problem is still lacking. In this paper, we first address the computational complexity of the problem. We prove that this problem is NP-hard in the strong sense but that it is solvable in polynomial time if no batch contains more than two orders. This result is not really surprising but it justifies the development of approximation and/or enumerative optimization algorithms for the general case. Our primary goal is to develop a branch-and-price optimization algorithm for the problem. To this end, we model the problem as a generalized set partitioning problem and present a column generation algorithm to solve its linear programming relaxation. Furthermore, we develop a new approximation algorithm for the problem. Finally, we test the performance of the branch-and-price algorithm and the approximation algorithm on a comprehensive set of instances. The computational experiments show the compelling performance of both algorithms.
- 1 January 2005
- Published by Taylor & Francis in IIE Transactions
- Vol. 37 (1) , 63-75
Top Cited PapersOrder batching to minimize total travel time in a parallel-aisle warehouse
Although the picking of items may make up as much as 60% of all labor activities in a warehouse and may account for as much as 65% of all operating expenses, many order picking problems are still not well understood. Indeed, usually simple rules of thumb or straightforward constructive heuristics are used in practice, even in state-of-the-art warehouse management systems, however, it might well be that more attractive algorithmic alternatives could be developed. We address one such a fundamental materials handling problem: the batching of orders in a parallel-aisle warehouse so as to minimize the total traveling time needed to pick all items. Many heuristics have been proposed for this problem, however, a fundamental analysis of the problem is still lacking. In this paper, we first address the computational complexity of the problem. We prove that this problem is NP-hard in the strong sense but that it is solvable in polynomial time if no batch contains more than two orders. This result is not really surprising but it justifies the development of approximation and/or enumerative optimization algorithms for the general case. Our primary goal is to develop a branch-and-price optimization algorithm for the problem. To this end, we model the problem as a generalized set partitioning problem and present a column generation algorithm to solve its linear programming relaxation. Furthermore, we develop a new approximation algorithm for the problem. Finally, we test the performance of the branch-and-price algorithm and the approximation algorithm on a comprehensive set of instances. The computational experiments show the compelling performance of both algorithms.
- 1 February 2002
- Published by Springer Nature in OR Spectrum
- Vol. 24 (1) , 31-58
Scheduling vehicles in automated transportation systems
- 1 February 2002
- Published by Springer Nature in OR Spectrum
- Vol. 24 (1) , 31-58
Scheduling vehicles in automated transportation systems
- 1 May 1999
- Published by Taylor & Francis in IIE Transactions
- Vol. 31 (5) , 407-415
Optimal routing in an automated storage/retrieval system with dedicated storage
We address the sequencing of requests in an automated storage/retrieval system with dedicated storage. We consider the block sequencing approach, where a set of storage and retrieval requests is given beforehand and no new requests come in during operation. The objective for this static problem is to find a route of minimal total travel time in which all storage and retrieval requests may be performed. The problem of sequencing a list of retrievals is equivalent to the Traveling Salesman Problem (TSP), and thus NP-hard in general. We show that the special case of sequencing under the dedicated storage policy can be solved in polynomial time. The results apply to systems with arbitrary positions of the input and output stations. Tlus generalizes the models in the literature, where only combined input/output stations are considered. Furthermore we identify a single command area in the rack. At the end we evaluate the model against heuristic procedures.
- 1 May 1999
- Published by Taylor & Francis in IIE Transactions
- Vol. 31 (5) , 407-415
Optimal routing in an automated storage/retrieval system with dedicated storage
We address the sequencing of requests in an automated storage/retrieval system with dedicated storage. We consider the block sequencing approach, where a set of storage and retrieval requests is given beforehand and no new requests come in during operation. The objective for this static problem is to find a route of minimal total travel time in which all storage and retrieval requests may be performed. The problem of sequencing a list of retrievals is equivalent to the Traveling Salesman Problem (TSP), and thus NP-hard in general. We show that the special case of sequencing under the dedicated storage policy can be solved in polynomial time. The results apply to systems with arbitrary positions of the input and output stations. Tlus generalizes the models in the literature, where only combined input/output stations are considered. Furthermore we identify a single command area in the rack. At the end we evaluate the model against heuristic procedures.
- 24 March 1995
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 58 (2) , 117-144
A random polynomial time algorithm for well-rounding convex bodies
- 24 March 1995
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 58 (2) , 117-144
A random polynomial time algorithm for well-rounding convex bodies