Skip to main content

Advertisement

SpringerLink
Log in

Fitness distance analysis for parallel genetic algorithm in the test task scheduling problem

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

Abstract

The test task scheduling problem (TTSP) has attracted increasing attention due to the wide range of automatic test systems applications, despite the fact that it is an NP-complete problem. The main feature of TTSP is the close interactions between task sequence and the scheme choice. Based on this point, the parallel implantation of genetic algorithm, called Parallel Genetic Algorithm (PGA), is proposed to determine the optimal solutions. Two branches—the tasks sequence and scheme choice run the classic genetic algorithm independently and they balance each other due to their interaction in the given problem. To match the frame of the PGA, a vector group encoding method is provided. In addition, the fitness distance coefficient (FDC) is first applied as the measurable step of landscape to analyze TTSP and guide the design of PGA when solving the TTSP. The FDC is the director of the search space of the TTSP, and the search space determinates the performance of PGA. The FDC analysis shows that the TTSP owes a large number of local optima. Strong space search ability is needed to solve TTSP better. To make PGA more suitable to solve TTSP, three crossover and four selection operations are adopted to find the best combination. The experiments show that due to the characteristic of TTSP and the randomness of the algorithm, the PGA has a low probability for optimizing the TTSP, but PGA with Nabel crossover and stochastic tournament selection performs best. The assumptions of FDC are consistent with the success rate of PGA when solving the TTSP.

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

Similar content being viewed by others

