On solving the Capacitated Hub Routing Problem
by P.N. Ram Kumar, Appa Iyer Sivakumar
International Journal of Logistics Systems and Management (IJLSM), Vol. 8, No. 4, 2011

Abstract: We introduce the combinatorial optimisation problem of routing freight on a capacitated hub-and-spoke network known as the Capacitated Hub Routing Problem (CHRP). The hubs are limited in capacity for channelling flows between the nodes served by the system. A Mixed Integer Programming (MIP) model is proposed for the problem. With extensive computational results and design of experiments, it is proved that the hub capacity is the dominant factor that affects the total cost of transportation as well as the computational time required to solve a problem instance to optimality. A simple but effective heuristic is proposed for problem instances with unknown optimal solutions. The results obtained are encouraging.

Online publication date: Wed, 06-May-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 Logistics Systems and Management (IJLSM):
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