Hybrid simulated annealing and genetic approach for solving a multi-stage production planning with sequence-dependent setups in a closed-loop supply chain

被引:23
作者
Torkaman, S. [1 ]
Ghomi, S. M. T. Fatemi [1 ]
Karimi, B. [1 ]
机构
[1] Amirkabir Univ Technol, Dept Ind Engn, 424 Hafez Ave, Tehran 1591634311, Iran
关键词
Production planning; Closed-loop supply chain; Sequence-dependent setup; Rolling horizon; Hybrid simulated annealing algorithm; Flow shop; LOT-SIZING PROBLEM; MIP-BASED HEURISTICS; SCHEDULING PROBLEM; REMANUFACTURING OPTIONS; META-HEURISTICS; MODEL; DEMAND; OPTIMIZATION; SUBSTITUTION; ALGORITHM;
D O I
10.1016/j.asoc.2017.10.019
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper studies capacitated production planning problem with sequence-dependent setups in a closed-loop supply chain. A multi-stage, multi-period multi-product problem is considered and manufacturing and remanufacturing activities of each product are conducted consequently without additional setup. A mixed integer programming (MIP) model is provided to formulate the problem. In order to solve the model, MIP-based heuristics using rolling horizon are developed which contain non-permutation and permutation heuristics. Moreover, a hybrid simulated annealing (SA) algorithm is proposed in order to solve the problem using a genetic algorithm (GA) to prepare an appropriate initial solution. Taguchi method is used to adjust the parameters of the developed hybrid SA and GA. Finally, the efficiency of the hybrid algorithm versus MIP-based algorithms is demonstrated using computational results. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:1085 / 1104
页数:20
相关论文
共 53 条