Advanced Search
MyIDEAS: Login

A meta-heuristic approach to car allocation problem to reduce transportation cost over a fixed number of routes

Contents:

Author Info

  • Prasun Das
  • Saddam Hossain
  • Abhijit Gupta
Registered author(s):

    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.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.inderscience.com/link.php?id=30013
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Inderscience Enterprises Ltd in its journal Int. J. of Data Analysis Techniques and Strategies.

    Volume (Year): 2 (2010)
    Issue (Month): 1 ()
    Pages: 85-102

    as in new window
    Handle: RePEc:ids:injdan:v:2:y:2010:i:1:p:85-102

    Contact details of provider:
    Web page: http://www.inderscience.com/browse/index.php?journalID=282

    Related research

    Keywords: routes; trips; ant colony optimisation; ACO; idle time; excess time; excess cost; sensitivity analysis; metaheuristics; car allocation; transport costs; scheduling; logistics; mathematical modelling.;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    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: (Graham Langley).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.