# Predicting Tactical Solutions to Operational Planning Problems under Imperfect Information

arXiv: https://arxiv.org/abs/1807.11876 · HTML: https://mlsanity.com/paper/1807.11876/

## Key facts

- Cited by 11 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 31 Jul 2018.

## Built on by (most cited first, 11 of 11)

- [Pareto Set Learning for Neural Multi-objective Combinatorial Optimization](https://mlsanity.com/paper/2203.15386/) (2022)
- [Pareto Set Learning for Multi-Objective Reinforcement Learning](https://mlsanity.com/paper/2501.06773/) (2025)
- [Fast Continuous and Integer L-shaped Heuristics Through Supervised Learning](https://mlsanity.com/paper/2205.00897/) (2022)
- [Learning Optimal Solutions via an LSTM-Optimization Framework](https://mlsanity.com/paper/2207.02937/) (2022)
- [How to effectively use machine learning models to predict the solutions for optimization problems: lessons from loss function](https://mlsanity.com/paper/2105.06618/) (2021)
- [An Expandable Machine Learning-Optimization Framework to Sequential Decision-Making](https://mlsanity.com/paper/2311.06972/) (2023)
- [Robotic warehousing operations: a learn-then-optimize approach to large-scale neighborhood search](https://mlsanity.com/paper/2408.16890/) (2024)
- [Reinforcement Learning for Freight Booking Control Problems](https://mlsanity.com/paper/2102.00092/) (2021)
- [A prediction-based approach for online dynamic patient scheduling: a case study in radiotherapy treatment](https://mlsanity.com/paper/2112.08549/) (2021)
- [The intersection of machine learning with forecasting and optimisation: theory and applications](https://mlsanity.com/paper/2211.13583/) (2022)
- [A learning-based solution approach to the application placement problem in mobile edge computing under uncertainty](https://mlsanity.com/paper/2403.11259/) (2024)

## Abstract (arXiv)

This paper offers a methodological contribution at the intersection of machine learning and operations research. Namely, we propose a methodology to quickly predict expected tactical descriptions of operational solutions (TDOSs). The problem we address occurs in the context of two-stage stochastic programming where the second stage is demanding computationally. We aim to predict at a high speed the expected TDOS associated with the second stage problem, conditionally on the first stage variables. This may be used in support of the solution to the overall two-stage problem by avoiding the online generation of multiple second stage scenarios and solutions. We formulate the tactical prediction problem as a stochastic optimal prediction program, whose solution we approximate with supervised machine learning. The training dataset consists of a large number of deterministic operational problems generated by controlled probabilistic sampling. The labels are computed based on solutions to these problems (solved independently and offline), employing appropriate aggregation and subselection methods to address uncertainty. Results on our motivating application on load planning for rail transportation show that deep learning models produce accurate predictions in very short computing time (milliseconds or less). The predictive accuracy is close to the lower bounds calculated based on sample average approximation of the stochastic prediction programs.