JOURNAL BROWSE
Search
Advanced SearchSearch Tips
Comparison of Three Evolutionary Algorithms: GA, PSO, and DE
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Comparison of Three Evolutionary Algorithms: GA, PSO, and DE
Kachitvichyanukul, Voratas;
  PDF(new window)
 Abstract
This paper focuses on three very similar evolutionary algorithms: genetic algorithm (GA), particle swarm optimization (PSO), and differential evolution (DE). While GA is more suitable for discrete optimization, PSO and DE are more natural for continuous optimization. The paper first gives a brief introduction to the three EA techniques to highlight the common computational procedures. The general observations on the similarities and differences among the three algorithms based on computational steps are discussed, contrasting the basic performances of algorithms. Summary of relevant literatures is given on job shop, flexible job shop, vehicle routing, location-allocation, and multimode resource constrained project scheduling problems.
 Keywords
Evolutionary Algorithm;Genetic Algorithm;Particle Swarm Optimization;Differential Evolution;
 Language
English
 Cited by
1.
Application of Adaptive Particle Swarm Optimization to Bi-level Job-Shop Scheduling Problem,;

Industrial Engineering and Management Systems, 2014. vol.13. 1, pp.43-51 crossref(new window)
2.
Evolutionary Algorithm-based Space Diversity for Imperfect Channel Estimation,;;;

KSII Transactions on Internet and Information Systems (TIIS), 2014. vol.8. 5, pp.1588-1603 crossref(new window)
1.
Application of Adaptive Particle Swarm Optimization to Bi-level Job-Shop Scheduling Problem, Industrial Engineering and Management Systems, 2014, 13, 1, 43  crossref(new windwow)
2.
An Orthogonal Learning Differential Evolution Algorithm for Remote Sensing Image Registration, Mathematical Problems in Engineering, 2014, 2014, 1563-5147, 1  crossref(new windwow)
3.
An Improved Polynomial Neural Network Classifier Using Real-Coded Genetic Algorithm, IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2015, 45, 11, 1389  crossref(new windwow)
4.
Transport Aircraft Conceptual Design Optimization Using Real Coded Genetic Algorithm, International Journal of Aerospace Engineering, 2016, 2016, 1687-5974, 1  crossref(new windwow)
5.
Optimizing Greenhouse Lighting for Advanced Agriculture Based on Real Time Electricity Market Price, Mathematical Problems in Engineering, 2017, 2017, 1563-5147, 1  crossref(new windwow)
6.
An Improved Multi-Objective Particle Swarm Optimization Algorithm Based on Adaptive Local Search, International Journal of Applied Evolutionary Computation, 2017, 8, 2, 1  crossref(new windwow)
7.
A multi-release software reliability modeling for open source software incorporating dependent fault detection process, Annals of Operations Research, 2017, 1572-9338  crossref(new windwow)
8.
Intrusion detection of distributed denial of service attack in cloud, Cluster Computing, 2017, 1573-7543  crossref(new windwow)
 References
1.
Ai, T. J. and Kachitvichyanukul, V. (2009a), A particle swarm optimization for the heterogeneous fleet vehicle routing problem, International Journal of Logistics and SCM Systems, 3(1), 32-39.

2.
Ai, T. J. and Kachitvichyanukul, V. (2009b), A particle swarm optimization for vehicle routing problem with time windows, International Journal of Operational Research, 6(4), 519-537. crossref(new window)

3.
Ai, T. J. and Kachitvichyanukul, V. (2009c), A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery, Computers and Operations Research, 36(5), 1693-1702. crossref(new window)

4.
Ai, T. J. and Kachitvichyanukul, V. (2009d), Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem, Computers and Industrial Engineering, 56(1), 380- 387. crossref(new window)

5.
Amiri, A. (2006), Designing a distribution network in a supply chain system: formulation and efficient solution procedure, European Journal of Operational Research, 171(2), 567-576. crossref(new window)

6.
Baker, B. M. and Ayechew, M. A. (2003), A genetic algorithm for the vehicle routing problem, Computers and Operations Research, 30(5), 787-800. crossref(new window)

7.
Canel, C., Khumawala, B. M., Law, J., and Loh, A. (2001), An algorithm for the capacitated, multicommodity multi-period facility location problem, Computers and Operations Research, 28(5), 411- 427. crossref(new window)

