计算机科学 ›› 2012, Vol. 39 ›› Issue (Z11): 270-272.
• 数据库与数据挖掘 • 上一篇 下一篇
石星宏，张仲荣，王 博
出版日期:
发布日期:
Online:
Published:
摘要： 研究了带软时间窗的定位路径问题(LRPSTW)的改进粒子群算法((PSO)，在考虑了LRPSTW的整体性基础上，基于一阶段的求解思路设计了带交换子和交换序及贪婪变异算子的改进粒子群算法来求解LRPSTW问题，从而有效地提高了算法的求解效率和解质量。最后通过实验证明了算法的可行性和有效性。
关键词: 粒子群算法，交换子，交换序，变异，时间窗
Abstract: An improved particle swarm optimization(PSO) algorithm for location routing problem with soft time windows(LRPSTW) is researched. According to the character of LRPSTW based on a stage to the solution of design thinking with the operational rule for swap operator and swap sequence, the greed mutation operator is used in this proposed algorithm, so that the quality of the solution and the efficiency of the proposed algorithm are feasible and efficient.
Key words: Particle swarm optimization, Swap operator, Swap sectuence, Mutation, Time window
石星宏，张仲荣，王 博. 粒子群算法在LRP问题中的应用[J]. 计算机科学, 2012, 39(Z11): 270-272. https://doi.org/
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.jsjkx.com/CN/
https://www.jsjkx.com/CN/Y2012/V39/IZ11/270
Cited
首页