Ant colony optimisation for a resource-constrained shortest path problem with applications in multimodal transport Online publication date: Sat, 16-Aug-2014
by Xu Dong; Wenfeng Li; Lanbo Zheng
International Journal of Modelling, Identification and Control (IJMIC), Vol. 18, No. 3, 2013
Abstract: Multimodal transport provides great flexibility in freight logistics which on the other hand leads to a sophisticated decision problem when choosing shipping options. Advanced analysing and planning tools are desired in supporting the decision making so as to enable the power of multimodal transport. In this paper, features and evolving patterns of a generalised multimodal network derived from industrial applications are analysed. A corresponding routing problem is defined in order to optimise the transportation cost. This problem entails selections on transport modes and paths subject to various kinds of restrictions. We show that the routing problem is a resource constrained shortest path problem and therefore is NP-hard. An ant algorithm is then developed and tested with datasets simulating real scenarios. Experimental results prove the effectiveness of our approach.
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 Modelling, Identification and Control (IJMIC):
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