Hybrid Differential Evolution - Scatter Search Algorithm for Permutative Optimization

Adaptive memory programming approaches have proven effective in finding high quality solutions to many real world intractable problems. Therefore, over the years, researches have attempted to combine the best features from different adaptive memory approaches to derive more powerful hybrid heuristics (Onwubolu, 2002). Combining the best features of different heuristics will give a new heuristic that is superior to the individual systems from which these features are derived. Differential evolution (DE) algorithm (Price, 1999) is an evolutionary approach which does not inhibit any adaptive memory features. It is however a very powerful and robust heuristic for continuous optimization. Continuous optimization is a very important aspect of optimization; however a heuristics application to permutative optimization is imperative if it is to be generic. Permutative optimization encompasses many aspects of engineering. In practical settings, it is common to observe features which are discrete, such as the different discrete nut and bolt sizes, fixed number of machines in a manufacturing plant or discrete number of buses in a fixed route. All these problems are practical and challenging, which utilize discrete values. The purpose of this paper is then to introduce an enhanced different evolution algorithm for discrete optimization which is hybridized by the adaptive memory heuristic of scatter search (SS) (Glover, 1998). SS is a highly effective heuristic which is the superset of tabu search (TS) (Glover, 1998). It has been successfully applied to many permutative optimization problems. The objective of the proposed hybrid optimization approach is then to isolate its highly effective intensification and diversification routines and embed it in the EDE structure. The result is a highly evolved hybrid enhanced differential evolution scatter search (HEDE-SS) heuristic. The hybrid optimization scheme is applied to two difficult permutative optimization problems of quadratic assignment problem (QAP) and the flow shop scheduling problem (FSS). The results generated by the hybrid scheme are then compared with the heuristics of EDE and SS in order to show that the hybrid scheme is an improvement over the original heuristics. Additionally, the results of the hybrid scheme is compared with the optimal results from the operations research (OR) library and with the results obtained by other heuristics for the same problem instances from the literature. O pe n A cc es s D at ab as e w w w .in te ch w eb .o rg

[1]  David Connolly.  An improved annealing scheme for the QAP , 1990 .

[2]  C. Reeves,et al.  Genetic Algorithms, Path Relinking, the Flowshop Sequencing Problem and , 1998 .

[3]  Godfrey C. Onwubolu,et al.  Forward Backward Transformation , 2009 .

[4]  Fred W. Glover,et al.  A Template for Scatter Search and Path Relinking , 1997, Artificial Evolution.

[5]  Godfrey C. Onwubolu,et al.  Enhanced differential evolution hybrid scatter search for discrete optimization , 2007, 2007 IEEE Congress on Evolutionary Computation.

[6]  R. Storn,et al.  Differential Evolution , 2004 .

[7]  Godfrey C. Onwubolu,et al.  Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization , 2009 .

[8]  É. Taillard.  COMPARISON OF ITERATIVE SEARCHES FOR THE QUADRATIC ASSIGNMENT PROBLEM. , 1995 .

[9]  Fred W. Glover,et al.  An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem , 2001, J. Glob. Optim..

[10]  Takeshi Yamada,et al.  Scheduling by Genetic Local Search with Multi-Step Crossover , 1996, PPSN.

[11]  Éric D. Taillard,et al.  Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..

[12]  Godfrey C. Onwubolu,et al.  Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization , 2004 .

[13]  Panos M. Pardalos,et al.  A parallel algorithm for the quadratic assignment problem , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).

[14]  M Dorigo,et al.  Ant colonies for the quadratic assignment problem , 1999, J. Oper. Res. Soc..

[15]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .

[16]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..

[17]  E. Lawler.  The Quadratic Assignment Problem , 1963 .

[18]  V. Cung,et al.  A scatter search based approach for the quadratic assignment problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[19]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

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

[21]  Godfrey C. Onwubolu,et al.  Emerging optimization techniques in production planning and control , 2002 .

[22]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

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

[24]  Stefan Voß,et al.  A Star-Shaped Diversification Approach in Tabu Search , 1996 .

[25]  Charles Fleurent,et al.  Genetic Hybrids for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[26]  H. Sherali,et al.  Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem , 1980 .

[27]  P. Aravindan,et al.  Constructive and improvement flow shop scheduling heuristics: An extensive evaluation , 2001 .

[28]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[29]  Mehmet Sevkli,et al.  Differential Evolution Algorithm for Permutation Flowshop Sequencing Problem with Makespan Criterion , 2004 .

[30]  Vasan Arunachalam,et al.  Optimization Using Differential Evolution , 2008 .

[31]  Nicos Christofides,et al.  An Exact Algorithm for the Quadratic Assignment Problem on a Tree , 1989, Oper. Res..

[32]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[33]  Kenneth V. Price,et al.  An introduction to differential evolution , 1999 .

[34]  Éric D. Taillard,et al.  A heuristic column generation method for the heterogeneous fleet VRP , 1999, RAIRO Oper. Res..

[35]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[36]  Godfrey C. Onwubolu.  Emerging Optimization Techniques , 2002 .