8.
Ge, H.-W., Sun, L., Liang, Y.-C., and Qian, F. (2008), An effective PSO and AIS-based hybrid intelligent algorithm for job-shop scheduling, IEEE Transactions on Systems, Man and Cybernetics, Part A: Systems and Humans, 38(2), 358-368. crossref(new window)

9.
Gen, M. and Cheng, R. (1997), Genetic Algorithms and Engineering Design, Wiley, New York, NY.

10.
Gen, M., Cheng, R., and Lin, L. (2008), Network Models and Optimization: Multiobjective Genetic Algorithm Approach, Springer, London, UK.

11.
Godfrey, O. and Donald, D. (2006), Scheduling flow shops using differential evolution algorithm, European Journal of Operational Research, 171(2), 674-692. crossref(new window)

12.
Goldberg, D. E. (1989), Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley Pub., Reading, MA.

13.
Hassan, R., Cohanim, B., de Weck, O., and Venter, G. (2005), A comparison of particle swarm optimization and the genetic algorithm, Proceedings of the 1st AIAA Multidisciplinary Design Optimization Specialist Conference, Austin, TX.

14.
Holland, J. H. (1975), Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence, University of Michigan Press, Ann Arbor, MI.

15.
Hwang, H.-S. (2002), An improved model for vehicle routing problem with time constraint based on genetic algorithm, Computers and Industrial Engineering, 42(2-4), 361-369. crossref(new window)

16.
Jaramillo, J. H., Bhadury, J., and Batta, R. (2002), On the use of genetic algorithms to solve location problems, Computers and Operations Research, 29(6), 761-779. crossref(new window)

17.
Jarboui, B., Damak, N., Sirry, P., and Rebai, A. (2008), A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems, Applied Mathematics and Computation, 195(1), 299-308. crossref(new window)

18.
Kacem, I., Hammadi, S., and Borne, P. (2002), Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems, IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 32(1), 1-13 crossref(new window)

19.
Kachitvichyanukul, V., Vinaipanit, M., and Kungwalsong, K. (2010), A genetic algorithm for multicommodity distribution network design of supply chain, International Journal of Logistics and Transport, 4(2), 167-181.

20.
Kachitvichyanukul, V. and Sitthitham, S. (2011), A twostage genetic algorithm for multi-objective job shop scheduling problems, Journal of Intelligent Manufacturing, 22(3), 355-365. crossref(new window)

21.
Kasemset, C. and Kachitvichyanukul, V. (2010), Bi-level multi-objective mathematical model for job-shop scheduling: the application of theory of constraints, International Journal of Production Research, 48 (20), 6137-6154. crossref(new window)

22.
Kasemset, C. and Kachitvichyanukul, V. (2012), A PSObased procedure for a bi-level multi-objective TOCbased job-shop scheduling problem, International Journal of Operational Research, 14(1), 50-69. crossref(new window)

23.
Kennedy, J. and Eberhart, R. (1995), Particle swarm optimization, Proceedings of IEEE International Conference on Neural Networks, Perth, WA, 1942-1948.

24.
Liu, B., Wang, L., and Jin, Y.-H. (2007a), An effective hybrid particle swarm optimization for no-wait flow shop scheduling, The International Journal of Advanced Manufacturing Technology, 31(9/10), 1001- 1011. crossref(new window)

25.
Liu, B., Wang, L., and Jin, Y.-H. (2007b), An effective PSO-based memetic algorithm for flow shop scheduling, IEEE Transactions on Systems, Man, and Cybernetics Part B, 37(1), 18-27. crossref(new window)

26.
Lova, A., Tormos, P., Cervantes, M., and Barber, F. (2009), An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes, International Journal of Production Economics, 117(2), 302-316. crossref(new window)

27.
Marinakis, Y. and Marinaki, M. (2010), A hybrid genetic- particle swarm optimization algorithm for the vehicle routing problem, Expert Systems with Applications, 37(2), 1446-1455. crossref(new window)

28.
Melo, M. T., Nickel, S., and Saldanha de Gama, F. (2006), Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning, Computers and Operations Research, 33(1), 181-208. crossref(new window)

29.
Nguyen, S., Ai, T. J., and Kachitvichyanukul, V. (2010), Object Library for Evolutionary Techniques (ETLib): User's Manual, Asian Institute of Technology, Tailand.

30.
Nguyen, S. and Kachitvichyanukul, V. (2010), Movement strategies for multi-objective particle swarm optimization, International Journal of Applied Metaheuristic Computing, 1(3), 59-79. crossref(new window)

