A meta-heuristic approach to car allocation problem to reduce transportation cost over a fixed number of routes
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.
Volume (Year): 2 (2010)
Issue (Month): 1 ()
|Contact details of provider:|| Web page: http://www.inderscience.com/browse/index.php?journalID=282|
When requesting a correction, please mention this item's handle: RePEc:ids:injdan:v:2:y:2010:i:1:p:85-102. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Darren Simpson)
If references are entirely missing, you can add them using this form.