References

  • Acampora G, Gaeta M, Loia V (2011a) Combining multi-agent paradigm and memetic computing for personalized and adaptive learning experiences. Comput Intell 27(2):141–165

    Article  MathSciNet  Google Scholar 

  • Acampora G, Gaeta M, Loia V (2011b) Hierarchical optimization of personalized experiences for e-Learning systems through evolutionary models. Neural Comput Appl 20(5):641–657

    Article  Google Scholar 

  • Acampora G, Cadenas JM, Loia V, Balleste EM (2011c) Achieving memetic adaptability by Means of agent-based machine learning. IEEE Trans Ind Inform 7(4):557–569

    Article  Google Scholar 

  • Bac FQ, Perov VL (1993) New evolutionary genetic algorithms for NP-complete combinatorial optimization problems. Biol Cybern 69(2):229–234

    Article  MATH  Google Scholar 

  • Brindle A (1981) Genetic algorithms for function optimization. Dissertation, the University of Alberta

  • Caraffini F, Neri F, Iacca G, Mol A (2013) Parallel memetic structures. Inform Sci 227:60–82

    Article  MathSciNet  Google Scholar 

  • Czogall J, Fink A (2011) Fitness landscape analysis for the no-wait flow-shop scheduling problem. J Heuristics 18(1):25–51

    Article  Google Scholar 

  • Defersha FM, Chen M (2010) A parallel genetic algorithm for a flexible job-shop scheduling problem with sequence dependent setups. Int J Adv Manuf Tech 49(1–4):263–279

    Article  Google Scholar 

  • Gao JQ, He GX, Wang YS (2009) A new parallel genetic algorithm for solving multi-objective scheduling problems subjected to special process constraint. Int J Adv Manuf Tech 43(1):151–160

    Article  Google Scholar 

  • Gibbs MS, Maier HR, Dandy GC (2011) Relationship between problem characteristics and the optimal number of genetic algorithm generations. Eng Optim 43(4):349–376

    Article  Google Scholar 

  • Hoo HH, Stützle T (2004) Stochastic local search: foundations and applications. Morgan Kaufmann, San Francisco

    Google Scholar 

  • Jones T (1995) Evolutionary algorithm, fitness landscapes and search. Dissertation, the University of New Mexico Albuquerque

  • Kubiak M (2007) Distance measures and fitness-distance analysis for the capacitated vehicle routing problem. Oper Res Comput Sci 39:345–364

    Google Scholar 

  • Lu H, Chen X, Liu J (2012) Parallel test task scheduling with constraints based on hybrid particle swarm optimization and tabu search. Chinese J Electron 21(4):615–618

    Google Scholar 

  • Lu H, Niu RY, Liu J, Zhu Z (2013) A chaotic non-dominated sorting genetic algorithm for the multi-objective automatic test task scheduling problem. Appl Soft Comput 31(5):2790–2802

    Google Scholar 

  • Mattfeld DC, Bierwirth C, Kopfer H (1999) A search space analysis of the Job Shop Scheduling Problem. Ann Oper Res 86:441–453

    Article  MATH  MathSciNet  Google Scholar 

  • Quick RJ, Rayward-Smith VJ, Smith GD (1998) Fitness distance correlation and ridge functions. Lect Notes Comput Sci (LNCS) 1498:77–86

    Article  Google Scholar 

  • Radulescu A, Nicolescu C, van-Gemund AJC, Jonker PP (2001) CPR: mixed task and data parallel scheduling for distributed systems. In: Proceedings of the 15th international parallel and distributed processing symposium, pp 39–39

  • Reeves CR (1995) A genetic algorithm for flowshop sequencing. Comput Oper Res 22(1):5–13

    Article  MATH  Google Scholar 

  • Ross WA (2003) The impact of next generation test technology on aviation maintenance. In: Proceeding of IEEE systems readiness technology conference of autotestcon, pp 2–9

  • Schiavinotto T, Stützle T (2005) The linear ordering problem: instances, search space analysis and algorithms. J Math Model Algorithms 3(4):367–402

    Article  Google Scholar 

  • Schiavinotto T, Stützle T (2007) A review of metrics on permutations for search landscape analysis. Comput Oper Res 34(10):3134–3153

    Article  Google Scholar 

  • Schulze J, Fahle T (1999) A parallel algorithm for the vehicle routing problem with time window constraints. Ann Oper Res 86:585–607

    Article  MATH  MathSciNet  Google Scholar 

  • Smith-Miles K, Lopes L (2012) Measuring instance difficulty for combinatorial optimization problems. Comput Oper Res 39(6):875–889

    Article  MATH  MathSciNet  Google Scholar 

  • Sörensen K (2007) Distance measures based on the edit distance for permutation-type representations. J Heuristics 13(1):35–47

    Article  Google Scholar 

  • Stützle T, Hoos HH (2000) MAX -MIN Ant System. Future Gener Comp Sy 16(8):889–914

    Article  Google Scholar 

  • Tavares J, Pereira FB, Costa E (2008) Multidimensional Knapsack Problem: a fitness landscape analysis. IEEE Trans Syst Man Cybern Part B Cybern 38(3):604–616

    Article  Google Scholar 

  • Tsai CW, Tseng SP, Chiang MC, Yang CS (2011) A fast parallel genetic algorithm for travelling salesman problem. Lect Notes Comput Sci (LNCS) 6083:241–250

    Article  Google Scholar 

  • Xia R, Xiao MQ, Cheng JJ, Fu XH (2007a) Optimizing the multi-UUT parallel test task scheduling based on multi-objective GASA. In: The 8th international conference on electronic measurement and instruments, pp 839–844

  • Xia R, Xiao MQ, Cheng JJ (2007b) Parallel TPS design and application based on software architecture, components and patterns. In: IEEE Autotestcon 2007 systems readiness technology conference, pp 234–240

  • Yu B, Yang ZZ, Sun XS et al (2011) Parallel genetic algorithm in bus route headway optimization. Appl Soft Comput 11(8):5081–5091

    Article  Google Scholar 

  • Zhang L, Wang L, Zheng DZ (2006) An adaptive genetic algorithm with multiple operators for flowshop scheduling. Int J Adv Manuf Tech 27(5–6):580–587

    Article  Google Scholar 

  • Zhou DX, Qi P, Liu T (2009) An optimizing algorithm for resources allocation in parallel test. In: IEEE international conference on control and automation, pp 1997–2002

Download references

Acknowledgments

The information provided in this paper is the sole responsibility of the authors and does not reflect the community’s opinion. The community is not responsible for any use of data appearing in this publication. This research is supported by the National Natural Science Foundation of China under Grant No. 61101153 and the National 863 Hi-Tech R and D Plan under Grant 2011AA110101.

Conflict of interest

The authors declare that they have no conflicts of interest.

Author information

Authors and Affiliations

  1. School of Electronic and Information Engineering, Beihang University, Beijing, 100191, China

    Hui Lu, Jing Liu, Ruiyao Niu & Zheng Zhu

Authors
  1. Hui Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jing Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ruiyao Niu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Zheng Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hui Lu.

Additional information

Communicated by G. Acampora.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lu, H., Liu, J., Niu, R. et al. Fitness distance analysis for parallel genetic algorithm in the test task scheduling problem. Soft Comput 18, 2385–2396 (2014). https://doi.org/10.1007/s00500-013-1212-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-013-1212-6

Keywords

Search

Navigation