Skip to main content
SpringerLink
Log in

Kalman filter and multi-stage learning-based hybrid differential evolution algorithm with particle swarm for a two-stage flow shops scheduling problem

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Inspired by the advantages of hybrid intelligent optimization methods, this paper at first proposes a hybrid differential evolution with particle swarm optimization (DEPS) to solve a two-stage hybrid flow shops scheduling problem. On the basis of analyzing the convergence and optimization scheme of DEPS, the Kalman filter algorithm and a multi-stage learning strategy are then creatively fused into DEPS, namely KLDEPS, to enhance the running performance of the algorithm. The introduction of the Kalman filter enriches the diversity of individuals and enhances the neighborhood search ability of the algorithm, and the combination with the multi-stage learning strategy has beneficial effect on jumping out of the local optimal scheme. To make the proposed KLDEPS more suitable for a real manufacturing environment, the constraints of queueing time between two stages, different job sizes and processing time are imposed on the scheduling problem. The performance of the proposed KLDEPS is evaluated by comparing with two other high-performing intelligent optimization algorithms. The computational results reveal that the proposed KLDEPS outperforms the other two algorithms both in solutions’ quality and convergence rate.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  • Amin-Naseri MR, Beheshti-Nia MA (2009) Hybrid flow shop scheduling with parallel batching. Int J Prod Econ 117(1):185–196

    Article  Google Scholar 

  • An YJ, Kim YD, Choi SW (2016) Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times. Comput Oper Res 71:127–136

    Article  MathSciNet  MATH  Google Scholar 

  • Atighehchian A, Bijari M, Tarkesh H (2009) A novel hybrid algorithm for scheduling steel-making continuous casting production. Comput Oper Res 36(8):2450–2461

    Article  MATH  Google Scholar 

  • Awasthi A, Venkitusamy K, Padmanaban S et al (2017) Optimal planning of electric vehicle charging station at the distribution system using hybrid optimization algorithm. Energy 133:70–78

    Article  Google Scholar 

  • Blum C, Puchinger J, Raidl GR et al (2011) Hybrid metaheuristics in combinatorial optimization: a survey. Appl Soft Comput 11(6):4135–4151

    Article  Google Scholar 

  • Campestrini C, Heil T, Kosch S et al (2016) A comparative study and review of different Kalman filters by applying an enhanced validation method. J Energy Storage 8:142–159

    Article  Google Scholar 

  • Castro LN, De Castro LN, Timmis J (2002) Artificial immune systems: a new computational intelligence approach. Springer, Berlin

    MATH  Google Scholar 

  • Chen CL, Huang SY, Tzeng YR et al (2014) A revised discrete particle swarm optimization algorithm for permutation flow-shop scheduling problem. Soft Comput 18(11):2271–2282

    Article  Google Scholar 

  • Chung TP, Liao CJ (2013) An immunoglobulin-based artificial immune system for solving the hybrid flow shop problem. Appl Soft Comput 13(8):3729–3736

    Article  Google Scholar 

  • Chung TP, Sun H, Liao CJ (2016) Two new approaches for a two-stage hybrid flowshop problem with a single batch processing machine under waiting time constraint. Comput Ind Eng 113:859–870

    Article  Google Scholar 

  • Corchado E, Abraham A (2010) Hybrid intelligent algorithms and applications. Inf Sci 180(14):2633–2634

    Article  MathSciNet  Google Scholar 

  • Damodaran P, Srihari K, Lam SS (2007) Scheduling a capacitated batch-processing machine to minimize makespan. Robot Comput Integr Manuf 23(2):208–216

    Article  Google Scholar 

  • De A, Mamanduru VKR, Gunasekaran A et al (2016) Composite particle algorithm for sustainable integrated dynamic ship routing and scheduling optimization. Comput Ind Eng 96:201–215

    Article  Google Scholar 

  • Diabat A (2014) Hybrid algorithm for a vendor managed inventory system in a two-echelon supply chain. Eur J Oper Res 238(1):114–121

    Article  MathSciNet  MATH  Google Scholar 

  • Do DTT, Lee S, Lee J (2016) A modified differential evolution algorithm for tensegrity structures. Compos Struct 158:11–19

    Article  Google Scholar 

  • Fang J, Gong X (2010) Predictive iterated Kalman filter for INS/GPS integration and its application to SAR motion compensation. IEEE Trans Instrum Meas 59(4):909–915

    Article  Google Scholar 

  • Farnad B, Jafarian A, Baleanu D (2018) A new hybrid algorithm for continuous optimization problem. Appl Math Model 55:652–673

    Article  MathSciNet  Google Scholar 

  • Fu Q, Sivakumar AI, Li K (2012) Optimisation of flow-shop scheduling with batch processor and limited buffer. Int J Prod Res 50(8):2267–2285

    Article  Google Scholar 

  • Gao Z, Xiao T, Fan W (2011) Hybrid differential evolution and Nelder–Mead algorithm with re-optimization. Soft Comput 15(3):581–594

    Article  Google Scholar 

  • Garnier S, Gautrais J, Theraulaz G (2007) The biological principles of swarm intelligence. Swarm Intell US 1(1):3–31

    Article  Google Scholar 

  • González MÁ, González-Rodríguez I, Vela CR et al (2012) An efficient hybrid evolutionary algorithm for scheduling with setup times and weighted tardiness minimization. Soft Comput 16(12):2097–2113

    Article  Google Scholar 

  • Grewal MS (2011) Kalman filtering. International encyclopedia of statistical science, Springer, pp 705–708

    Google Scholar 

  • Hajiyev C, Soken HE (2013) Robust adaptive Kalman filter for estimation of UAV dynamics in the presence of sensor/actuator faults. Aerosp Sci Technol 28(1):376–383

    Article  Google Scholar 

  • Han X, Liu Q, Wang H et al (2018) Novel fruit fly optimization algorithm with trend search and co-evolution. Knowl Based Syst 141:1–17

    Article  Google Scholar 

  • Izquierdo J, Montalvo I, Pérez R et al (2008) Design optimization of wastewater collection networks by PSO. Comput Math Appl 56(3):777–784

    Article  MathSciNet  MATH  Google Scholar 

  • Kulikov GY, Kulikova MV (2016) The accurate continuous-discrete extended Kalman filter for radar tracking. IEEE Trans Signal Process 64(4):948–958

    Article  MathSciNet  MATH  Google Scholar 

  • Kumar M, Kulkarni AJ, Satapathy SC (2018) Socio evolution and learning optimization algorithm: a socio-inspired optimization methodology. Future Gen Comput Syst 81:252–272

    Article  Google Scholar 

  • Lee CY (1999) Minimizing makespan on a single batch processing machine with dynamic job arrivals. Int J Prod Res 37(1):219–236

    Article  MATH  Google Scholar 

  • Li D, Meng X, Liang Q et al (2015) A heuristic-search genetic algorithm for multi-stage hybrid flow shop scheduling with single processing machines and batch processing machines. J Intell Manuf 26(5):873–890

    Article  Google Scholar 

  • Matin HNZ, Salmasi N, Shahvari O (2017) Makespan minimization in flowshop batch processing problem with different batch compositions on machines. Int J Prod Econ 193:832–844

    Article  Google Scholar 

  • Metaxiotis K, Liagkouras K (2012) Multiobjective evolutionary algorithms for portfolio management: a comprehensive literature review. Expert Syst Appl 39(14):11685–11698

    Article  Google Scholar 

  • Mousavi SM, Alikar N, Niaki STA (2016) An improved fruit fly optimization algorithm to solve the homogeneous fuzzy series–parallel redundancy allocation problem under discount strategies. Soft Comput 20(6):2281–2307

    Article  Google Scholar 

  • Nemati S, Basiri ME, Ghasem-Aghaee N et al (2009) A novel ACO–GA hybrid algorithm for feature selection in protein function prediction. Expert Syst Appl 36(10):12086–12094

    Article  Google Scholar 

  • Ono A, Kitamura S, Mori K (2006) Risk based capacity planning method for semiconductor fab with queue time constraints. In: IEEE international symposium on semiconductor manufacturing, ISSM 2006. IEEE, pp 49–52

  • Pan Z, Zhang Y, Kwong S (2015) Efficient motion and disparity estimation optimization for low complexity multiview video coding. IEEE Trans Broadcast 61(2):166–176

    Article  Google Scholar 

  • Peng L, Liu S, Liu R et al (2018) Effective long short-term memory with differential evolution algorithm for electricity price prediction. Energy 162:1301–1314

    Article  Google Scholar 

  • Roy RK (1990) A primer on the Taguchi method, competitive manufacturing series. Van Nostrand Reinhold, New York, pp 7–80

    Google Scholar 

  • Sayah S, Hamouda A (2013) A hybrid differential evolution algorithm based on particle swarm optimization for nonconvex economic dispatch problems. Appl Soft Comput 13(4):1608–1619

    Article  Google Scholar 

  • Shang R, Du B, Ma H et al (2016) Immune clonal algorithm based on directed evolution for multi-objective capacitated arc routing problem. Appl Soft Comput 49:748–758

    Article  Google Scholar 

  • Shi C, Gershwin SB (2012) Part waiting time distribution in a two-machine line. IFAC Proc Vol 45(6):457–462

    Article  Google Scholar 

  • Simon D (2013) Evolutionary optimization algorithms. Wiley, New York

    Google Scholar 

  • Soleimani H, Kannan G (2015) A hybrid particle swarm optimization and genetic algorithm for closed-loop supply chain network design in large-scale networks. Appl Math Model 39(14):3990–4012

    Article  MathSciNet  Google Scholar 

  • Sung CS, Kim YH (2003) Minimizing due date related performance measures on two batch processing machines. Eur J Oper Res 147(3):644–656

    Article  MathSciNet  MATH  Google Scholar 

  • Toksari MD (2016) A hybrid algorithm of ant colony optimization (ACO) and iterated local search (ILS) for estimating electricity domestic consumption: case of Turkey. Int J Electr Power 78:776–782

    Article  Google Scholar 

  • Vasant P (2010) Hybrid simulated annealing and genetic algorithms for industrial production management problems. Int J Comput Methods 7(02):279–297

    Article  MATH  Google Scholar 

  • Wang L, Hu H, Ai XY et al (2018) Effective electricity energy consumption forecasting using echo state network improved by differential evolution algorithm. Energy 153:801–815

    Article  Google Scholar 

  • Wen X, Shao L, Xue Y et al (2015) A rapid learning algorithm for vehicle classification. Inf Sci 295:395–406

    Article  Google Scholar 

  • Wu Y, Liu G, Guo X et al (2017) A self-adaptive chaos and Kalman filter-based particle swarm optimization for economic dispatch problem. Soft Comput 21(12):3353–3365

    Article  MATH  Google Scholar 

  • Xiong JJ, Zheng EH (2015) Optimal Kalman filter for state estimation of a quadrotor UAV. Opt Int J Light Electron Opt 126(21):2862–2868

    Article  Google Scholar 

  • Xuan H, Tang L (2007) Scheduling a hybrid flowshop with batch production at the last stage. Comput Oper Res 34(9):2718–2733

    Article  MATH  Google Scholar 

  • Xue W, Guo YQ, Zhang XD (2008) Application of a bank of Kalman filters and a robust Kalman filter for aircraft engine sensor/actuator fault diagnosis. Int J Innov Comput I 4(12):3161–3168

    Google Scholar 

  • Yanasse HH (2013) A review of three decades of research on some combinatorial optimization problems. Pesqui Oper 33(1):11–36

    Article  Google Scholar 

  • Yao FS, Zhao M, Zhang H (2012) Two-stage hybrid flow shop scheduling with dynamic job arrivals. Comput Oper Res 39(7):1701–1712

    Article  MathSciNet  MATH  Google Scholar 

  • Zeng YR, Zeng Y, Choi B et al (2017) Multifactor-influenced energy consumption forecasting using enhanced back-propagation neural network. Energy 127:381–396

    Article  Google Scholar 

  • Zhao F, Shao Z, Wang J et al (2016) A hybrid differential evolution and estimation of distribution algorithm based on neighbourhood search for job shop scheduling problems. Int J Prod Res 54(4):1039–1060

    Article  Google Scholar 

  • Zhou BH, Shen CY (2018) Multi-objective optimization of material delivery for mixed model assembly lines with energy consideration. J Clean Prod 192:293–305

    Article  Google Scholar 

  • Zhou BH, Xu JH (2018) An adaptive large neighbourhood search-based optimisation for economic co-scheduling of mobile robots. Eur J Ind Eng 12(6):832–854

    Article  Google Scholar 

Download references

Acknowledgements

The authors appreciate the supports to this research from the National Natural Science Foundation of China under Grant Nos. 61273035, 71471135.

Author information

Authors and Affiliations

  1. School of Mechanical Engineering, Tongji University, Shanghai, 201804, People’s Republic of China

    Bing-hai Zhou, Xiu-mei Liao & Ke Wang

Authors
  1. Bing-hai Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiu-mei Liao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ke Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bing-hai Zhou.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Communicated by V. Loia.

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhou, Bh., Liao, Xm. & Wang, K. Kalman filter and multi-stage learning-based hybrid differential evolution algorithm with particle swarm for a two-stage flow shops scheduling problem. Soft Comput 23, 13067–13083 (2019). https://doi.org/10.1007/s00500-019-03852-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-019-03852-4

Keywords

Search

Navigation