The Vehicle Scheduling Problem and Monte Carlo Simulation
作者:
BuxeyG. M.,
期刊:
Journal of the Operational Research Society
(Taylor Available online 1979)
卷期:
Volume 30,
issue 6
页码: 563-573
ISSN:0160-5682
年代: 1979
DOI:10.1057/jors.1979.138
出版商: Taylor&Francis
数据来源: Taylor
摘要:
AbstractA 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.
点击下载:
PDF (4935KB)
返 回