We consider the problem of collecting and processing waste material. At a production facility, a known amount of inventory is required for production (e.g., paper) for every period. Instead of new material, the facility relies on collected and processed waste material (e.g., paper waste). This...

We study the problem of integrated pallet retrieval and successive processing in warehouses motivated by a practical company setting. A set of pallets has to be retrieved in a warehouse having a single stacker crane and multiple input/output-points, and the goal is to minimize the makespan....

In densely populated areas, ridepooling services are becoming more and more popular and can contribute to promote sustainable mobility concepts. In this paper, we study a dynamic dial-a-ride problem and propose a novel two-phase multiple plan approach. By maintaining multiple plans...

For some NP-hard lotsizing problems, many different heuristics exist, but they have different solution qualities and computation times depending on the characteristics of the instance. The computation times of the individual heuristics increase significantly with the problem size, so that...

To relieve congested city centers, cargo tunnels are a recently revitalized last-mile delivery concept that is currently evaluated in various capability studies in different parts of the world. Under the cargo tunnel concept, freight is lifted into a tunnel at an easy-to-access outskirt depot...

Our world is turbulent: ecological, social, political, technological, economic, and competitive business environments change constantly. Consumers have changing preferences, learn, build trust in brands, adopt new products, and are persuaded by advertising. Firms innovate and engage in and...

In this paper, we present a solution method for the multidimensional knapsack problem (MKP) and the knapsack problem with forfeit sets (KPFS) using a population-based matheuristic approach. Specifically, the learning mechanism of the fixed set search (FSS) metaheuristic is combined with the use...

In view of success stories of unicorn startups from the sharing and gig economy such as Airbnb, DiDi, or Uber, it is not surprising that postal service providers try to transfer the sharing idea toward their last-mile delivery services: owners of under-used assets (here private crowdshippers...

For many variants of vehicle routing and scheduling problems solved by a branch-price-and-cut (BPC) algorithm, the pricing subproblem is an elementary shortest-path problem with resource constraints (SPPRC) typically solved by a dynamic-programming labeling algorithm. Solving the SPPRC...

We combine nonparametric price response modeling and dynamic pricing. In particular, we model sales response for fast-moving consumer goods sold by a physical retailer using a Bayesian semiparametric approach and incorporate the price of the previous period as well as further time-dependent...