Skip to main content

Multiobjective Particle Swarm Optimization with Directional Search for Distributed Permutation Flow Shop Scheduling Problem

  • Conference paper
  • First Online:
Bio-inspired Computing: Theories and Applications (BIC-TA 2019)

Abstract

The distributed permutation flow shop scheduling problem (DPFSP) is a variant of the permutation flow shop scheduling problem (PFSP). DPFSP is closer to the actual situation of industrial production and has important research significance. In this paper, a multiobjective particle swarm optimization with directional search (MoPSO-DS) is proposed to solve DPFSP. Directional search strategy are inspired by decomposition. Firstly, MoPSO-DS divides the particle swarm into three subgroups, and three subgroups are biased in different regions of the Pareto front. Then, particles are updated in the direction of the partiality. Finally, combine the particles of the three subgroups to find the best solution. MoPSO-DS updates particles in different directions which speed up the convergence of the particles while ensuring good distribution performance. In this paper, MoPSO-DS is compared with the NAGA-II, SPEA2, MoPSO, MOEA/D, and MOHEA algorithms. Experimental results show that the performance of MoPSO-DS is better.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Al Moubayed, N., Petrovski, A., Mccall, J.: \(D{2}MOPSO\): MOPSO based on decomposition and dominance with archiving using crowding distance in objective and solution spaces. Evol. Comput. 22(1), 47–77 (2014)

    Article  Google Scholar 

  2. Chen, J.F., Wang, L., Peng, Z.P.: A collaborative optimization algorithm for energy-efficient multi-objective distributed no-idle flow-shop scheduling. Swarm Evol. Comput. 50 (2019). https://doi.org/10.1016/j.swevo.2019.100557

  3. Coello, C.A.C., Pulido, G.T., Lechuga, M.S.: Handling multiple objectives with particle swarm optimization. IEEE Trans. Evol. Comput. 8(3), 256–279 (2004)

    Article  Google Scholar 

  4. Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of the Sixth International Symposium on Micro Machine and Human Science, MHS 1995, pp. 39–43. IEEE (1995)

    Google Scholar 

  5. Eddaly, M., Jarboui, B., Siarry, P.: Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem. J. Comput. Des. Eng. 3(4), 295–311 (2016)

    Google Scholar 

  6. Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1(2), 117–129 (1976)

    Article  MathSciNet  Google Scholar 

  7. Han, H., Lu, W., Qiao, J.: An adaptive multiobjective particle swarm optimization based on multiple adaptive methods. IEEE Trans. Cybern. 47(9), 2754–2767 (2017)

    Article  Google Scholar 

  8. Jiang, E., Wang, L., Lu, J.: Modified multiobjective evolutionary algorithm based on decomposition for low-carbon scheduling of distributed permutation flow-shop. In: 2017 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 1–7. IEEE (2017)

    Google Scholar 

  9. Li, J.Q., Bai, S.C., Duan, P.Y., Sang, H.Y., Han, Y.Y., Zheng, Z.X.: An improved artificial bee colony algorithm for addressing distributed flow shop with distance coefficient in a prefabricated system. Int. J. Prod. Res. 57(22), 6922–6942 (2019)

    Article  Google Scholar 

  10. Li, J.Q., Sang, H.Y., Han, Y.Y., Wang, C.G., Gao, K.Z.: Efficient multi-objective optimization algorithm for hybrid flow shop scheduling problems with setup energy consumptions. J. Clean. Prod. 181, 584–598 (2018)

    Article  Google Scholar 

  11. Martínez-Cagigal, V., Santamaría-Vázquez, E., Hornero, R.: A novel hybrid swarm algorithm for P300-based BCI channel selection. In: Lhotska, L., Sukupova, L., Lacković, I., Ibbott, G.S. (eds.) World Congress on Medical Physics and Biomedical Engineering 2018. IP, vol. 68/3, pp. 41–45. Springer, Singapore (2019). https://doi.org/10.1007/978-981-10-9023-3_8

    Chapter  Google Scholar 

  12. Naderi, B., Ruiz, R.: The distributed permutation flowshop scheduling problem. Comput. Oper. Res. 37(4), 754–768 (2010)

    Article  MathSciNet  Google Scholar 

  13. Schaffer, J.D.: Multiple objective optimization with vector evaluated genetic algorithms. In: 1985 Proceedings of the First International Conference on Genetic Algorithms and Their Applications, pp. 93–100. Lawrence Erlbaum Associates. Inc. (1985)

    Google Scholar 

  14. Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2), 278–285 (1993)

    Article  MathSciNet  Google Scholar 

  15. Tang, D., Dai, M., Salido, M.A., Giret, A.: Energy-efficient dynamic scheduling for a flexible flow shop using an improved particle swarm optimization. Comput. Ind. 81, 82–95 (2016)

    Article  Google Scholar 

  16. Wang, J., Cao, Y., Li, B., Kim, H.J., Lee, S.: Particle swarm optimization based clustering algorithm with mobile sink for WSNs. Futur. Gener. Comput. Syst. 76, 452–457 (2017)

    Article  Google Scholar 

  17. Yu, X., Gen, M.: Introduction to Evolutionary Algorithms. Springer, Cham (2010). https://doi.org/10.1007/978-1-84996-129-5

    Book  MATH  Google Scholar 

  18. Zhang, W., Gen, M., Jo, J.: Hybrid sampling strategy-based multiobjective evolutionary algorithm for process planning and scheduling problem. J. Intell. Manuf. 25(5), 881–897 (2014). https://doi.org/10.1007/s10845-013-0814-2

    Article  Google Scholar 

  19. Zhang, W., Lu, J., Zhang, H., Wang, C., Gen, M.: Fast multi-objective hybrid evolutionary algorithm for flow shop scheduling problem. In: Xu, J., Hajiyev, A., Nickel, S., Gen, M. (eds.) Proceedings of the Tenth International Conference on Management Science and Engineering Management. AISC, vol. 502, pp. 383–392. Springer, Singapore (2017). https://doi.org/10.1007/978-981-10-1837-4_33

    Chapter  Google Scholar 

  20. Zhang, W., Wang, Y., Yang, Y., Gen, M.: Hybrid multiobjective evolutionary algorithm based on differential evolution for flow shop scheduling problems. Comput. Ind. Eng. 130, 661–670 (2019)

    Article  Google Scholar 

  21. Zhao, F., Qin, S., Yang, G., Ma, W., Zhang, C., Song, H.: A factorial based particle swarm optimization with a population adaptation mechanism for the no-wait flow shop scheduling problem with the makespan objective. Expert Syst. Appl. 126, 41–53 (2019)

    Article  Google Scholar 

Download references

Acknowledgements

This research work is supported by the Sub-Project of National Key R&D Program of China (2017YFD0401001-02), Science & Technology Research Project of Henan Province (162102210044), Program for Science & Technology Innovation Talents in Universities of Henan Province (19HASTIT027), Key Research Project in Universities of Henan Province (17A520030), Ministry of Education and the Grant-in-Aid for Scientific Research (C) of Japan Society of Promotion of Science (JSPS) (19K12148).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wenqiang Zhang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, W., Hou, W., Yang, D., Xing, Z., Gen, M. (2020). Multiobjective Particle Swarm Optimization with Directional Search for Distributed Permutation Flow Shop Scheduling Problem. In: Pan, L., Liang, J., Qu, B. (eds) Bio-inspired Computing: Theories and Applications. BIC-TA 2019. Communications in Computer and Information Science, vol 1159. Springer, Singapore. https://doi.org/10.1007/978-981-15-3425-6_14

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-3425-6_14

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-3424-9

  • Online ISBN: 978-981-15-3425-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics