An MPC Scheme for Routing Problem in Baggage Handling Systems: A
Linear Programming Approach
Reference
Y. Zeinaly,
B. De Schutter, and
H. Hellendoorn,
"An MPC Scheme for Routing Problem in Baggage Handling Systems: A
Linear Programming Approach," Proceedings of the 10th
IEEE International Conference on Networking, Sensing and
Control, Paris, France, 6 pp., Apr. 2013. Paper ThB01.01.
Abstract
This paper considers the routing problem of DCVs in state-of-the-art
baggage handling systems. In previous work, this problem was
considered within the framework of model predictive control, where the
optimization problem was recast as a mixed integer linear programming
problem. We make two significant improvements with respect to this
previous work. We show that by choosing an alternative model, the
optimization problem can be recast as a linear programming problem,
which has significant computational advantages. Furthermore, we use a
new cost function that reflects the control objectives in a better
way. This leads to a computationally efficient routing controller.
Downloads
- Corresponding technical report:
pdf
file
(321 KB)
Bibtex entry
@inproceedings{ZeiDeS:13-011,
author={Y. Zeinaly and B. {D}e Schutter and H. Hellendoorn},
title={An {MPC} Scheme for Routing Problem in Baggage Handling Systems: {A}
Linear Programming Approach},
booktitle={Proceedings of the 10th IEEE International Conference on Networking,
Sensing and Control},
address={Paris, France},
month=apr,
year={2013},
note={Paper ThB01.01}
}
This page is maintained by Bart De Schutter.
Last update: February 21, 2026.