31.
Nguyen, S. and Kachitvichyanukul, V. (2012), An efficient differential evolution algorithm for multimode resource constrained project scheduling problems, International Journal of Operational Research (Accepted March 2012).

32.
Pan, Q.-K., Tasgetiren, M. F., and Liang, Y.-C. (2008), A discrete differential evolution algorithm for the permutation flowshop scheduling problem, Computers and Industrial Engineering, 55(4), 795-816. crossref(new window)

33.
Van Peteghem, V. and Vanhoucke, M. (2010), A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem, European Journal of Operational Research, 201(2), 409-418. crossref(new window)

34.
Pezzella, F., Morganti, G., and Ciaschetti, G. (2008), A genetic algorithm for the flexible job-shop scheduling problem, Computers and Operations Research, 35(10), 3202-3212. crossref(new window)

35.
Pongchairerks, P. and Kachitvichyanukul, V. (2005), A non-homogenous particle swarm optimization with multiple social structures, Proceedings of the International Conference on Simulation and Modeling, Bangkok, Thailand.

36.
Pongchairerks, P. and Kachitvichyanukul, V. (2009), A two-level particle swarm optimisation algorithm on job-shop scheduling problems, International Journal of Operational Research, 4(4), 390-411. crossref(new window)

37.
Pratchayaborirak, T. and Kachitvichyanukul, V. (2011), A two-stage PSO algorithm for job shop scheduling problem, International Journal of Management Science and Engineering Management, 6(2), 84-93

38.
Price, K. V., Storn, R. M., and Lampinen, J. A. (2005), Differential Evolution: A Practical Approach to Global Optimization, Springer, Berlin, Germany.

39.
Prins, C. (2004) A simple and effective evolutionary algorithm for the vehicle routing problem, Computers and Operations Research, 31(12), 1985-2002. crossref(new window)

40.
Qian, B., Wang, L., Huang, D.-X., and Wang, W. (2008), Scheduling multi-objective job shops using a memetic algorithm based on differential evolution, The International Journal of Advanced Manufacturing Technology, 35(9-10), 1014-1027. crossref(new window)

41.
Sombuntham, P. and Kachitvichyanukul, V. (2010), Multi- depot vehicle routing problem with pickup and delivery requests, Proceedings of the International MultiConference of Engineers and Computer Scientists, Hong Kong, 71-85.

42.
Sooksaksun, N., Kachitvichyanukul, V., and Gong, D.-C. (2012), A class-based storage warehouse design using a particle swarm optimisation algorithm, International Journal of Operational Research, 13(2), 219-237. crossref(new window)

43.
Storn, R. and Price, K. (1995), Differential evolution-a simple and efficient adaptive scheme for global optimization over continuous spaces, Technical Report TR-95-012, International Computer Science Institute, Berkeley, CA.

44.
Syarif, A., Yun, Y., and Gen, M. (2002), Study on multistage logistic chain network: a spanning tree-based genetic algorithm approach, Computers and Industrial Engineering, 43(1/2), 299-314. crossref(new window)

45.
Wall, M. (1996), GAlib: A C++ library of genetic algorithm components, http://lancet.mit.edu/ga/.

46.
Wisittipanich, W. and Kachitvichyanukul, V. (2011), Differential evolution algorithm for job shop scheduling problem, Industrial Engineering and Management Systems, 10(3), 203-208. crossref(new window)

47.
Wisittipanich, W. and Kachitvichyanukul, V. (2012), Two enhanced differential evolution algorithms for job shop scheduling problems, International Journal of Production Research, 50(10), 2757-2773. crossref(new window)

48.
Xia, W. and Wu, Z. (2005), An effective hybrid optimization approach for multi-objective flexible jobshop scheduling problems, Computers and Industrial Engineering, 48(2), 409-425. crossref(new window)

49.
Xia, W. and Wu, Z. (2006), A hybrid particle swarm optimization approach for the job-shop scheduling problem, The International Journal of Advanced Manufacturing Technology, 29(3/4), 360-366. crossref(new window)

50.
Yu, X. and Gen, M. (2010), Introduction to Evolutionary Algorithms, Springer, London, UK.

51.
Zhang, H. and Gen, M. (2005), Multistage-based genetic algorithm for flexible job-shop scheduling problem, Journal of Complexity International, 11, 223-232.