Simulated annealing-based algorithm for the capacitated hub routing problem Online publication date: Fri, 30-Aug-2013
by P.N. Ram Kumar; Appa Iyer Sivakumar
International Journal of Services and Operations Management (IJSOM), Vol. 14, No. 2, 2013
Abstract: Routing traffic across a capacitated hub-and-spoke network is very common in freight transportation and telecommunications. Most of the hub-and-spoke network models available in the literature assume a fully inter-connected hub network and allow traffic to pass through a maximum of two hubs. In the absence of a fully inter-connected hub network, the traffic may have to be routed through more than two hubs. In this paper, we develop a mathematical model and a simulated annealing (SA)-based solution methodology for routing freight through not more than three hubs in a given capacitated network. We generate test problem instances to evaluate the efficacy of the mathematical model and the meta-heuristic procedure. The effect of each network parameter on the performance of the SA procedure is analysed thoroughly with extensive computational experiments and relevant statistical tests. The results show that near-optimal solutions for large problem instances can be derived in little computational time.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 and Operations Management (IJSOM):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook