Using 3D-printing in disaster response: The two-stage stochastic 3D-printing knapsack problem

04/18/2020
by   Denise D. Tönissen, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/10/2012

Comparing several heuristics for a packing problem

Packing problems are in general NP-hard, even for simple cases. Since no...
research
05/20/2022

Neur2SP: Neural Two-Stage Stochastic Programming

Stochastic programming is a powerful modeling framework for decision-mak...
research
05/02/2022

Fast Continuous and Integer L-shaped Heuristics Through Supervised Learning

We propose a methodology at the nexus of operations research and machine...
research
11/30/2018

Binary Decision Diagrams for Bin Packing with Minimum Color Fragmentation

Bin Packing with Minimum Color Fragmentation (BPMCF) is an extension of ...
research
12/17/2019

A learning-based algorithm to quickly compute good primal solutions for Stochastic Integer Programs

We propose a novel approach using supervised learning to obtain near-opt...
research
08/29/2020

The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs

We consider fundamental algorithmic number theoretic problems and their ...
research
09/26/2021

Preemptive Two-stage Goal-Programming Formulation of a Strict Version of the Unbounded Knapsack Problem with Bounded Weights

The unbounded knapsack problem with bounded weights is a variant of the ...

Please sign up or login with your details

Forgot password? Click here to reset