A meta-heuristic approach to car allocation problem to reduce transportation cost over a fixed number of routes Online publication date: Thu, 03-Dec-2009
by Prasun Das, Saddam Hossain, Abhijit Gupta
International Journal of Data Analysis Techniques and Strategies (IJDATS), Vol. 2, No. 1, 2010
Abstract: This study addresses the problem of car allocation to different routes under certain restrictions with the objective of reducing the excess cost of transportation. A meta-heuristic approach based on Ant Colony Optimisation (ACO) algorithm is proposed and implemented to schedule the cars efficiently along the routes under the existing logistics. A mathematical model with two objectives is formulated for this purpose and solved in two phases. In the first phase, sequences of allocated cars are determined while in the second, car allocation scheme for each trip is determined using ACO algorithm. The simulation study is carried out from the empirical distributions of distance and time, followed by the sensitivity analysis on the basis of their stochastic behaviour. The cost benefit analysis shows a projected savings in terms of reduction of cost of travel, both with respect to distance and time, through the solutions obtained.
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 Data Analysis Techniques and Strategies (IJDATS):
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