Reducing Complexity for Quantum Approaches in Train Load Optimization
Zhijie Tang, Albert Nieto-Morales, Arit Kumar Bishwas

TL;DR
This paper introduces a compact mathematical formulation for train load optimization that implicitly models rehandle costs, reducing model complexity and improving scalability in logistics planning.
Contribution
A novel formulation for train load optimization that eliminates explicit rehandle variables, significantly reducing model size and computational complexity.
Findings
The new model reduces the number of variables and constraints compared to conventional formulations.
The simulated annealing heuristic effectively finds high-quality loading plans using the new model.
Results demonstrate improved scalability and practical effectiveness in rail logistics planning.
Abstract
Efficiently planning container loads onto trains is a computationally challenging combinatorial optimization problem, central to logistics and supply chain management. A primary source of this complexity arises from the need to model and reduce rehandle operations-unproductive crane moves required to access blocked containers. Conventional mathematical formulations address this by introducing explicit binary variables and a web of logical constraints for each potential rehandle, resulting in large-scale models that are difficult to solve. This paper presents a fundamental departure from this paradigm. We introduce an innovative and compact mathematical formulation for the Train Load Optimization (TLO) problem where the rehandle cost is calculated implicitly within the objective function. This novel approach helps prevent the need for dedicated rehandle variables and their associated…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
