Home Energy Management Systems (HEMS) play a key role in the electrification of the residential sector. In a future where different energy carriers must be converted and used seamlessly, HEMS are responsible for orchestrating all energy assets within a home. To determine the power flows, the HEMS must be aware of its impact on the aging of the system's batteries. On the other hand, since this is typically performed through optimization models, various variables are needed, such as ambient temperature, solar radiation, and initial conditions. These inputs are uncertain and require proper forecasting. This paper presents the operation of an aging-aware HEMS using probabilistic forecasts of exogenous information, directly relating them to the quality of the degradation control. The relationship is studied under deterministic and stochastic optimal control settings.

This study examines the scheduling challenges faced by a real-world biomanufacturing site. This fermentation factory is a multi-product, multi-stage facility where batches are scheduled to meet customer demand. Importantly, in the production process of these batches, they are split and mixed into subbatches. Between stages, the intermediate product’s expiration should be avoided by maintaining a continuous flow without waiting in the factory, resulting in zero-wait policies. Sequence-dependent cleaning operations are also required between processing steps to avoid cross-contamination. Recent advances in constraint programming (CP) have demonstrated strong performance on standard scheduling problems. In this work, we investigate how effectively the biomanufacturing scheduling problems can be modeled with CP. Then, we investigate the performance of state-of-the-art CP solvers for solving real, large-scale biomanufacturing scheduling instances. Our empirical evaluation shows that CP Optimizer is more effective than Google OR Tools CP SAT. We show that a warm-start strategy based on domain knowledge improves the performance of the CP approach. Our empirical results show that relaxing the zero-wait constraints results in lower optimality gaps. Finally, we make our set of problem instances and CP model publicly available, thereby extending the scheduling literature with large-scale, realistic benchmarking instances obtained by our industrial collaboration.

Smart “predict, then optimize” (SPO) (Elmachtoub in Manag Sci 68(1): 9–26, 2022) is an end-to-end learning strategy for models that predict parameters in optimization problems. Unlike minimizing mean squared error (MSE) which cares about prediction accuracies, SPO aims to ensure that predictions lead to the best possible decisions. The associated loss function, termed SPO loss, measures the decision’s regret from optimal outcomes with parameter realizations. Existing literature has demonstrated the viability of SPO, however, these studies often focus on classical optimization problems and employ a limited set of models for benchmarking. In this study, we tackled a decision-making task inspired by real-world challenges across a wide range of neural network models. Unlike classical problems, our task requires a unique approach: collaboratively training two models to predict different variables. On top of that, one of the decision variables also affects the feasibility of the decisions, further increasing the complexity. While our implementation validates the benefits of SPO, we were surprised to find that models trained exclusively on SPO loss do not consistently attain the minimum regret. Our further investigation into hyperparameters illustrates that the well-tuned models learned very similar patterns from the feature set, irrespective of whether MSE or SPO loss was used. In other words, the change from MSE to SPO loss in training primarily affected the layer biases. Therefore, to improve the learning efficacy with SPO loss, we propose prioritizing learning feature patterns as the fundamental step. Possible strategies include using specialized neural network layers to capture deeper patterns more effectively or simply warming up by training with MSE. Specifically, a warming-up process is particularly advantageous for model(s) where the outputs are closely tied to constraints, as their prediction accuracy significantly impacts the decision feasibility. The insights are investigated empirically through two real-world trading scenarios. By leveraging datasets with diverse properties, we demonstrate the novelty and generalizability of our investigation.

The increasing train traffic over railway networks stretches the demand for capacity of railway yards and rolling stock maintenance locations, which increasingly limits performance and further growth. Therefore, the scheduling of rolling stock maintenance and the choice regarding optimal locations to perform maintenance is increasingly complicated. This research introduces a Maintenance Scheduling and Location Choice Problem (MSLCP). It simultaneously determines maintenance locations and maintenance schedules of rolling stock, while considering the available capacity of maintenance locations. Solving the MSLCP using one large Mixed Integer Programming appears not to perform well enough. Therefore, to solve the MSLCP, an optimization framework based on Logic-Based Benders’ Decomposition (LBBD) is proposed by combining two models, the Maintenance Location Choice Problem (MLCP) and the Activity Planning Problem (APP), to assess the capacity of an MLCP solution. Within the LBBD, four variants of cut generation procedures are introduced to improve the computational performance: a naive procedure, two heuristic procedures and the so-called min-cut procedure that aims to exploit the specific characteristics of the problem at hand. The framework is demonstrated on realistic scenarios from the Dutch railways. It is shown that the best choice for the cut generation procedure depends on the objective: when aiming to find a good but not necessarily optimal solution, the min-cut procedure performs best, whereas when aiming for the optimal solution, one of the heuristic procedures is the preferred option. The techniques used in the current research are new to the current field and offer interesting next research opportunities.

