Skip to main content
Erschienen in: Neural Computing and Applications 1/2018

16.11.2016 | Original Article

A hybrid differential evolution algorithm with estimation of distribution algorithm for reentrant hybrid flow shop scheduling problem

verfasst von: Bing-hai Zhou, Li-man Hu, Zhen-yi Zhong

Erschienen in: Neural Computing and Applications | Ausgabe 1/2018

Einloggen

Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

This paper proposes a reentrant hybrid flow shop scheduling problem where inspection and repair operations are carried out as soon as a layer has completed fabrication. Firstly, a scheduling problem domain of reentrant hybrid flow shop is described, and then, a mathematical programming model is constructed with an objective of minimizing total weighted completion time. Then, a hybrid differential evolution (DE) algorithm with estimation of distribution algorithm using an ensemble model (eEDA), named DE–eEDA, is proposed to solve the problem. DE–eEDA incorporates the global statistical information collected from an ensemble probability model into DE. Finally, simulation experiments of different problem scales are carried out to analyze the proposed algorithm. Results indicate that the proposed algorithm can obtain satisfactory solutions within a short time.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Anhänge
Nur mit Berechtigung zugänglich
Literatur
1.
Zurück zum Zitat Hekmatfar M, Ghomi SMTF, Karimi B (2011) Two stage reentrant hybrid flow shop with setup times and the criterion of minimizing makespan. Appl Soft Comput 11(8):4530–4539CrossRef Hekmatfar M, Ghomi SMTF, Karimi B (2011) Two stage reentrant hybrid flow shop with setup times and the criterion of minimizing makespan. Appl Soft Comput 11(8):4530–4539CrossRef
2.
Zurück zum Zitat Choi SW, Kim YD, Lee GC (2005) Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop. Int J Prod Res 43(11):2149–2167CrossRefMATH Choi SW, Kim YD, Lee GC (2005) Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop. Int J Prod Res 43(11):2149–2167CrossRefMATH
3.
Zurück zum Zitat Jiang S, Tang L (2008) Lagrangian relaxation algorithms for re-entrant hybrid flowshop scheduling. In: 2008 IEEE international conference on information management, innovation management and industrial engineering, vol 1. IEEE, Taipei, pp 78–81 Jiang S, Tang L (2008) Lagrangian relaxation algorithms for re-entrant hybrid flowshop scheduling. In: 2008 IEEE international conference on information management, innovation management and industrial engineering, vol 1. IEEE, Taipei, pp 78–81
4.
Zurück zum Zitat Cho HM, Bae SJ, Kim J et al (2011) Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm. Comput Ind Eng 61(3):529–541CrossRef Cho HM, Bae SJ, Kim J et al (2011) Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm. Comput Ind Eng 61(3):529–541CrossRef
5.
Zurück zum Zitat Choi HS, Kim JS, Lee DH (2011) Real-time scheduling for reentrant hybrid flow shops: a decision tree based mechanism and its application to a TFT-LCD line. Expert Syst Appl 38(4):3514–3521CrossRef Choi HS, Kim JS, Lee DH (2011) Real-time scheduling for reentrant hybrid flow shops: a decision tree based mechanism and its application to a TFT-LCD line. Expert Syst Appl 38(4):3514–3521CrossRef
6.
Zurück zum Zitat Dugardin F, Amodeo L, Yalaoui F (2009) Multiobjective scheduling of a reentrant hybrid flowshop. In: 2009 IEEE international conference on computers & industrial engineering. IEEE, Troyes, pp 193–195 Dugardin F, Amodeo L, Yalaoui F (2009) Multiobjective scheduling of a reentrant hybrid flowshop. In: 2009 IEEE international conference on computers & industrial engineering. IEEE, Troyes, pp 193–195
7.
Zurück zum Zitat Dugardin F, Yalaoui F, Amodeo L (2010) New multi-objective method to solve reentrant hybrid flow shop scheduling problem. Eur J Oper Res 203(1):22–31MathSciNetCrossRefMATH Dugardin F, Yalaoui F, Amodeo L (2010) New multi-objective method to solve reentrant hybrid flow shop scheduling problem. Eur J Oper Res 203(1):22–31MathSciNetCrossRefMATH
8.
Zurück zum Zitat Yalaoui N, Amodeo L, Yalaoui F, et al (2010) Particle swarm optimization under fuzzy logic controller for solving a hybrid Reentrant Flow Shop problem. In: 2010 IEEE international symposium on parallel and distributed processing, workshops and Phd forum. IEEE, Atlanta, pp 1–6 Yalaoui N, Amodeo L, Yalaoui F, et al (2010) Particle swarm optimization under fuzzy logic controller for solving a hybrid Reentrant Flow Shop problem. In: 2010 IEEE international symposium on parallel and distributed processing, workshops and Phd forum. IEEE, Atlanta, pp 1–6
9.
Zurück zum Zitat Rau H, Cho KH (2009) Genetic algorithm modeling for the inspection allocation in reentrant production systems. Expert Syst Appl 36(8):11287–11295CrossRef Rau H, Cho KH (2009) Genetic algorithm modeling for the inspection allocation in reentrant production systems. Expert Syst Appl 36(8):11287–11295CrossRef
10.
Zurück zum Zitat Storn R, Price K (1997) Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341–359MathSciNetCrossRefMATH Storn R, Price K (1997) Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341–359MathSciNetCrossRefMATH
11.
Zurück zum Zitat Ilonen J, Kamarainen JK, Lampinen J (2003) Differential evolution training algorithm for feed-forward neural networks. Neural Process Lett 17(1):93–105CrossRef Ilonen J, Kamarainen JK, Lampinen J (2003) Differential evolution training algorithm for feed-forward neural networks. Neural Process Lett 17(1):93–105CrossRef
12.
Zurück zum Zitat Liu J, Lampinen J (2005) A fuzzy adaptive differential evolution algorithm. Soft Comput 9(6):448–462CrossRefMATH Liu J, Lampinen J (2005) A fuzzy adaptive differential evolution algorithm. Soft Comput 9(6):448–462CrossRefMATH
13.
Zurück zum Zitat Wang H, Wu Z, Rahnamayan S (2011) Enhanced opposition-based differential evolution for solving high-dimensional continuous optimization problems. Soft Comput 15(11):2127–2140CrossRef Wang H, Wu Z, Rahnamayan S (2011) Enhanced opposition-based differential evolution for solving high-dimensional continuous optimization problems. Soft Comput 15(11):2127–2140CrossRef
14.
Zurück zum Zitat Pan QK, Suganthan PN, Wang L et al (2011) A differential evolution algorithm with self-adapting strategy and control parameters. Comput Oper Res 38(1):394–408MathSciNetCrossRefMATH Pan QK, Suganthan PN, Wang L et al (2011) A differential evolution algorithm with self-adapting strategy and control parameters. Comput Oper Res 38(1):394–408MathSciNetCrossRefMATH
15.
Zurück zum Zitat Arslan M, Çunkaş M, Sağ T (2012) Determination of induction motor parameters with differential evolution algorithm. Neural Comput Appl 21(8):1995–2004CrossRef Arslan M, Çunkaş M, Sağ T (2012) Determination of induction motor parameters with differential evolution algorithm. Neural Comput Appl 21(8):1995–2004CrossRef
16.
Zurück zum Zitat Wang GG, Gandomi AH, Alavi AH et al (2014) Hybrid krill herd algorithm with differential evolution for global numerical optimization. Neural Comput Appl 25(2):297–308CrossRef Wang GG, Gandomi AH, Alavi AH et al (2014) Hybrid krill herd algorithm with differential evolution for global numerical optimization. Neural Comput Appl 25(2):297–308CrossRef
17.
Zurück zum Zitat Wang L, Zou F, Hei X et al (2014) A hybridization of teaching–learning-based optimization and differential evolution for chaotic time series prediction. Neural Comput Appl 25(6):1407–1422CrossRef Wang L, Zou F, Hei X et al (2014) A hybridization of teaching–learning-based optimization and differential evolution for chaotic time series prediction. Neural Comput Appl 25(6):1407–1422CrossRef
18.
Zurück zum Zitat Chiou JP, Chang CF, Su CT (2004) Ant direction hybrid differential evolution for solving large capacitor placement problems. IEEE Trans Power Syst 19(4):1794–1800CrossRef Chiou JP, Chang CF, Su CT (2004) Ant direction hybrid differential evolution for solving large capacitor placement problems. IEEE Trans Power Syst 19(4):1794–1800CrossRef
19.
Zurück zum Zitat Onwubolu G, Davendra D (2006) Scheduling flow shops using differential evolution algorithm. Eur J Oper Res 171(2):674–692CrossRefMATH Onwubolu G, Davendra D (2006) Scheduling flow shops using differential evolution algorithm. Eur J Oper Res 171(2):674–692CrossRefMATH
20.
Zurück zum Zitat Qian B, Wang L, Huang DX et al (2008) Scheduling multi-objective job shops using a memetic algorithm based on differential evolution. Int J Adv Manuf Technol 35(9–10):1014–1027CrossRef Qian B, Wang L, Huang DX et al (2008) Scheduling multi-objective job shops using a memetic algorithm based on differential evolution. Int J Adv Manuf Technol 35(9–10):1014–1027CrossRef
21.
Zurück zum Zitat Damak N, Jarboui B, Siarry P et al (2009) Differential evolution for solving multi-mode resource-constrained project scheduling problems. Comput Oper Res 36(9):2653–2659MathSciNetCrossRefMATH Damak N, Jarboui B, Siarry P et al (2009) Differential evolution for solving multi-mode resource-constrained project scheduling problems. Comput Oper Res 36(9):2653–2659MathSciNetCrossRefMATH
22.
Zurück zum Zitat Pan QK, Wang L, Gao L et al (2011) An effective hybrid discrete differential evolution algorithm for the flow shop scheduling with intermediate buffers. Inf Sci 181(3):668–685CrossRef Pan QK, Wang L, Gao L et al (2011) An effective hybrid discrete differential evolution algorithm for the flow shop scheduling with intermediate buffers. Inf Sci 181(3):668–685CrossRef
23.
Zurück zum Zitat Omran MG, Salman A, Engelbrecht AP (2005) Self-adaptive differential evolution. In: International conference on computational and information science. Springer, Berlin, pp 192–199 Omran MG, Salman A, Engelbrecht AP (2005) Self-adaptive differential evolution. In: International conference on computational and information science. Springer, Berlin, pp 192–199
24.
Zurück zum Zitat Qin AK, Huang VL, Suganthan PN (2009) Differential evolution algorithm with strategy adaptation for global numerical optimization. IEEE Trans Evol Comput 13(2):398–417CrossRef Qin AK, Huang VL, Suganthan PN (2009) Differential evolution algorithm with strategy adaptation for global numerical optimization. IEEE Trans Evol Comput 13(2):398–417CrossRef
25.
Zurück zum Zitat Wang L, Pan QK, Suganthan PN, Wang WH, Wang YM (2010) A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems. Comput Oper Res 37(3):509–520MathSciNetCrossRefMATH Wang L, Pan QK, Suganthan PN, Wang WH, Wang YM (2010) A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems. Comput Oper Res 37(3):509–520MathSciNetCrossRefMATH
26.
Zurück zum Zitat Yildiz AR (2013) Hybrid Taguchi-differential evolution algorithm for optimization of multi-pass turning operations. Appl Soft Comput 13(3):1433–1439CrossRef Yildiz AR (2013) Hybrid Taguchi-differential evolution algorithm for optimization of multi-pass turning operations. Appl Soft Comput 13(3):1433–1439CrossRef
27.
Zurück zum Zitat Zhang Y, Li X (2011) Estimation of distribution algorithm for permutation flow shops with total flowtime minimization. Comput Ind Eng 60(4):706–718CrossRef Zhang Y, Li X (2011) Estimation of distribution algorithm for permutation flow shops with total flowtime minimization. Comput Ind Eng 60(4):706–718CrossRef
28.
Zurück zum Zitat Wang L, Wang S, Xu Y et al (2012) A bi-population based estimation of distribution algorithm for the flexible job-shop scheduling problem. Comput Ind Eng 62(4):917–926CrossRef Wang L, Wang S, Xu Y et al (2012) A bi-population based estimation of distribution algorithm for the flexible job-shop scheduling problem. Comput Ind Eng 62(4):917–926CrossRef
29.
Zurück zum Zitat Wang S, Wang L, Liu M et al (2013) An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem. Int J Prod Econ 145(1):387–396CrossRef Wang S, Wang L, Liu M et al (2013) An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem. Int J Prod Econ 145(1):387–396CrossRef
30.
Zurück zum Zitat Donate JP, Li X, Sánchez GG et al (2013) Time series forecasting by evolving artificial neural networks with genetic algorithms, differential evolution and estimation of distribution algorithm. Neural Comput Appl 22(1):11–20CrossRef Donate JP, Li X, Sánchez GG et al (2013) Time series forecasting by evolving artificial neural networks with genetic algorithms, differential evolution and estimation of distribution algorithm. Neural Comput Appl 22(1):11–20CrossRef
31.
Zurück zum Zitat Cheng S, Lu X, Zhou X (2014) Globally optimal selection of web composite services based on univariate marginal distribution algorithm. Neural Comput Appl 24(1):27–36CrossRef Cheng S, Lu X, Zhou X (2014) Globally optimal selection of web composite services based on univariate marginal distribution algorithm. Neural Comput Appl 24(1):27–36CrossRef
32.
Zurück zum Zitat Lozano JA, Larranaga P, Inza I (2006) Towards a new evolutionary computation: advances on estimation of distribution algorithms. Springer, BerlinCrossRefMATH Lozano JA, Larranaga P, Inza I (2006) Towards a new evolutionary computation: advances on estimation of distribution algorithms. Springer, BerlinCrossRefMATH
33.
Zurück zum Zitat Jarboui B, Eddaly M, Siarry P (2009) An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems. Comput Oper Res 36(9):2638–2646MathSciNetCrossRefMATH Jarboui B, Eddaly M, Siarry P (2009) An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems. Comput Oper Res 36(9):2638–2646MathSciNetCrossRefMATH
34.
Zurück zum Zitat Pan QK, Ruiz R (2012) An estimation of distribution algorithm for lot-streaming flow shop problems with setup times. Omega-Int J Manage S 40(2):166–180CrossRef Pan QK, Ruiz R (2012) An estimation of distribution algorithm for lot-streaming flow shop problems with setup times. Omega-Int J Manage S 40(2):166–180CrossRef
35.
Zurück zum Zitat Chen SH, Chen MC (2013) Addressing the advantages of using ensemble probabilistic models in estimation of distribution algorithms for scheduling problems. Int J Prod Econ 141(1):24–33CrossRef Chen SH, Chen MC (2013) Addressing the advantages of using ensemble probabilistic models in estimation of distribution algorithms for scheduling problems. Int J Prod Econ 141(1):24–33CrossRef
Metadaten
Titel
A hybrid differential evolution algorithm with estimation of distribution algorithm for reentrant hybrid flow shop scheduling problem
verfasst von
Bing-hai Zhou
Li-man Hu
Zhen-yi Zhong
Publikationsdatum
16.11.2016
Verlag
Springer London
Erschienen in
Neural Computing and Applications / Ausgabe 1/2018
Print ISSN: 0941-0643
Elektronische ISSN: 1433-3058
DOI
https://doi.org/10.1007/s00521-016-2692-y

Weitere Artikel der Ausgabe 1/2018

Neural Computing and Applications 1/2018 Zur Ausgabe