Abstract
A new method for planning the routes of a fleet of carriers subject to a maximum load restriction is outlined. It is derived from a combination of the well-known savings heuristic rule and Monte Carlo simulation. Without increasing the level of complexity of the search routine beyond that already employed in savings based programs a marked reduction in total route length can be obtained. This is demonstrated with the aid of three much-considered problems, and for one of these, distances have been found that are below any previously recorded, even for those algorithms with the support of more elaborate logistics.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call