主页期刊介绍编委会编辑部服务介绍道德声明在线审稿编委办公编辑办公English
2018-2019年专刊出版计划 微信服务介绍 最新一期:2019年第10期
     
在线出版
各期目录
纸质出版
分辑系列
论文检索
论文排行
综述文章
专刊文章
美文分享
各期封面
E-mail Alerts
RSS
旧版入口
中国科学院软件研究所
  
投稿指南 问题解答 下载区 收费标准 在线投稿
苏生,战德臣,徐晓飞.基于扩展状态任务网的制造供应链计划.软件学报,2007,18(7):1626-1638
基于扩展状态任务网的制造供应链计划
Manufacturing Supply Chain Planning Based on Extended State Task Network
投稿时间:2006-06-09  修订日期:2006-09-27
DOI:
中文关键词:  制造供应链  计划  扩展状态任务网  路径重连
英文关键词:manufacturing supply chain  planning  extended state task network  path relinking
基金项目:Supported by the National High-Tech Research and Development Plan of China under Grant No.2003AA4Z3210 (国家高技术研究发展计划(863)); the Specialized Research Fund for the Doctoral Program of Higher Education of China under Grant No.20030213027 (高等学校博士学科点专项科研基金)
作者单位
苏生 哈尔滨工业大学,计算机科学与技术学院,企业智能计算研究中心,黑龙江,哈尔滨,150001 
战德臣 哈尔滨工业大学,计算机科学与技术学院,企业智能计算研究中心,黑龙江,哈尔滨,150001 
徐晓飞 哈尔滨工业大学,计算机科学与技术学院,企业智能计算研究中心,黑龙江,哈尔滨,150001 
摘要点击次数: 2629
全文下载次数: 3223
中文摘要:
      制造供应链计划是制造供应链管理的关键问题,它不仅需要分配生产任务和控制库存,还需要解决不同工厂(企业)间的运输配套问题.为统一描述具有复杂产品生产过程(包括装配型、分解型和多输入多输出型等)的生产任务、存储任务和不同模式(包括单种物料独立运输模式和多种物料组合运输模式)的运输任务,提出了扩展状态任务网(extended state task network,简称ESTN).扩展状态任务网用比例转化任务统一描述生产任务、存储任务和单种物料独立运输任务,用虚比例转化任务和组合移动任务共同描述多种物料组合运输任务.应用扩展状态任务网,meta启发式方法在求解制造供应链问题时更容易编码和操作.为求解基于ESTN的制造供应链计划模型,提出了具有多样性检测的参考解集更新策略与分散性解变异策略的路径重连算法.路径重连算法维护一个由高质量解(精英解)组成的参考解集,将一个向导精英解的属性逐步引入一个起始精英解而形成的中间解序列(路径),并用此中间解序列更新参考解集以获得进化.计算实例表明,该路径重连算法比标准遗传算法、标准Tabu搜索算法以及普通路径重连算法能够获得更好的解,证明了多样性检测对参考解集更新的关键作用以及分散性解变异策略在提高解的质量上的能力.
英文摘要:
      Manufacturing supply chain planning is a key factor of manufacturing supply chain management. Assignment of the production tasks, inventory control and transportation between the plants or the enterprises needs to be considered in manufacturing supply chain planning. Extended state task network (ESTN) is proposed in order to abstractly describe the production tasks with complex product production processes (assembly process, distilling process, process with many kinds of input material and many kinds of output material), the store tasks, and the transportation tasks with different modes (one mode is that transfering only one kind of material and another several kinds of material). In the extended state task network, proportion transform task is used to abstractly describe the production task, the store task and the transportation task that transfers only one kind of material. The combination of virtual proportion transform task and the combination move task are applied to describe the transportation task that transfers several kinds of material. It is easier to encode and operate the solution of the manufacturing supply chain planning if metaheuristic methods are used to solve the problem based on ESTN than on other models. A path relinking algorithm is developed to solve manufacturing supply chain planning model based on ESTN. The algorithm maintains a reference set of solution with good quality in evolutionary process. A list of the new solution (path) is created by inserting properties of a guide solution into an initiate solution. The list is used to update reference set in order to evolute the solution. The solution update method of the reference set with diversification detection and decentralization mutation strategy is proposed in the path relinking algorithm. The results of computations demonstrate that the path relinking algorithm can obtain better solutions than the standard genetic algorithm, the standard Tabu search procedure and the general path relinking algorithm, and prove that the solution update method of the reference set with diversification detection is very important to path relinking. Moreover, the decentralization mutation strategy can enhance the capacity of searching a better solution.
HTML  下载PDF全文  查看/发表评论  下载PDF阅读器
 

京公网安备 11040202500064号

主办单位:中国科学院软件研究所 中国计算机学会 京ICP备05046678号-4
编辑部电话:+86-10-62562563 E-mail: jos@iscas.ac.cn
Copyright 中国科学院软件研究所《软件学报》版权所有 All Rights Reserved
本刊全文数据库版权所有,未经许可,不得转载,本刊保留追究法律责任的权利