上海交通大学学报(自然版) ›› 2013, Vol. 47 ›› Issue (03): 472-478.

• 其他 • 上一篇    下一篇

整数编码的组群遗传算法在分组优化中的设计和应用

陈瑶1,2,霍佳震3   

  1. (1.上海对外贸易学院, 上海 201620; 2.上海交通大学 安泰经济与管理学院, 上海 200053;3.同济大学 经济与管理学院, 上海 200092)  
  • 收稿日期:2012-03-28 出版日期:2013-03-28 发布日期:2013-03-28
  • 基金资助:

    国家自然科学基金资助项目(71002038)

Number-Coded Grouping Genetic Algorithm for  Solving Grouping Problem: Design and Application

 CHEN  Yao-1, 2 , HUO  Jia-Zhen-3   

  1. (1.Shanghai Institute of Foreign Trade,  Shanghai 201620, China; 2.Antai College of Economics and Management, Shanghai Jiaotong University,  Shanghai 200053, China; 3.School of Economy and Management, Tongji University,  Shanghai 200092, China)
  • Received:2012-03-28 Online:2013-03-28 Published:2013-03-28

摘要: 摘要: 
在管理实践中广泛存在的分组优化问题大多是强NPHard问题,求解难度较大.针对制造企业供应物流决策中合并运输的分组优化问题,设计了基于整数编码的组群遗传算法.在简单直观的整数编码方式下,提出了两点组群杂交以及基于适应值的组群启发式变异等遗传算子,实现了面向组群的进化过程,为求解复杂的多约束、非线性的分组优化问题提供了新的方法.该算法应用于物流决策实践,与基于BSD的启发式算法相比较,检验了算法的性能和参数设置. 关键词: 
组群遗传算法; 分组问题; 供应物流; 运输合并; 联合补货
中图分类号:  F 253.4
文献标志码:  A

Abstract: Grouping problem exists widely in management, it is hard to solve because of its strong NP-Hard. This paper proposed number-coded grouping genetic algorithm, a new solution to supply logistics optimization problem with constraints and nonlinear objective function. Several grouping-based operators were designed to realize the grouping evolution, such as two-point grouping crossover and heuristic grouping mutation. It was applied to a real-world numerical case in transportation consolidation, which shows the performance of the algorithm.

Key words:  grouping genetic algorithm, grouping problem, supply logistics, transportation consolidation, joint replenishment