With a dense infrastructure and limited space, the opportunities for increasing the capacity of the railway network in the Netherlands are limited. One of the bottlenecks is optimally using the available space around stations and in shunting yards. Many details must be considered, increasing the complexity of the problem. Human planners can benefit from computational support to ensure efficient use of the infrastructure. We introduce a framework for positioning previous research in terms of abstractions and highlight a promising future direction: the development of a new approach that combines different methods and uses the relations between the abstractions to create more efficient solutions.

Future energy markets for low voltage AC and DC distribution systems will facilitate prosumer participation in the market. To comply with market regulations and grid constraints, a tailored market design reflecting (DC) operational requirements is needed. Our previous work identified a locational energy market design. However, its real-life implementation faces challenges due to uncertainties in system operation, prosumer preferences, and bidding strategies. This article tests the market design under uncertain scenarios. To this end, we develop an agent-based model that simulates typical electric vehicle user preferences and bidding strategies, influenced by varying degrees of range anxiety. The market design is tested in challenging scenarios with a high share of solar panels and electric vehicles, modelled using the high-resolution Pecan Street database. Simulations indicate that the proposed market design maintains both economic efficiency and system reliability under real-life uncertainties. This in turn indicates the practical feasibility of locational energy markets in helping to integrate renewable generation sources and bidirectional power flows.

When optimizing problems with uncertain parameter values in a linear objective, decision-focused learning enables end-to-end learning of these values. We are interested in a stochastic scheduling problem, in which processing times are uncertain, which brings uncertain values in the constraints, and thus repair of an initial schedule may be needed. Historical realizations of the stochastic processing times are available. We show how existing decision-focused learning techniques based on stochastic smoothing can be adapted to this scheduling problem. We include an extensive experimental evaluation to investigate in which situations decision-focused learning outperforms the state of the art, i.e., scenario-based stochastic optimization.

People want to rely on optimization algorithms for complex decisions but verifying the optimality of the solutions can then become a valid concern, particularly for critical decisions taken by non-experts in optimization. One example is the shortest-path problem on a network, occurring in many contexts from transportation to logistics to telecommunications. While the standard shortest-path problem is both solvable in polynomial time and certifiable by duality, introducing side constraints makes solving and certifying the solutions much harder. We propose a proof system for constrained shortest-path problems, which gives a set of logical rules to derive new facts about feasible solutions. The key trait of the proposed proof system is that it specifically includes high-level graph concepts within its reasoning steps (such as connectivity or path structure), in contrast to using linear combinations of model constraints. Using our proof system, we can provide a step-by-step, human-auditable explanation showing that the path given by an external solver cannot be improved. Additionally, to maximize the advantages of this setup, we propose a proof search procedure that specifically aims to find small proofs of this form using a procedure similar to A* search. We evaluate our proof system on constrained shortest path instances generated from real-world road networks and experimentally show that we may indeed derive more interpretable proofs compared to an integer programming approach, in some cases leading to much smaller proofs.

Multiple Object Tracking (MOT) is a rapidly developing research field that targets precise and reliable tracking of objects. Unfortunately, most available MOT datasets typically contain short video clips only, disregarding the indispensable requirement for adequately capturing substantial long-term variations in real-world scenarios. Long-term MOT poses unique challenges due to changes in both the objects and the environment, which remain relatively unexplored. To fill the gap, we propose a time-lapse image dataset inspired by the growth monitoring of strawberries, dubbed The Growing Strawberries Dataset (GSD). The data was captured hourly by six cameras, covering a span of 16 months in 2021 and 2022. During this time, it encompassed a total of 24 plants in two separate greenhouses. The changes in appearance, weight, and position during the ripening process, along with variations in the illumination during data collection, distinguish the task from previous MOT research. These practical issues resulted in a drastic performance downgrade in the track identification and association tasks of state-of-the-art MOT algorithms. We believe The Growing Strawberries will provide a platform for evaluating such long-term MOT tasks and inspire future research. The dataset is available at https://doi.org/10.4121/e3b31ece-cc88-4638-be10-8ccdd4c5f2f7.v1.

In reinforcement learning (RL), different reward functions can define the same optimal policy but result in drastically different learning performance. For some, the agent gets stuck with a suboptimal behavior, and for others, it solves the task efficiently. Choosing a good reward function is hence an extremely important yet challenging problem. In this paper, we explore an alternative approach for using rewards for learning. We introduce max-reward RL, where an agent optimizes the maximum rather than the cumulative reward. Unlike earlier works, our approach works for deterministic and stochastic environments and can be easily combined with state-of-the-art RL algorithms. In the experiments, we study the performance of max-reward RL algorithms in two goal-reaching environments from Gymnasium-Robotics and demonstrate its benefits over standard RL. The code is available at https://github.com/veviurko/To-the-Max.