Comparison of Three Evolutionary Algorithms: GA, PSO, and DE

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.

[1]  Ling Wang,et al.  Scheduling multi-objective job shops using a memetic algorithm based on differential evolution , 2008 .

[2]  Voratas Kachitvichyanukul,et al.  Movement Strategies for Multi-Objective Particle Swarm Optimization , 2010, Int. J. Appl. Metaheuristic Comput..

[3]  Chompoonoot Kasemset,et al.  Bi-level multi-objective mathematical model for job-shop scheduling: the application of Theory of Constraints , 2010 .

[4]  R. Storn,et al.  Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series) , 2005 .

[5]  Zhiming Wu,et al.  An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems , 2005, Comput. Ind. Eng..

[6]  Federico Barber,et al.  An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes , 2009 .

[7]  Voratas Kachitvichyanukul,et al.  A class-based storage warehouse design using a particle swarm optimisation algorithm , 2012 .

[8]  Weijun Xia,et al.  A hybrid particle swarm optimization approach for the job-shop scheduling problem , 2006 .

[9]  Mitsuo Gen,et al.  Multistage-Based Genetic Algorithm for Flexible Job-Shop Scheduling Problem , 2009 .

[10]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[11]  Keith L. Downing,et al.  Introduction to Evolutionary Algorithms , 2006 .

[12]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[13]  Voratas Kachitvichyanukul,et al.  Multi‐depot Vehicle Routing Problem with Pickup and Delivery Requests , 2010 .

[14]  Voratas Kachitvichyanukul,et al.  A Particle Swarm Optimisation for Vehicle Routing Problem with Time Windows , 2009 .

[15]  Chompoonoot Kasemset,et al.  A PSO-based procedure for a bi-level multi-objective TOC-based job-shop scheduling problem , 2012 .

[16]  Mehmet Fatih Tasgetiren,et al.  A discrete differential evolution algorithm for the permutation flowshop scheduling problem , 2007, GECCO '07.

[17]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[18]  Voratas Kachitvichyanukul,et al.  A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery , 2009, Comput. Oper. Res..

[19]  R. Storn,et al.  Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces , 2004 .

[20]  Ali Amiri,et al.  Production , Manufacturing and Logistics Designing a distribution network in a supply chain system : Formulation and efficient solution procedure , 2005 .

[21]  Voratas Kachitvichyanukul,et al.  Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem , 2009, Comput. Ind. Eng..

[22]  Michael E. Wall,et al.  Galib: a c++ library of genetic algorithm components , 1996 .

[23]  Christian Prins,et al.  A simple and effective evolutionary algorithm for the vehicle routing problem , 2004, Comput. Oper. Res..

[24]  Bassem Jarboui,et al.  A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems , 2008, Appl. Math. Comput..

[25]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[26]  Mitsuo Gen,et al.  Network Models and Optimization: Multiobjective Genetic Algorithm Approach , 2008 .

[27]  Ling Wang,et al.  An effective hybrid particle swarm optimization for no-wait flow shop scheduling , 2007 .

[28]  Voratas Kachitvichyanukul,et al.  A two-level Particle Swarm Optimisation algorithm on Job-Shop Scheduling Problems , 2009 .

[29]  Pierre Borne,et al.  Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems , 2002, IEEE Trans. Syst. Man Cybern. Part C.

[30]  Voratas Kachitvichyanukul,et al.  Differential Evolution Algorithm for Job Shop Scheduling Problem , 2011 .

[31]  Voratas Kachitvichyanukul,et al.  An efficient differential evolution algorithm for multi-mode resource-constrained project scheduling problems , 2012 .

[32]  Yanchun Liang,et al.  An Effective PSO and AIS-Based Hybrid Intelligent Algorithm for Job-Shop Scheduling , 2008, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[33]  Voratas Kachitvichyanukul,et al.  A two-stage genetic algorithm for multi-objective job shop scheduling problems , 2011, J. Intell. Manuf..

[34]  Magdalene Marinaki,et al.  A hybrid genetic - Particle Swarm Optimization Algorithm for the vehicle routing problem , 2010, Expert Syst. Appl..

[35]  Godfrey C. Onwubolu,et al.  Scheduling flow shops using differential evolution algorithm , 2006, Eur. J. Oper. Res..

[36]  U. Purintrapiban,et al.  A NON-HOMOGENOUS PARTICLE SWARM OPTIMIZATION WITH MULTIPLE SOCIAL STRUCTURES , 2022 .

[37]  Rajan Batta,et al.  On the use of genetic algorithms to solve location problems , 2002, Comput. Oper. Res..

[38]  Heung-Suk Hwang,et al.  An improved model for vehicle routing problem with time constraint based on genetic algorithm , 2002 .

[39]  Voratas Kachitvichyanukul,et al.  Two enhanced differential evolution algorithms for job shop scheduling problems , 2012 .

[40]  Cem Canel,et al.  An algorithm for the capacitated, multi-commodity multi-period facility location problem , 2001, Comput. Oper. Res..

[41]  Bo Liu,et al.  An Effective PSO-Based Memetic Algorithm for Flow Shop Scheduling , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[42]  Imed Kacem,et al.  Genetic algorithm for the flexible job-shop scheduling problem , 2003, SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483).

[43]  Francisco Saldanha-da-Gama,et al.  Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning , 2006, Comput. Oper. Res..

[44]  Barrie M. Baker,et al.  A genetic algorithm for the vehicle routing problem , 2003, Comput. Oper. Res..

[45]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[46]  M. Gen,et al.  Study on multi-stage logistic chain network: a spanning tree-based genetic algorithm approach , 2002 .

[47]  Voratas Kachitvichyanukul,et al.  A two-stage PSO algorithm for job shop scheduling problem , 2011 .

[48]  Mario Vanhoucke,et al.  A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem , 2010, Eur. J. Oper. Res..

[49]  Kap Hwan Kim,et al.  A Comparative Analysis: Various Storage Rules in Container Yards and Their Performances , 2012 .

[50]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .