A memetic algorithm for the cyclic antibandwidth maximization problem

The cyclic antibandwidth problem is to embed the vertices of a graph G of n vertices on a cycle Cn such that the minimum distance (measured in the cycle) of adjacent vertices is maximized. Exact results/conjectures for this problem exist in the literature for some standard graphs, such as paths, cycles, two-dimensional meshes, and tori, but no algorithm has been proposed for the general graphs in the literature reviewed by us so far. In this paper, we propose a memetic algorithm for the cyclic antibandwidth problem (MACAB) that can be applied on arbitrary graphs. An important feature of this algorithm is the use of breadth first search generated level structures of a graph to explore a variety of solutions. A novel greedy heuristic is designed which explores these level structures to label the vertices of the graph. The algorithm achieves the exact cyclic antibandwidth of all the standard graphs with known optimal values. Based on our experiments we conjecture the cyclic antibandwidth of three-dimensional meshes, hypercubes, and double stars. Experiments show that results obtained by MACAB are substantially better than those given by genetic algorithm.

[1]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[2]  Juraj Hromkovic,et al.  On Embeddings in Cycles , 1995, Inf. Comput..

[3]  Nidhi Sharma,et al.  An evolutionary algorithm for the 2-page crossing number problem , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[4]  D. J. Cavicchio,et al.  Adaptive search using simulated evolution , 1970 .

[5]  Dan Pritikin,et al.  On the separation number of a graph , 1989, Networks.

[6]  William E. Hart,et al.  Recent Advances in Memetic Algorithms , 2008 .

[7]  A. E. Eiben,et al.  On Evolutionary Exploration and Exploitation , 1998, Fundam. Informaticae.

[8]  Francisco Herrera,et al.  A memetic algorithm using local search chaining forblack-box optimization benchmarking 2009 for noise free functions , 2009, GECCO '09.

[9]  Lawrence J. Fogel,et al.  Artificial Intelligence through Simulated Evolution , 1966 .

[10]  Paola Cappanera.  A Survey on Obnoxious Facility Location Problems , 1999 .

[11]  Sorina Dumitrescu,et al.  On explicit formulas for bandwidth and antibandwidth of hypercubes , 2009, Discret. Appl. Math..

[12]  Hisao Ishibuchi,et al.  Special Issue on Memetic Algorithms , 2007, IEEE Trans. Syst. Man Cybern. Part B.

[13]  Xin Yao,et al.  A Memetic Algorithm for VLSI Floorplanning , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[14]  Hisao Ishibuchi,et al.  Some Issues on the Implementation of Local Search in Evolutionary Multiobjective Optimization , 2004, GECCO.

[15]  Hisao Ishibuchi,et al.  Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling , 2003, IEEE Trans. Evol. Comput..

[16]  Oliver Vornberger,et al.  On Some Variants of the Bandwidth Minimization Problem , 1984, SIAM J. Comput..

[17]  André Raspaud,et al.  Antibandwidth and cyclic antibandwidth of meshes and hypercubes , 2009, Discret. Math..

[18]  Ondrej Sýkora,et al.  The Cyclic Antibandwidth Problem , 2005, Electron. Notes Discret. Math..

[19]  Ruhul A. Sarker,et al.  Memetic algorithms for solving job-shop scheduling problems , 2009, Memetic Comput..

[20]  Kalyanmoy Deb,et al.  A Comparative Analysis of Selection Schemes Used in Genetic Algorithms , 1990, FOGA.

[21]  Bu-Sung Lee,et al.  Memetic algorithm using multi-surrogates for computationally expensive optimization problems , 2007, Soft Comput..

[22]  Natalio Krasnogor,et al.  Editorial to the first issue , 2009, Memetic Comput..

[23]  Habiba Drias,et al.  A memetic algorithm for the optimal winner determination problem , 2009, Soft Comput..

[24]  Ferrante Neri,et al.  An Adaptive Multimeme Algorithm for Designing HIV Multidrug Therapies , 2007, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[25]  Kevin Kok Wai Wong,et al.  Classification of adaptive memetic algorithms: a comparative study , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[26]  Yixun Lin.  Minimum bandwidth problem for embedding graphs in cycles , 1997 .

[27]  Peter I. Cowling,et al.  A Memetic Approach to the Nurse Rostering Problem , 2001, Applied Intelligence.

[28]  JOSEP DÍAZ,et al.  A survey of graph layout problems , 2002, CSUR.

[29]  Pablo Moscato,et al.  A memetic algorithm for the total tardiness single machine scheduling problem , 2001, Eur. J. Oper. Res..

[30]  Shengxiang Yang,et al.  A memetic algorithm with adaptive hill climbing strategy for dynamic optimization problems , 2009, Soft Comput..

[31]  Reeti Sharma,et al.  A new hybrid Evolutionary Algorithm for the MinLA problem , 2009 .

[32]  Jing Tang,et al.  Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems , 2006, Soft Comput..