• CN:11-2187/TH
  • ISSN:0577-6686

›› 2011, Vol. 47 ›› Issue (20): 53-59.

• 论文 • 上一篇    下一篇

扫码分享

基于混合禁忌搜索算法的供应链排序问题

蒋大奎;李波   

  1. 天津大学管理与经济学部
  • 发布日期:2011-10-20

Supply Chain Scheduling Based on Hybrid Taboo Search Algorithm

JIANG Dakui;LI Bo   

  1. School of Management and Economics, Tianjin University
  • Published:2011-10-20

摘要: 分析非标准件加工企业供应链的特点,提出协同优化订单分配、生产调度和批量运输调度的多工厂多客户供应链排序问题。以工件的最长订货提前期与总成本加权之和最小化为目标,构建问题的数学模型。在分析解的最优性条件基础上,设计一种基于矢量组编码方法的混合禁忌搜索算法。算法对可行域进行分区,通过基于插入、交换两种邻域操作的禁忌搜索算法选择子区域,采用基于块结构邻域操作的禁忌搜索算法搜索子区域中的优良解。采用所提混合禁忌搜索算法对算例进行优化求解,并对采用不同编码方法、不同启发式算法的算例结果进行比较,结果表明所提出算法的有效性。

关键词: 多工厂, 供应链排序, 禁忌搜索, 批量运输

Abstract: The supply chain characteristic of manufacturers which produce non-standard parts is presented. To collaborate optimize order assignment, job shop schedule and batch delivery schedule, a supply chain scheduling problem with multiple plants and customers is applied. A mathematical model for the problem is first built to minimize a weighted sum of the maximum lead time and total cost. Moreover, based on the optimal condition analysis, its hybrid taboo search algorithm with vector array representation is designed. The hybrid algorithm systematically partitions the feasible region, applies taboo search algorithm with insert and swap neighborhood operations to select sub-region, and uses taboo search algorithm with block structure neighborhood operations to search the optimal solution of the selected sub-region. The hybrid algorithm is applied to optimize the example and the results by different solution structure and heuristic algorithms are compared. Results and analysis demonstrate the validity of the proposed model and its algorithm.

Key words: Batch delivery, Multiple plants, Supply chain scheduling, Taboo search

中图分类号: