东北大学学报（自然科学版）

东北大学学报(自然科学版) ›› 2009, Vol. 30 ›› Issue (8): 1111-1114.DOI: -

• 论著 • 上一篇    下一篇

单级有资源约束的生产批量计划问题的元算法

韩毅;唐加福;王立岩;周根贵;   

  1. 东北大学流程工业综合自动化教育部重点实验室;浙江工业大学经贸管理学院;
  • 收稿日期:2013-06-22 修回日期:2013-06-22 出版日期:2009-08-15 发布日期:2013-06-22
  • 通讯作者: Zhou, G.-G.
  • 作者简介:-
  • 基金资助:
    国家创新群体科学基金资助项目(70721001);;

A memetic algorithm for single-level capacitated lot-sizing problems

Han, Yi (1); Tang, Jia-Fu (1); Wang, Li-Yan (1); Zhou, Gen-Gui (2)   

  1. (1) Key Laboratory of Integrated Automation of Process Industry Ministry of Education, Northeastern University, Shenyang 110004, China; (2) College of Business and Administration, Zhejiang University of Technology, Hangzhou 310023, China
  • Received:2013-06-22 Revised:2013-06-22 Online:2009-08-15 Published:2013-06-22
  • Contact: Zhou, G.-G.
  • About author:-
  • Supported by:
    -

RichHTML

1

PDF (PC)

685

摘要： 为了解决生产计划系统中单级多资源约束的生产批量计划问题,采用将遗传算法广度搜索能力和局部深度搜索能力相结合的元算法(memetic algorithm,MA),对资源约束型生产批量计划模型进行了求解,并采用能力调整法和罚函数法处理不可行解.在能力调整法的实施阶段,采用"先顺序,再逆序"的处理方式进行资源能力调整.给出了元算法的运行流程图,对元算法的计算性能进行了测试,并与现有文献中的若干实例进行了比较,验证了所提算法的可行性和适用性.

关键词: 离散制造, 制造资源计划, 有资源约束批量计划问题, 元算法

Abstract: A memetic algorithm (MA) is proposed combining GA's searching capability for breadth with that for depth so as to solve the multi-item single-level capacitated lot-sizing problems (CLSP) of the master production scheduling system, with the infeasible solutions to be dealt with the methods of capacity adjustment and penalty function. To eliminate overload, a "sequencing first, then reversing" strategy is used to adjust the capacity, i.e., checking if the overload occurs in the whole production process then reverse the process. The executive procedure of memetic algorithm is shown by a flowchart and its computation performance is tested and compared with other existing algorithms. Simulation results verified the feasibility and adaptability of the memetic algorithm proposed.

中图分类号: