ODE: A Fast and Robust Differential Evolution Based on Orthogonal Design

  • Wenyin Gong
  • Zhihua Cai
  • Charles X. Ling
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4304)


In searching for optimal solutions, Differential Evolution (DE), a type of genetic algorithms can find an optimal solution satisfying all the constraints. However, DE has been shown to have certain weaknesses, such as slow convergence,the accuracy of solutions are not high. In this paper, we propose an improved differential evolution based on orthogonal design, and we call it ODE (Orthogonal Differential Evolution). ODE makes DE faster and more robust. It uses a novel and robust crossover based on orthogonal design and generates an optimal offspring by a statistical optimal method. A new selection strategy is applied to decrease the number of generations and make the algorithm converge faster. We evaluate ODE to solve twelve benchmark function optimization problems with a large number of local minimal. Simulations results show that ODE is able to find the near-optimal solutions in all cases. Compared to other state-of-the-art evolutionary algorithms, ODE performs significantly better in terms of the quality, speed, and stability of the final solutions.


Differential Evolution Orthogonal Array Benchmark Function Orthogonal Design Fast Convergence Speed 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bäck, T., Schwefel, H.-P.: An overview of evolutionary algorithms for parameter optimization. Evolutionary Computation 1, 1–23 (1993)CrossRefGoogle Scholar
  2. 2.
    Storn, R., Price, K.: Differential evolution–A simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization 11, 341–359 (1997)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Tao, G., Li-shan, K.: A new Evolutionary Algorithm for Function Optimization. Wuhan University Journal of Nature Sciences 4, 409–414 (1999)MATHCrossRefGoogle Scholar
  4. 4.
    Yao, X., Liu, Y., Lin, G.: Evolutionary Programming Made Faster. IEEE Transactions on Evolutionary Computation 3, 82–102 (1999)CrossRefGoogle Scholar
  5. 5.
    Leung, Y.W., Wang, Y.: An Orthogonal Genetic Algorithm with Quantization for Global Numerical Optimization. IEEE Transactions on Evolutionary Computation 5, 41–53 (2001)CrossRefGoogle Scholar
  6. 6.
    Ding, C.M., Zhang, C.S., Liu, G.Z.: Orthogonal Experimental Genetic Algorithms and Its Application in Function Optimization (in Chinese). Systems Engineering and Electronics 10, 57–60 (1997)Google Scholar
  7. 7.
    Kui-fan, S., Ji-wen, D., Jin-ping, L., et al.: Orthogonal Genetic Algorithm (in Chinese). ACTA ELECTRONICA SINICA 10, 1501–1504 (2002)Google Scholar
  8. 8.
    San-You, Z., Wei, W., Li-Shan, K., et al.: A Multi-Objective Evolutionary Algorithm Based on Orthogonal Design (in Chinese). Chinese Journal of Computers 28, 1153–1162 (2005)Google Scholar
  9. 9.
    Fang, K.T., Ma, C.X.: Orthogonal and Uniform Design (in Chinese). Science Press (2001)Google Scholar
  10. 10.
    Price, K., Storn, R.: Home Page of Differential Evolution (2003), available http://www.ICSI.Berkeley.edu/~storn/code.html

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Wenyin Gong
    • 1
  • Zhihua Cai
    • 1
    • 2
  • Charles X. Ling
    • 2
  1. 1.School of Computer ScienceChina University of GeosciencesWuhanP.R. China
  2. 2.Dept. of computer scienceThe University of Western Ontario LondonOntarioCanada

Personalised recommendations