A meta-heuristic approach to car allocation problem to reduce transportation cost over a fixed number of routes
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
More about this item
Keywordsroutes; trips; ant colony optimisation; ACO; idle time; excess time; excess cost; sensitivity analysis; metaheuristics; car allocation; transport costs; scheduling; logistics; mathematical modelling.;
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=282 .
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.
We have no references for this item. You can help adding them by using 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 RePEc Author Service 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.