Hybrid Multiobjective Evolutionary Algorithm with Differential Evolution for Process Planning and Scheduling Problem

  • Chunxiao Wang
  • Wenqiang ZhangEmail author
  • Le Xiao
  • Mitsuo Gen
Conference paper
Part of the Lecture Notes on Multidisciplinary Industrial Engineering book series (LNMUINEN)


In an intelligent manufacturing environment, process planning and scheduling (PPS) plays a very important role as a most complex and practical scheduling problem, which processes a set of prismatic parts into completed products by determining the optimal process plans and moments to execute each operation with competitive manufacturing resources. Many research works use multiobjective evolutionary algorithm (MOEA) to solve PPS problems with consideration of multiple complicated objectives to be optimized. This paper proposes a hybrid multiobjective evolutionary algorithm with differential evolution (HMOEA-DE) to solve the PPS problem. HMOEA-DE uses a special designed fitness function to evaluate the dominated and nondominated individuals and divides the population and elitism into two parts, which close to the center and edge areas of Pareto frontier. Moreover, differential evolution applied on elitism tries to improve the convergence and distribution performances much more by guiding the search directions through different individuals with different fitness function. Numerical comparisons indicate that the efficacy of HMOEA-DE outperforms the traditional HMOEA without DE in convergence and distribution performances.


Process planning and scheduling Multiobjective evolutionary algorithm Differential evolution 



This research work is supported by the National Natural Science Foundation of China (U1304609), Foundation for Science & Technology Research Project of Henan Province (162102210044, 152102210068 152102110076), Program for Innovative Research Team (in Science and Technology) in University of Henan Province (17IRTSTHN011), Program for Key Project of Science and Technology in University of Education Department of Henan Province (17A520030), Fundamental Research Funds for the Henan Provincial Colleges and Universities (2014YWQQ12, 2015XTCX03, 2015XTCX04), Research Funds for Key Laboratory of Grain Information Processing and Control (Henan University of Technology) (KFJJ-2015-106), Ministry of Education and the Grant-in-Aid for Scientific Research (C) of Japan Society of Promotion of Science (JSPS): No. 15K00357.


  1. 1.
    Abbass HA, Sarker R (2011) The pareto differential evolution algorithm. Int J Artif Intell Tools 11(04):531–552CrossRefGoogle Scholar
  2. 2.
    Ali M, Siarry P, Pant M (2012) An efficient differential evolution based algorithm for solving multi-objective optimization problems. Eur J Oper Res 217(2):404–416MathSciNetzbMATHGoogle Scholar
  3. 3.
    Ausaf MF, Gao L, Li X (2015) Optimization of multi-objective integrated process planning and scheduling problem using a priority based optimization algorithm. Front Mech Eng 10(4):1–13CrossRefGoogle Scholar
  4. 4.
    Babu BV, Jehan MML (2003) Differential evolution for multi-objective optimization. In: The 2003 Congress on Evolutionary Computation, 2003, CEC 2003, vol 4, pp 2696–2703Google Scholar
  5. 5.
    Deb K, Pratap A et al (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197CrossRefGoogle Scholar
  6. 6.
    Gen M, Cheng R, Lin L (2008) Network models and optimization: Multiobjective genetic algorithm approachGoogle Scholar
  7. 7.
    Guo W, Yu X (2014) Non-dominated sorting differential evolution with improved directional convergence and spread for multiobjective optimization. In: Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation, pp 87–88Google Scholar
  8. 8.
    Iorio AW, Li X (2006) Incorporating directional information within a differential evolution algorithm for multi-objective optimization. In: Conference on Genetic and Evolutionary Computation, pp 691–698Google Scholar
  9. 9.
    Li H, Zhang Q (2006) A multiobjective differential evolution based on decomposition for multiobjective optimization with variable linkages. In: Parallel Problem Solving From Nature - PPSN Ix, International Conference, Reykjavik, Iceland, 9–13 September 2006, Proceedings, pp 583–592Google Scholar
  10. 10.
    Nayak A (2015) Multi-objective process planning and scheduling using controlled elitist non-dominated sorting genetic algorithm. Int J Prod Res 53(6):1712–1735CrossRefGoogle Scholar
  11. 11.
    Phanden RK, Jain A, Verma R (2013) An approach for integration of process planning and scheduling. Int J Comput Integr Manufact 26(4):284–302CrossRefGoogle Scholar
  12. 12.
    Qu BY, Suganthan PN, Liang JJ (2012) Differential evolution with neighborhood mutation for multimodal optimization. IEEE Trans Evol Comput 16(5):601–614CrossRefGoogle Scholar
  13. 13.
    Santana-Quintero LV, Coello Coello CA (2005) An algorithm based on differential evolution for multi-objective problems. Int J Comput Intell Res 1(2):151–169MathSciNetCrossRefGoogle Scholar
  14. 14.
    Schaffer JD (1985) Multiple objective optimization with vector evaluated genetic algorithms. In: International Conference on Genetic Algorithms, pp 93–100Google Scholar
  15. 15.
    Sindhya K, Ruuska S et al (2011) A new hybrid mutation operator for multiobjective optimization with differential evolution. Soft Comput 15(10):2041–2055CrossRefGoogle Scholar
  16. 16.
    Storn R, Price K (1997) Differential evolution – a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341–359MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Xia H, Li X, Gao L (2016) A hybrid genetic algorithm with variable neighborhood search for dynamic integrated process planning and scheduling. Comput Ind Eng 102:99–112CrossRefGoogle Scholar
  18. 18.
    Yu X (2010) Introduction to evolutionary algorithms. In: International Conference on Computers and Industrial Engineering, p 1Google Scholar
  19. 19.
    Zhang W, Gen M, Jo J (2014) Hybrid sampling strategy-based multiobjective evolutionary algorithm for process planning and scheduling problem. J Intell Manufact 25(5):881–897CrossRefGoogle Scholar
  20. 20.
    Zitzler E, Laumanns M, Thiele L (2001) SPEA2: Improving the strength pareto evolutionary algorithmGoogle Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  • Chunxiao Wang
    • 1
    • 2
  • Wenqiang Zhang
    • 1
    • 2
    Email author
  • Le Xiao
    • 1
    • 2
  • Mitsuo Gen
    • 3
  1. 1.Henan University of TechnologyZhengzhouPeople’s Republic of China
  2. 2.Key Laboratory of Grain Information Processing and Control, Ministry of EducationZhengzhouPeople’s Republic of China
  3. 3.Fuzzy Logic Systems Institute and Tokyo University of ScienceTokyoJapan

Personalised recommendations