Skip to main content

2012 | OriginalPaper | Buchkapitel

188. A Cultural Particle Swarm Optimization Algorithm for Flow Shop Scheduling Problem

verfasst von : Yu-lin Zhang, Xia Zhu

Erschienen in: Electrical, Information Engineering and Mechatronics 2011

Verlag: Springer London

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

search-config
loading …

Abstract

To describe the minimization of the makespan in permutation flow shop scheduling problem, Cultural Particle Swarm Optimization (CPSO) is proposed. Two kinds of spaces, population space and belief space, are set in the algorithm. The population space is evolved with adaptive PSO strategy and the belief space is with update function. The interaction between two spaces is by the acceptance operation and impact operation using synchronous transmission mode. The proposed algorithm is tested on different scale benchmarks and compared with the other representative algorithms. The result shows that CPSO has faster convergence speed and is better than other algorithms in not only the solution quality but also the stability.

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!

Literatur
1.
Zurück zum Zitat Reynolds RG (1994) An introduction to cultural algorithms [C]. In: Proceedings of the 3rd annual conference on evolutionary programming. World Scientific, River Edge, pp 131–139 Reynolds RG (1994) An introduction to cultural algorithms [C]. In: Proceedings of the 3rd annual conference on evolutionary programming. World Scientific, River Edge, pp 131–139
2.
Zurück zum Zitat Tasgetiren MF, Liang YC, Sevkli M et al (2007) A particle swarm optimization algorithm for makespan and total flow time minimization in the permutation flow shop sequencing problem [J]. Eur J Oper Res 177(3):1930–1947MATHCrossRef Tasgetiren MF, Liang YC, Sevkli M et al (2007) A particle swarm optimization algorithm for makespan and total flow time minimization in the permutation flow shop sequencing problem [J]. Eur J Oper Res 177(3):1930–1947MATHCrossRef
3.
Zurück zum Zitat Lian ZG, Gu XS, Jiao B (2008) A novel particle swarm optimization algorithm for permutation flow shop scheduling to minimize makespan [J]. Chaos Solitons Fractals 35(5):851–861MATHCrossRef Lian ZG, Gu XS, Jiao B (2008) A novel particle swarm optimization algorithm for permutation flow shop scheduling to minimize makespan [J]. Chaos Solitons Fractals 35(5):851–861MATHCrossRef
4.
Zurück zum Zitat Sha DY, Hsu CY (2006) A hybrid particle swarm optimization for job shop scheduling problem. Comput Ind Eng (51):791–808CrossRef Sha DY, Hsu CY (2006) A hybrid particle swarm optimization for job shop scheduling problem. Comput Ind Eng (51):791–808CrossRef
5.
Zurück zum Zitat Tasgetiren MF, Sevkli M, Liang C, Gencyilmaz G (2004) Particle warm optimization algorithm for permutation flow s hop sequencing problem [A]. Lecture Notes in Computer Science [C]. Springer, Berlin 3172:382–389 Tasgetiren MF, Sevkli M, Liang C, Gencyilmaz G (2004) Particle warm optimization algorithm for permutation flow s hop sequencing problem [A]. Lecture Notes in Computer Science [C]. Springer, Berlin 3172:382–389
6.
Zurück zum Zitat Chang Z (2009) A hybrid algorithm for flow-shop scheduling problem. Acta Autom Sin 35(3):332–336. (In Chinese) Chang Z (2009) A hybrid algorithm for flow-shop scheduling problem. Acta Autom Sin 35(3):332–336. (In Chinese)
Metadaten
Titel
A Cultural Particle Swarm Optimization Algorithm for Flow Shop Scheduling Problem
verfasst von
Yu-lin Zhang
Xia Zhu
Copyright-Jahr
2012
Verlag
Springer London
DOI
https://doi.org/10.1007/978-1-4471-2467-2_188

Neuer Inhalt