An Improved Heuristic for the Bandwidth Minimization Based on Genetic Programming

Created by W.Langdon from gp-bibliography.bib Revision:1.4208

  author =       "Petrica C. Pop and Oliviu Matei",
  title =        "An Improved Heuristic for the Bandwidth Minimization
                 Based on Genetic Programming",
  booktitle =    "Proceedings of the 6th International Conference Hybrid
                 Artificial Intelligent Systems (HAIS 2011) Part {II}",
  year =         "2011",
  editor =       "Emilio Corchado and Marek Kurzynski and 
                 Michal Wozniak",
  volume =       "6679",
  series =       "Lecture Notes in Computer Science",
  pages =        "67--74",
  address =      "Wroclaw, Poland",
  month =        may # " 23-25",
  publisher =    "Springer",
  keywords =     "genetic algorithms, genetic programming",
  isbn13 =       "978-3-642-21221-5",
  DOI =          "doi:10.1007/978-3-642-21222-2_9",
  size =         "8 page",
  abstract =     "In this work we develop an improved heuristic based on
                 genetic programming (GP) for the matrix bandwidth
                 minimisation problem (MBMP). This problem consists in
                 rearranging the rows and columns of a sparse matrix
                 such that the non-zero elements are in a band as close
                 as possible to the main diagonal. We evaluated our
                 heuristic on a set of 25 benchmark instances from the
                 literature and compared with state-of-the-art
                 algorithms. The obtained results are very encouraging
                 and point out that GP is an appropriate method for
                 solving the MBMP.",
  affiliation =  "Dept. of Mathematics and Informatics, North University
                 of Baia Mare, Romania",
  bibdate =      "2012-03-19",
  bibsource =    "DBLP,

Genetic Programming entries for Petrica C Pop Oliviu Matei