【摘要】 提出了一种带服务优先级车辆路径问题的模型(Vehicle Routing Problem with Precedence Constraints,VRPPC),和一种扫描—禁忌搜索算法(sweep-Taboo Search Algorithm,S-TSA).然后,运用S-TSA对郑煤物资供销有限公司的带有服务优先级的危险物资配送进行优化求解,并与扫描遗传算法(sweep-Genetic Algorithm,SGA),禁忌搜索算法(Taboo Search Algorithm,TSA),人工鱼群算法(Artificial Fish Algorithm,AFA)进行比较研究,研究结果显示:扫描禁忌搜索算法能在满足服务优先级的前提下,使配送费用最少.更多还原

【Abstract】 This paper presents a model for Vehicle Routing Problem with Precedence Constraints and a Sweep-Taboo Search Algorithm(S-TSA) which can effectively solve the VRPPC problem.Secondly,the paper applies S-TSA to solve the distribution of dangerous materials of Zhengzhou Coal Electricity Group Company.It also compares S-TSA with Sweep-Genetic Algorithm(S-GA),Taboo Search Algorithm(TSA) and Artificial Fish algorithms(AFA).The results show that under the precondition of satisfied precedence constraints,S-TSA can get the least cost in overall distribution fees.更多还原