Coordination of set-ups between two stages of a supply chain using multi-objective genetic algorithms

被引:14
|
作者
Mansouri, SA [1 ]
机构
[1] Amirkabir Univ Technol, Dept Ind Engn, Tehran 15914, Iran
关键词
set-up coordination; sequencing; supply chains; multi-objective genetic algorithms;
D O I
10.1080/00207540500103821
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
A multi-objective genetic algorithm (MOGA) solution approach for a sequencing problem to coordinate set-ups between two successive stages of a supply chain is presented in this paper. The production batches are processed according to the same sequence in both stages. Each production batch has two distinct attributes and a set-up occurs in the upstream stage every time the first attribute of the new batch is different from the previous one. In the downstream stage, there is a set-up when the second attribute of the new batch is different from that of the previous one. Two objectives need to be considered in sequencing the production batches including minimizing total set-ups and minimizing the maximum number of set-ups between the two stages. Both problems are NP-hard so attainment of an optimal solution for large problems is prohibited. The solution approach starts with an initialization stage followed by evolution of the initial solution set over generations. The MOGA makes use of non-dominated sorting and a niche mechanism to rank individuals in the population. Selected individuals taken from a given population form the succeeding generation using four genetic operators as: reproduction, crossover, mutation and inversion. Experiments in a number of test problems show that the MOGA is capable of finding Pareto-optimal solutions for small problems and near Pareto-optimal solutions for large instances in a short CPU time.
引用
收藏
页码:3163 / 3180
页数:18
相关论文
共 50 条
  • [1] Set-up coordination between two stages of a supply chain
    Agnetis, A
    Detti, P
    Meloni, C
    Pacciarelli, D
    ANNALS OF OPERATIONS RESEARCH, 2001, 107 (1-4) : 15 - 32
  • [2] Set-Up Coordination between Two Stages of a Supply Chain
    A. Agnetis
    P. Detti
    C. Meloni
    D. Pacciarelli
    Annals of Operations Research, 2001, 107 : 15 - 32
  • [3] Using genetic algorithms to solve the multi-product JIT sequencing problem with set-ups
    McMullen, PR
    Tarasewich, P
    Frazier, GV
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2000, 38 (12) : 2653 - 2670
  • [4] Horizontal inventory coordination in supply chain based on multi-objective genetic algorithm
    Pang, Hui
    Dong, Shaohua
    Zhang, Xinwei
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2019, 37 (04) : 4803 - 4810
  • [5] Optimization of a Hydrogen Supply Chain Network Design by Multi-Objective Genetic Algorithms
    Robles, Jesus Ochoa
    Almaraz, Sofia De-Leon
    Azzaro-Pantel, Catherine
    26TH EUROPEAN SYMPOSIUM ON COMPUTER AIDED PROCESS ENGINEERING (ESCAPE), PT A, 2016, 38A : 805 - 810
  • [6] Genetic algorithm for multi-objective two-echelon supply chain design
    Peng Yang
    Chen Zixia
    Proceedings of 2005 International Conference on Innovation & Management, 2005, : 747 - 751
  • [7] Modeling supply chain complexity using a distributed multi-objective genetic algorithm
    Al-Mutawah, Khalid
    Lee, Vincent
    Cheung, Yen
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2006, PT 1, 2006, 3980 : 586 - 595
  • [8] Setup coordination between two stages of a production system: A multi-objective evolutionary approach
    Meloni, Carlo
    Naso, David
    Turchiano, Biagio
    ANNALS OF OPERATIONS RESEARCH, 2006, 147 (01) : 175 - 198
  • [9] Setup coordination between two stages of a production system: A multi-objective evolutionary approach
    Carlo Meloni
    David Naso
    Biagio Turchiano
    Annals of Operations Research, 2006, 147 : 175 - 198
  • [10] A Generalized Circular Supply Chain Problem for Multi-objective Evolutionary Algorithms
    Benecke, Tobias
    Antons, Oliver
    Mostaghim, Sanaz
    Arlinghaus, Julia
    PROCEEDINGS OF THE 2023 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION, GECCO 2023 COMPANION, 2023, : 355 - 358