基于并行模拟退火算法的VRP问题研究  

Study on Vehicle Routing Problem Based on Parallel Simulated Annealing Algorithm

作　　者：谢红燕[1] 

机构地区：[1]哈尔滨商业大学管理学院,黑龙江哈尔滨150076

出　　处：《物流技术》2010年第15期67-69,共3页Logistics Technology

摘　　要：针对VRP问题构建相应的数学模型,在传统的模拟退火算法的基础上提出一种基于记忆功能的并行模拟退火算法求解VRP模型,并用模拟数据对模型和算法进行了验证。实验结果表明,改进的模拟退火算法求解VRP问题,不仅可以取得很好的计算结果,而且算法的计算效率较高,收敛速度较快,计算结果也较稳定,显示了良好的寻优性能。The paper improves on the traditional simulated annealing algorithm and proposes a parallel simulated annealing algorithm based on memory to the solution of the VRP model and uses simulated data to the verification of the model and algorithm, with results showing that the improved algorithm, besides being capable of yielding satisfactory results, is also superior in computational efficiency, convergence rate, robustness, and capacity of optimization.

关 键 词：VRP 模拟退火算法 并行 多线程 

分 类 号：F224.0[经济管理—国民经济]