Skip to main content

2020 | OriginalPaper | Buchkapitel

8. Static Optimization and Scheduling of the Discrete Manufacturing System’s Energy Efficiency Based on the Integration of Knowledge and MOPSO

verfasst von : Yan Wang, Cheng-Lin Liu, Zhi-Cheng Ji

Erschienen in: Quantitative Analysis and Optimal Control of Energy Efficiency in Discrete Manufacturing System

Verlag: Springer Singapore

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

search-config
loading …

Abstract

Scholars both at home and abroad have undertaken numerous research and proposed many optimization methods.

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

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!

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"

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!

Literatur
1.
Zurück zum Zitat Roberge V, Tarbouchi M, Labonte G (2012) Comparison of parallel genetic algorithm and particle swarm optimization for real-time UAV path planning. IEEE Trans Indust Inf 9(1):132–141CrossRef Roberge V, Tarbouchi M, Labonte G (2012) Comparison of parallel genetic algorithm and particle swarm optimization for real-time UAV path planning. IEEE Trans Indust Inf 9(1):132–141CrossRef
2.
Zurück zum Zitat Zhao SZ, Suganthan PN, Pan QK et al (2011) Dynamic multi-swarm particle swarm optimizer with harmony search. Expert Syst Appl 38(4):3735–3742CrossRef Zhao SZ, Suganthan PN, Pan QK et al (2011) Dynamic multi-swarm particle swarm optimizer with harmony search. Expert Syst Appl 38(4):3735–3742CrossRef
3.
Zurück zum Zitat Liu QW (2014) Research on artificial bee colony and its application in scheduling problems. Beijing Jiaotong University Liu QW (2014) Research on artificial bee colony and its application in scheduling problems. Beijing Jiaotong University
4.
Zurück zum Zitat Silva RR, Brandã£O CRF (2010) Morphological patterns and community organization in leaf-litter ant assemblage. Ecol Monog 80(1):107–124 Silva RR, Brandã£O CRF (2010) Morphological patterns and community organization in leaf-litter ant assemblage. Ecol Monog 80(1):107–124
5.
Zurück zum Zitat Gui WH, Chen XF, Yang CH et al (2016) Knowledge automation and its industrial application. Sci Sini (Inform) 46(8): 1016 Gui WH, Chen XF, Yang CH et al (2016) Knowledge automation and its industrial application. Sci Sini (Inform) 46(8): 1016
6.
Zurück zum Zitat Sha DY, Lin HH (2010) A multi-objective PSO for job-shop scheduling problems. Expert Syst Appl 37(2):1065–1070CrossRef Sha DY, Lin HH (2010) A multi-objective PSO for job-shop scheduling problems. Expert Syst Appl 37(2):1065–1070CrossRef
7.
Zurück zum Zitat Zhang CY, Rao YQ, Li PG et al (2007) Bilevel genetic algorithm for the flexible job-shop scheduling problem. Chin J Mech Eng 43(4):119–124CrossRef Zhang CY, Rao YQ, Li PG et al (2007) Bilevel genetic algorithm for the flexible job-shop scheduling problem. Chin J Mech Eng 43(4):119–124CrossRef
8.
Zurück zum Zitat Zhang C, Li P, Rao Y, Li S (2005) A new hybrid GA/SA algorithm for the job shop scheduling problem. In: Evolutionary computation in combinatorial optimization. Springer, Berlin Heidelberg, pp 246–259 Zhang C, Li P, Rao Y, Li S (2005) A new hybrid GA/SA algorithm for the job shop scheduling problem. In: Evolutionary computation in combinatorial optimization. Springer, Berlin Heidelberg, pp 246–259
9.
Zurück zum Zitat Zhang CY, Guan ZL, Liu Q et al (2008) New scheduling type applied to solving job-shop scheduling problem. J Mech Eng 44(10):24–31CrossRef Zhang CY, Guan ZL, Liu Q et al (2008) New scheduling type applied to solving job-shop scheduling problem. J Mech Eng 44(10):24–31CrossRef
10.
Zurück zum Zitat Balas E (1969) Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Oper Res 17(6):941–957MathSciNetCrossRef Balas E (1969) Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Oper Res 17(6):941–957MathSciNetCrossRef
11.
Zurück zum Zitat Zitzler E, Laumanns M, Thiele L (2001) SPEA2: improving the strength Pare-to evolutionary algorithm for multiobjective optimization. TIK-report, 103, Swiss Federal Institute of Technology, pp 1–21 Zitzler E, Laumanns M, Thiele L (2001) SPEA2: improving the strength Pare-to evolutionary algorithm for multiobjective optimization. TIK-report, 103, Swiss Federal Institute of Technology, pp 1–21
12.
Zurück zum Zitat Deb K, Pratap A, Agarwal S et al (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197CrossRef Deb K, Pratap A, Agarwal S et al (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197CrossRef
13.
Zurück zum Zitat Li H, Zhang Q (2009) Multiobjective optimization problems with complicated Pareto sets, MOEA/D and NSGA-II. IEEE Trans Evol Comput 13(2):284–302CrossRef Li H, Zhang Q (2009) Multiobjective optimization problems with complicated Pareto sets, MOEA/D and NSGA-II. IEEE Trans Evol Comput 13(2):284–302CrossRef
14.
Zurück zum Zitat Zhang Q, Li H (2007) MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712–731CrossRef Zhang Q, Li H (2007) MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712–731CrossRef
15.
Zurück zum Zitat Kacem I, Hammadi S, Borne P (2002) Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Math Comput Simul 60(3):245–276MathSciNetCrossRef Kacem I, Hammadi S, Borne P (2002) Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Math Comput Simul 60(3):245–276MathSciNetCrossRef
16.
Zurück zum Zitat Brandimarte P (1993) Routing and scheduling in a flexible job shop by tabu search. Ann Oper Res 41(3):157–183CrossRef Brandimarte P (1993) Routing and scheduling in a flexible job shop by tabu search. Ann Oper Res 41(3):157–183CrossRef
17.
Zurück zum Zitat Li J, Pan Q, Liang YC (2010) An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems. Comput Ind Eng 59(4):647–662CrossRef Li J, Pan Q, Liang YC (2010) An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems. Comput Ind Eng 59(4):647–662CrossRef
18.
Zurück zum Zitat Bagheri A, Zandieh M, Mahdavi I et al (2010) An artificial immune algorithm for the flexible job-shop scheduling problem. Future Gener Comput Syst 26(4):533–541CrossRef Bagheri A, Zandieh M, Mahdavi I et al (2010) An artificial immune algorithm for the flexible job-shop scheduling problem. Future Gener Comput Syst 26(4):533–541CrossRef
19.
Zurück zum Zitat Xing LN, Chen YW, Wang P et al (2010) A knowledge-based ant colony optimization for flexible job shop scheduling problems. Appl Soft Comput 10(3):888–896CrossRef Xing LN, Chen YW, Wang P et al (2010) A knowledge-based ant colony optimization for flexible job shop scheduling problems. Appl Soft Comput 10(3):888–896CrossRef
20.
Zurück zum Zitat Wang X, Gao L, Zhang C, Shao X (2010) A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem. Int J Adv Manufac Technol 51(5–8):757–767CrossRef Wang X, Gao L, Zhang C, Shao X (2010) A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem. Int J Adv Manufac Technol 51(5–8):757–767CrossRef
21.
Zurück zum Zitat Li JQ, Pan QK, Gao KZ (2011) Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems. Int J Adv Manuf Technol 55(9–12):1159–1169CrossRef Li JQ, Pan QK, Gao KZ (2011) Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems. Int J Adv Manuf Technol 55(9–12):1159–1169CrossRef
22.
Zurück zum Zitat Chiang TC, Lin HJ (2013) A simple and effective evolutionary algorithm for multiobjective flexible job shop scheduling. Int J Prod Econ 141(1):87–98CrossRef Chiang TC, Lin HJ (2013) A simple and effective evolutionary algorithm for multiobjective flexible job shop scheduling. Int J Prod Econ 141(1):87–98CrossRef
23.
Zurück zum Zitat Xing LN, Chen YW, Yang KW (2009) An efficient search method for multi-objective flexible job shop scheduling problems. J Intell Manuf 20(3):283–293CrossRef Xing LN, Chen YW, Yang KW (2009) An efficient search method for multi-objective flexible job shop scheduling problems. J Intell Manuf 20(3):283–293CrossRef
24.
Zurück zum Zitat Li J, Pan Q, Xie S (2012) An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems. Appl Math Comput 218(18):9353–9371MathSciNetMATH Li J, Pan Q, Xie S (2012) An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems. Appl Math Comput 218(18):9353–9371MathSciNetMATH
25.
Zurück zum Zitat Li JQ, Pan QK, Suganthan PN et al (2011) A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem. Int J Adv Manuf Technol 52(5–8):683–697CrossRef Li JQ, Pan QK, Suganthan PN et al (2011) A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem. Int J Adv Manuf Technol 52(5–8):683–697CrossRef
26.
Zurück zum Zitat Ishibuchi H, Murata T (1998) A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Trans Syst Man Cybernet. Part C: Appl Rev 28(3):392–403 Ishibuchi H, Murata T (1998) A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Trans Syst Man Cybernet. Part C: Appl Rev 28(3):392–403
27.
Zurück zum Zitat Adibi MA, Zandieh M, Amiri M (2010) Multi-objective scheduling of dynamic job shop using variable neighborhood search. Expert Syst Appl 37(1):282–287CrossRef Adibi MA, Zandieh M, Amiri M (2010) Multi-objective scheduling of dynamic job shop using variable neighborhood search. Expert Syst Appl 37(1):282–287CrossRef
28.
Zurück zum Zitat Wang XJ, Guo YJ (2004) Aggregate analysis of group decision making based on G1-method. Chin J Manage Sci, 14–16 Wang XJ, Guo YJ (2004) Aggregate analysis of group decision making based on G1-method. Chin J Manage Sci, 14–16
29.
Zurück zum Zitat Huang ZT, Yang J, Zhang CY et al (2016) Energy-oriented CNC milling process modelling and parameter optimization. China Mech Eng 27(18):2524–2532 Huang ZT, Yang J, Zhang CY et al (2016) Energy-oriented CNC milling process modelling and parameter optimization. China Mech Eng 27(18):2524–2532
Metadaten
Titel
Static Optimization and Scheduling of the Discrete Manufacturing System’s Energy Efficiency Based on the Integration of Knowledge and MOPSO
verfasst von
Yan Wang
Cheng-Lin Liu
Zhi-Cheng Ji
Copyright-Jahr
2020
Verlag
Springer Singapore
DOI
https://doi.org/10.1007/978-981-15-4462-0_8

Neuer Inhalt