Hierarchical route control in DCV-based baggage handling systems
by A.N. Tarau, B. De Schutter, J. Hellendoorn
International Journal of Services Operations and Informatics (IJSOI), Vol. 6, No. 1/2, 2011

Abstract: Modern baggage handling systems transport baggage at high speeds, on track networks, using Destination Coded Vehicles (DCV). To ensure optimal DCVs routing, we propose a hierarchical control framework that consists of local switch controllers providing switch position instructions and a supervisory network controller. The routing control problem for the network controller is a nonlinear optimisation problem with high computational requirements. Therefore, we present an alternative approach for reducing the computational complexity by approximating the nonlinear optimisation and rewriting it as a Mixed Integer Linear Programming (MILP) problem. The advantage is that for MILP problems solvers are available that can efficiently compute the global optimal solution. The MILP solution is then used for computing optimal switch control actions. For a benchmark case study we compare the hierarchical route control with previously developed switch control approaches. Results indicate that the proposed hierarchical control offers a balanced trade-off between optimality and computational effort.

Online publication date:: Sat, 07-Mar-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Services Operations and Informatics (IJSOI):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com