摘要
针对市区集送货问题,提出随机合理化禁忌算法进行求解。介绍了备选方案的随机合理化动态衍生方法,详细阐述基于均衡原理和代价最小原理的双特赦准则以及自适应的禁忌长度选取策略。计算实例表明,随机合理化禁忌算法能提高集送货问题求解的精度和效率。
A Random Reasonable Tabu Search Algorithm was proposed to resolve the urban pickup and delivery problem.The random and reasonable dynamic regeneration methods for possible routes were introduced separately.The two kinds of aspiration criteria based on equilibrium principle and minimum costs were explained,and the adaptive Tabu length selection strategy was described.Calculation results show that the Random Reasonable Tabu Search Algorithm could improve both the precision and efficiency of the urban pickup and delivery problem.
出处
《系统仿真学报》
CAS
CSCD
北大核心
2010年第7期1688-1692,共5页
Journal of System Simulation
基金
北京市科委科技奥运专项基金(H030630020520)
关键词
集送货
路线优化
随机合理化禁忌搜索
自适应动态衍生
pickup and delivery
route optimization
Random Reasonable Tabu Search
adaptive regeneration
