Scribd Logo
Upload

Welcome to Scribd!

  • 01 CC 99334100501 CDB 15 A&0

    Uploaded by

    Birce Boga
    17 views7 pages

    Original Title

    01cc99334100501cdb15a&0

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    17 views7 pages

    01 CC 99334100501 CDB 15 A&0

    Uploaded by

    Birce Boga

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    of 7
    Genetic Algorithms Applied to Computationally Difficult Set Covering Problems L, A.N. Lorena; L. de Souza Lopes The Journal of the Operational Research Society, Vol. 48, No. 4. (Apr., 1997), pp. 440-445, Stable URL hhup:/flinks,jstor-org/sicisici=0 160-5682% 28199 704% 2948%3A4%3C440%3AGAATCD%3E 0.00% 3B2-2 The Journal of the Operational Research Society is currently published by Operational Research Society. ‘Your use of the ISTOR archive indicates your acceptance of JSTOR’s Terms and Conditions of Use, available at hup:/www stor orglabout/terms.html. ISTOR’s Terms and Conditions of Use provides, in par, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may be obtained at hhupulwww.jstor.org/journals/ors.htm Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the sercen or printed page of such transmission. STOR is an independent not-for-profit organization dedicated to creating and preserving a digital archive of scholarly journals. For more information regarding JSTOR, please contact support @ jstor.org, hupulwww jstor.org/ ri Mar 24 07:12:24 2006 Journal of the Operational Research Socety (1997) 48, MO-5 (©1997 Operant Retr Society Le. Al rigs reserve 0160-58257 $1200 BR Genetic algorithms applied to computationally difficult set covering problems LAN Lorena and L de Souza Lopes LACANPE, Instituto Nacional de Pesquisas Espacias, Brazil ‘The set covering problem is a known NP-hard combinatorial optimisation problem for covering the rows ofa matrix by 4 subset of columns at minimum cost. Genetic algorithms (GA) are a class of iteration procedures that simulate the evolution process of a structured population. The objective of this work is to show that a somewhat classical GA {implementation reaches high quality computational results for dificult set covering problems arising in computing the [width of incidence matrices of Steiner tiple systems. In computational tests all optimal and best known solutions were found for incidence matrices Ay, Ais, dar. Ags, dey and Azqs with reasonable times for a. microcomputer implementation. Other tests with classical set covering problems confirm the good results for an additional class of, instances. Keynor netic algorithms; optimisation; set covering problems Introduction Genetic algorithms! (GA) are a class of iteration procedures that simulate the evolution process of a structured popula- tion. An important application of GA is the heuristic solution of difficult combinatorial optimisation problems.” Successful applications of GA to these problems need a codification for the solution space, the setting of a certain number of parameters and, possibly, the use of specialized ‘genetic operators. This work describes a direct application ‘of GA to a very important combinatorial optimisation problem, the Set Covering Problem (SCP). ‘The Set Covering Problem (SCP) is defined by Min ex subject to Arde, xe (0,1), where A (m x n) is a matrix of zeros and ones, ¢ is the cost vector associated to the variables, is a vector of ones, and if column j is considered in the solution (otherwise x,=0). SCP is the problem of covering the rows of a given matrix by a subset of columns with minimum cost. ‘The SCP and the Set Partitioning Problem (same problem but considering equality constraints, Ax=b) are known to be NP-hard,’ and they present important applica- tions in scheduling, location, routing, and other areas.”-"" Different algorithms and heuristics are proposed in the literature" CComespondence: Dr LAN Lorena, LACANPE, Instituto Nacional de Peagulsas Espacias, Av. das’ Atoonauias 1788, Cate Postal 15, 12227-010 Sao José dos Campos, SP, Brazil. Recently Beasley and Chu'* obiained very good compu- tational results for classical SCP using a specialised GA. ‘The objective of this work is to show that a somewhat classical GA implementation reaches high quality computa- tional results for the difficult set covering problems arising in computing the I-width of incidence matrices of Steiner triple systems." All the well-known characteristics of a GA are directly used, except fora greedy heuristic used for setting the inital population and a dynamic mutation opera- tor. For each population all solutions are made feasible using 2 feasibility operator and performing some local search, The fitness function is directly derived from the objective fune- tion of SCP. In computational tests all optimal and best {known solutions were found for incidence matrices Ay Ars, Aa, Aas, Agi and Apes, with reasonable times for microcomputer implementation. A subset of the standard set covering instances considered in Beasley and Chu are also examined with very competitive results. ‘The difficult set covering problems ‘The difficult set covering problems examined in this paper arise in computing the L-width of incidence matrices of Steiner triple systems. The f-width of a zero-one matrix A with m rows and 7 columns, is the minimum number of ‘columns that can be selected from A such that all row sums. Of the resulting sub-matrix are at least f. The I-width ‘matrices obtained from Steiner triple systems have the following characteristies: «Each row has exactly three ones: (ij, ) isa triple from A if there exists a row r such that a,,= ay; =a= 1; Unto Sos esentutl i st ceg ples ‘* for each column pair ' and j” there is exactly one row i such that ay = ‘© such matrices exist if and only if» > 3 and mod(n,6) =3, in which case m=n(n — 1)/6; «© each column has exactly (n — 1)/2 non-null entries. Hall? discusses this structure in detail and presents @ standard technigue for the reeursive generation of Steiner triples for n=3* (k= 1,2,3,...). Asis the matrix 1 x 3 of ‘ones. Ay is obtained from 1 in the following way Let the columns of As, be indexed as (GDI

    You might also like