Denise D. Tönissen

Denise D. Tönissen

Auto-generated profile, based on publicly available information

Denise D. Tönissen

Department of Operations Analytics, School of Business and Economics, Vrije Universiteit Amsterdam, De Boelelaan 1105, 1081 HV, Amsterdam, The Netherlands

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2019 in Transportation Science
Verified
Journal Article
Open access
DTDenise D. Tönissen
Denise D. Tönissen
JAJoachim J. Arts
Joachim J. Arts
ZSZuo-jun Max Shen
Zuo-jun Max Shen
Rolling stock needs regular maintenance in a maintenance facility. Rolling stock from different fleets are routed to maintenance facilities by interchanging the destinations of trains at common stations and by using empty drives. We consider the problem of locating maintenance facilities in a railway network under uncertain or changing line planning, fleet planning, and other uncertain factors. These uncertainties and changes are modeled by a discrete set of scenarios. We show that this new problem is NP-hard and provide a two-stage stochastic programming and a two-stage robust optimization formulation. The second-stage decision is a maintenance routing problem with similarity to a minimum cost-flow problem. We prove that the facility location decisions remain unchanged under a simplified routing problem, and this gives rise to an efficient mixed-integer programming (MIP) formulation. This result also allows us to find an efficient decomposition algorithm for the robust formulation based on scenario addition (SA). Computational work shows that our improved MIP formulation can efficiently solve instances of industrial size. SA improves the computational time for the robust formulation even further and can handle larger instances due to more efficient memory usage. Finally, we apply our algorithms on practical instances of the Netherlands Railways and give managerial insights.

1 November 2018 in Transportation Research Part B: Methodological
Verified
Journal Article
Open access
DTD.D. Tönissen
D.D. Tönissen
JAJ.J. Arts
J.J. Arts

16 February 2021 in TOP
Verified
Journal Article
Open access
PDF file
DTDenise D. Tönissen
Denise D. Tönissen
JAJoachim J. Arts
Joachim J. Arts
ZSZuo-jun Max Shen
Zuo-jun Max Shen
This paper presents a column-and-constraint generation algorithm for two-stage stochastic programming problems. A distinctive feature of the algorithm is that it does not assume fixed recourse and as a consequence the values and dimensions of the recourse matrix can be uncertain. The proposed algorithm contains multi-cut (partial) Benders decomposition and the deterministic equivalent model as special cases and can be used to trade-off computational speed and memory requirements. The algorithm outperforms multi-cut (partial) Benders decomposition in computational time and the deterministic equivalent model in memory requirements for a maintenance location routing problem. In addition, for instances with a large number of scenarios, the algorithm outperforms the deterministic equivalent model in both computational time and memory requirements. Furthermore, we present an adaptive relative tolerance for instances for which the solution time of the master problem is the bottleneck and the slave problems can be solved relatively efficiently. The adaptive relative tolerance is large in early iterations and converges to zero for the final iteration(s) of the algorithm. The combination of this relative adaptive tolerance with the proposed algorithm decreases the computational time of our instances even further.

1 December 2020 in International Journal of Production Economics
Verified
Journal Article
Closed access
DTD.D. Tönissen
D.D. Tönissen
JAJ.J. Arts
J.J. Arts

1 July 2017 in Computers & Operations Research
Verified
Journal Article
Closed access
DTD.D. Tönissen
D.D. Tönissen
MAMarjan van den Akker
Marjan van den Akker
JHJ.A. Hoogeveen
J.A. Hoogeveen

30 April 2021 in Computers & Operations Research
Verified
Journal Article
Open access
DTDenise D. Tönissen
Denise D. Tönissen
LSLoe Schlicher
Loe Schlicher
In this paper, we will shed light on when to pack and use 3D-printers in disaster response operations. For that, we introduce a new type of problem, which we call the two-stage stochastic 3D-printing knapsack problem. We provide a two-stage stochastic programming formulation for this problem, for which both the first and the second stage are NP-hard integer linear programs. We reformulate this formulation to an equivalent integer linear program, which can be efficiently solved by standard solvers. Our numerical results illustrate that for most situations using a 3D-printer is beneficial. Only in extreme circumstances, where the quality of printed items is extremely low, the size of the 3D-printer is extremely large compared to the knapsack size, when there is no time to print the items, or when demand for items is low, packing no 3D-printers is the best option.