David Levine. A Parallel Genetic Algorithm for the Set Partitioning Problem. PhD thesis, Illinois Institute of Technology, Mathematics and Computer Science Division, Argonne National Laboratory, 9700 South Cass Avenue, Argonne, IL 60439, USA, May 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....exchange of hints that may confuse some search processes, but will also help others. Overall, hint sharing improves the performance and has been used with success to design search heuristics in the context of constraint satisfaction problems [3] 8] and to parallelize some metaheuristics [13] [14], 16] 17] The present paper introduces the Cooperative Multilevel Hypergraph Partitioning algorithm (CoMHP) an asynchronous variation for hypergraph partitioning of the cooperative algorithm in [18] Our hypergraph partitioning method uses a new netlist coarsening strategy which is based on ....

D. Levine. A Parallel Genetic Algorithm for the Set Partitioning Problem. In Meta-Heuristics: Theory and Applications, pages 23-35. Kluwer Academic Publishers, 1996.

....and in such a way that the number of subsets in C (i.e. jC j) is minimized. One application of this problem is air crew scheduling, in which a set of ights must be covered by a collection of available crew members [7, 16] although the similar problem SET PARTITION is more commonly applied [10]. A second application of this problem is in the area of software testing [17, 18, 19, 20] for which the set of program elements requiring testing and the collection of potential input sets (test cases) are exactly represented by the components of the MINIMUM COVER problem. The related problem ....

...., or by limiting the cardinality of the c in C. 2.1.1 Limits on the Frequency of Occurence of the Elements of S Subproblems of MINIMUM COVER can be created by placing restrictions on the frequency of occurrence of the elements of S among the elements of C. The frequency can be bounded from above [10] or from both above and below simultaneously [2] In the rst case, the frequency of occurrence of the elements of S among the elements of C is bounded from above by a constant UB. No more than UB occurrences of the s 2 S can occur within the c 2 C. When UB is arbitrary the problem is MINIMUM ....

David Levine. A Parallel Genetic Algorithm for the Set Partitioning Problem. PhD thesis, Illinois Institute of Technology, 1990.

....EA mimics the natural process by maintaining many individual solutions and causing reproductions among them, resulting in a survival of the fittest solutions. Evolutionary algorithm has often been used to solve attack several kinds of problems in various fields, such as set partitioning problem [13], school timetabling problem [8] and so on. In some problems with a very large problem size, a simple EA may take a large amount of time so parallel Evolutionary algorithm has been developed to help increase their running time. Parallel Evolutionary algorithm (PEA) has been implemented mostly ....

.... each processor performs selection and crossover operations independently on its own population and only exchanges individuals occasionally, the communication overheads required in this model are much less than in the others, making it the most popular method for implementing PEA, as can be seen in [7, 12, 13]. This paper, however, chooses to implement a synchronous master slave model because it is easy to implement and, unlike the other two methods, does not change the way the EA works. Coarse grained PEA performs migration whose e#ects are not yet completely understood and its di#erence from simple ....

Levine, D., A Parallel Genetic Algorithm for the Set Partitioning Problem, Report ANL-94/23, Argonne National Laboratory, May, 1994.

....provided an effective method of obtaining a good feasible solution by imposing additional structure, derived from the real world problem but not already implicit in the mathematical model. With the rising interest in evolutionary algorithms and their application to combinatorial problems, Levine [14] experimented with a parallel genetic algorithm and applied it to the SPP. Although his algorithm was capable of finding optimal solutions for some problems having up to a few thousand columns, it had difficulty finding feasible solutions for problems having many rows. Of particular interest to ....

....infeasible solutions. In fact, since finding a feasible solution to the SPP is difficult, it may be that the majority of the solutions generated by the GA are infeasible. There are two approaches to defining the fitness of an individual. The most common approach is the use of a penalty function [14, 16, 18]. Penalty methods allow constraints to be violated. Depending on the magnitude of the violation, however, a penalty that is proportional to the size of the infeasibility is incurred that degrades the objective function. If the penalty is large enough, highly infeasible individuals 3 will rarely ....

[Article contains additional citation context not shown here]

D. Levine. A parallel genetic algorithm for the set partitioning problem. PhD thesis, Illinois Institute of Technology, Department of Computer Science, May 1994.

....(China) 439, 656] total 228 articles in 146 series 4.3 Theses The following two lists contain theses, rst PhD theses and then Master s etc. theses, arranged in alphabetical order by the name of the school. 4.3. 1 PhD theses Colorado State University, 128] Illinois Institute of Technology, [371] Louisiana State University of Agricultural and Mechanical College, 320] North Dakota State University of Agriculture and Applied Sciences, 246, 559, 612] Syracuse University, 162] Tampere University of Technology, 465] The Ohio State University, 554] The Pennsylvania State University, ....

....Lee, Shane, 103] Lehmann, H. 711] Lehninger, Albert L. 825] Leiva, A. 215] Leiva, S. 500] Lemarchand, L. 620] Leou, Jin Jang, 681] Leu, M. C. 658] Leutbecher, M. 791] Leuze, Michael R. 582, 583] Levenick, Jim, 170] Levi, Paul, 501] Levin, Michael, 109] Levine, David Mark, [371] Levinson, G. 154] Li, Guo Jie, 271] Li, Guo, 656] Li, Leping, 218] Li, Yan Da, 644] Li, Yong, 618] Liang Jie, Zhang, 171] Liepins, Gunar E. 270] Lin, Chen Sin, 152] Lin, Feng Tse, 755] Lin, G. 403] Lin, Guangming, 439, 216] Lin, Jin Mu, 741] Linden, D. S. 89] Lint, J. H. ....

[Article contains additional citation context not shown here]

David Mark Levine. A parallel genetic algorithm for the set partitioning problem. PhD thesis, Illinois Institute of Technology, 1994. (also as [?], available via anonymous ftp site info.mcs.anl.gov directory /pub/tech reports le ANL9423.ps.Z) * DAI Vol 55 No 5 ga94aLevine.

....of Vaasa, 318] total 5 thesis in 5 schools 4.4 Report series The following list contains references to all papers published as technical reports. The list is arranged in alphabetical order by the name of the institute. Akademie der Wissenschaft der DDR, 351] Argonne National Laboratory, [177] Aristotle University of Thessaloniki, 149] Bolt Beranek and Newman, 395] California Institute of Technology, 344] Carnegie Mellon University, 11, 56] Edinburgh Parallel Computing Centre, 153, 399, 401, 402, 404, 407, 408] Florida Atlantic University, 4] International Computer Science ....

....Lahdelma, Risto, 204, 214] Lahtinen, Jussi, 264] Lampinen, Jouni, 282, 294, 325] Langdon, William Benjamin, 278] Lanitis, A. 45] Laurikkala, Jorma, 326] Lee, Terry, 50] Lee, Woh Chiang, 315] Leitch, Donald Dewar, 166, 202, 228] Le on, H ector Hern andez, 36] Levine, David Mark, [167, 177] Lin, Shyh Chang, 109] Lindfors, Ilpo, 279] L opez, Araceli Y a nez, 37] Lozano, Manuel, 160, 176, 183, 198, 221, 225, 232, 239, 240, 241, 242, 244, 245, 246, 252, 253, 275, 276, 283, 285, 286, 377, 379] Lund, Henrik Hautop, 203, 229, 237] Magyar, G abor, 311] Mahfoud, Samir W. 364, ....

[Article contains additional citation context not shown here]

David Mark Levine. A parallel genetic algorithm for the set partitioning problem. Report ANL-94/23, Argonne National Laboratory, 1994. (also as [167], info.mcs.anl.gov: /pub/tech reports/ ANL9423.ps.Z) * N95-10981 Key: ga94bLevine.

....4.3 Theses The following two lists contain theses, rst PhD theses and then Master s etc. theses, arranged in alphabetical order by the name of the school. 4.3. 1 PhD theses Carleton University, 207] George Mason University, 104] Harvard University, 141] Illinois Institute of Technology, [167] Michigan State University, 109] Oxford University, 202] University of California, 398] University of Durham, 233] University of Edinburgh, 124, 134] University of Hudders eld, 82] University of Illinois at Urbana Champaign, 226, 238] University of London, 278] University of Rochester, ....

....Lahdelma, Risto, 204, 214] Lahtinen, Jussi, 264] Lampinen, Jouni, 282, 294, 325] Langdon, William Benjamin, 278] Lanitis, A. 45] Laurikkala, Jorma, 326] Lee, Terry, 50] Lee, Woh Chiang, 315] Leitch, Donald Dewar, 166, 202, 228] Le on, H ector Hern andez, 36] Levine, David Mark, [167, 177] Lin, Shyh Chang, 109] Lindfors, Ilpo, 279] L opez, Araceli Y a nez, 37] Lozano, Manuel, 160, 176, 183, 198, 221, 225, 232, 239, 240, 241, 242, 244, 245, 246, 252, 253, 275, 276, 283, 285, 286, 377, 379] Lund, Henrik Hautop, 203, 229, 237] Magyar, G abor, 311] Mahfoud, Samir W. 364, ....

[Article contains additional citation context not shown here]

David Mark Levine. A parallel genetic algorithm for the set partitioning problem. PhD thesis, Illinois Institute of Technology, 1994. (also as [177], info.mcs.anl.gov: /pub/tech reports/ ANL9423.ps.Z) * DAI Vol 55 No 5 Key: ga94aLevine.

....Erlangen N urnberg, 105, 114, 128, 491] total 19 thesis in 12 schools Report series 13 4.4 Report series The following list contains references to all papers published as technical reports. The list is arranged in alphabetical order by the name of the institute. Argonne National Laboratory, [138] Aristotle University of Thessaloniki, 80] Carnegie Mellon University, 356] Colorado State University, 517, 519] Electrotechnical Laboratory, 528] Florida Atlantic University, 530] Friedrich Alexander Universit at Erlangen N urnberg, 488] GMD, 454, 455] Indiana University, 58, 500] ....

....A. 230] Kwok, Yu Kwong, 70] Kwong, S. 345] Lam, S. L. Y. 291] Lamont, Gary B. 111, 439] Laszewski, Gregor von, 446] Lawrence, P. D. 121] Lee, C. D. 500] Lee, Jongsoo, 206, 286] Lehndert, R. van, 498] Leuze, Michael R. 468, 469, 470] Levi, Paul, 342] Levine, David Mark, [104, 138] Li, T. 501] Lienig, Jens, 292, 305, 318, 340] Authors 17 Liepins, Gunar E. 432, 433] Lin, G. 168] Lin, Guangming, 247] Lin, S. C. 341] Lin, Shyh Chang, 189] Lindgren, Kristian, 43] Linkens, Derek. A. 434] Lipsitch, Marc, 44] Lishan, Kang, 65] Liu, Luoping, 87] Logar, ....

[Article contains additional citation context not shown here]

David Mark Levine. A parallel genetic algorithm for the set partitioning problem. Report ANL-94/23, Argonne National Laboratory, 1994. (also as [104], available via anonymous ftp site info.mcs.anl.gov directory /pub/tech reports le ANL9423.ps.Z) * N95-10981 ga94bLevine.

....Sci. China) 247] total 114 articles in 85 series 4.3 Theses The following two lists contain theses, rst PhD theses and then Master s etc. theses, arranged in alphabetical order by the name of the school. 4.3. 1 PhD theses Colorado State University, 135] Illinois Institute of Technology, [104] Michigan State University, 485] The University of Iowa, 424] University of Arizona, 149] University of California, 95, 419] University of Dortmund, 404] University of Michigan, 512] University of Missouri Rolla, 395] Universit at Erlangen N urnberg, 331] Universit at der Bremen, 364] ....

....A. 230] Kwok, Yu Kwong, 70] Kwong, S. 345] Lam, S. L. Y. 291] Lamont, Gary B. 111, 439] Laszewski, Gregor von, 446] Lawrence, P. D. 121] Lee, C. D. 500] Lee, Jongsoo, 206, 286] Lehndert, R. van, 498] Leuze, Michael R. 468, 469, 470] Levi, Paul, 342] Levine, David Mark, [104, 138] Li, T. 501] Lienig, Jens, 292, 305, 318, 340] Authors 17 Liepins, Gunar E. 432, 433] Lin, G. 168] Lin, Guangming, 247] Lin, S. C. 341] Lin, Shyh Chang, 189] Lindgren, Kristian, 43] Linkens, Derek. A. 434] Lipsitch, Marc, 44] Lishan, Kang, 65] Liu, Luoping, 87] Logar, ....

[Article contains additional citation context not shown here]

David Mark Levine. A parallel genetic algorithm for the set partitioning problem. PhD thesis, Illinois Institute of Technology, 1994. (also as [138], available via anonymous ftp site info.mcs.anl.gov directory /pub/tech reports le ANL9423.ps.Z) * DAI Vol 55 No 5 ga94aLevine.

....of Vaasa, 278] total 4 thesis in 4 schools 4.4 Report series The following list contains references to all papers published as technical reports. The list is arranged in alphabetical order by the name of the institute. Akademie der Wissenschaft der DDR, 306] Argonne National Laboratory, [136] Aristotle University of Thessaloniki, 107] Bolt Beranek and Newman, 350] California Institute of Technology, 299] Carnegie Mellon University, 11, 44] Edinburgh Parallel Computing Centre, 111, 354, 356, 357, 359, 362, 363] Florida Atlantic University, 4] International Computer Science ....

....[223] Kyuma, Kazuo, 303] Lahdelma, Risto, 163, 174] Lahtinen, Jussi, 224] Lampinen, Jouni, 242, 254, 284] Langdon, William Benjamin, 238] Lanitis, A. 35] Laurikkala, Jorma, 285] Lee, Terry, 39] Lee, Woh Chiang, 275] Leitch, Donald Dewar, 124, 161, 188] Levine, David Mark, [125, 136] Lin, Shyh Chang, 86] Lindfors, Ilpo, 239] Lozano, Manuel, 118, 135, 142, 157, 181, 185, 192, 199, 200, 201, 202, 204, 205, 206, 212, 213, 235, 236, 243, 245, 246, 332, 334] Lund, Henrik Hautop, 162, 189, 197] Magyar, G abor, 271] Mahfoud, Samir W. 319, 344] Authors 15 Makinen, ....

[Article contains additional citation context not shown here]

David Mark Levine. A parallel genetic algorithm for the set partitioning problem. Report ANL-94/23, Argonne National Laboratory, 1994. (also as [125], info.mcs.anl.gov: /pub/tech reports/ ANL9423.ps.Z) y(N95-10981) Key: ga94bLevine.

....first PhD theses and then Master s etc. theses, arranged in alphabetical order by the name of the school. 11 12 Genetic algorithms available via ftp and www 4.3. 1 PhD theses Carleton University, 166] George Mason University, 82] Harvard University, 99] Illinois Institute of Technology, [125] Michigan State University, 86] Oxford University, 161] University of California, 353] University of Durham, 193] University of Huddersfield, 62] University of Illinois at Urbana Champaign, 186, 198] University of London, 238] University of Rochester, 281] University of Southern ....

....[223] Kyuma, Kazuo, 303] Lahdelma, Risto, 163, 174] Lahtinen, Jussi, 224] Lampinen, Jouni, 242, 254, 284] Langdon, William Benjamin, 238] Lanitis, A. 35] Laurikkala, Jorma, 285] Lee, Terry, 39] Lee, Woh Chiang, 275] Leitch, Donald Dewar, 124, 161, 188] Levine, David Mark, [125, 136] Lin, Shyh Chang, 86] Lindfors, Ilpo, 239] Lozano, Manuel, 118, 135, 142, 157, 181, 185, 192, 199, 200, 201, 202, 204, 205, 206, 212, 213, 235, 236, 243, 245, 246, 332, 334] Lund, Henrik Hautop, 162, 189, 197] Magyar, G abor, 271] Mahfoud, Samir W. 319, 344] Authors 15 Makinen, ....

[Article contains additional citation context not shown here]

David Mark Levine. A parallel genetic algorithm for the set partitioning problem. PhD thesis, Illinois Institute of Technology, 1994. (also as [136], info.mcs.anl.gov: /pub/tech reports/ ANL9423.ps.Z) y(DAI Vol 55 No 5) Key: ga94aLevine.

....Hyung, 387] Lees, B. 488] LeFevre, J. 463] Legault, G. 1109] Legey, L. F. L. 464] Leite, J. B. P. 794] Lennox, Barry, 1091] Leong, H. V. 135] Leu, Jia Yann, 355] Leu, M. C. 307] Leung, Henry, 122] Leung, Kwong Sak, 853, 1085] Leung, Yee, 879] Levine, David, [1081] Levitin, Gregory, 469, 1218, 1416] Li, An, 1069] Li, B. 887] Li, F. 206] Li, G. 233] Li, H. 233] Li, Huachao, 880] Li, J. J. 1429] Li, T. 1460] Li, Wei, 829] Li, Y. F. 373] Li, Yin Xiu, 894] Li, Y. 136] Li, Yun, 408, 514] Liang, D. Q. 863] Liao, J. C. ....

.... [1119] interactive, 306] parallel GA, 1188] tournament, 530, 1278] sensoring, 729, 966, 1140] ellipsometer, 589] multi , 207] multisensor fusion, 1189] sensors placement, 742] service restoration, 1200] set covering, 1201] set covering problem, 308] set partitioning, [1081] set covering problem, 264] SGA, 30, 305, 915] shape design, 490, 642, 720, 978, 1002, 1102, 1179, 1234, 1242, 1247] shape design 3D, 631] aerodynamics, 1274, 1292] microwave components, 914] shape design , 293, 486, 1118] ships, 116] sicial sciences social dilemmas, 46] ....

[Article contains additional citation context not shown here]

David Levine. A parallel genetic algorithm for the set partitioning problem. In Osman and Kelly [1484], pages 23--36. yTKKpaa ga96bLevine.

.... [213] George Mason University, 236] Georgia Institute of Technology, 282] Gesamthochschule Wupperthal, 310] HAB Weimar, 273] Harvard University, 190, 342] Helsinki University of Technology, 224, 243, 249, 255, 256] Humboldt Universit at zu Berlin, 277] Illinois Institute of Technology, [162] Imperial College for Science, 289] Indiana University, 336] Institut Imag, 147] Kansas State University, 207] Katholic University of Leuven, 206] Katholieke Universiteit Nijmegen, 234] L Universite des Sciences et Technologiques de Lille, 245] Louisiana State University of Agricultural ....

....[54, 252] Langdon, William Benjamin, 227] Laszewski, Gregor von, 332] Laurikkala, Jorma, 55] Lawo, M. 333] Lay, Ming Yi, 163] Lazio, T. Joseph W. 239] Lee, Baumin, 265] Lee, Bogju, 221] Lee, Jinkoo, 316] Lee, Michael Anthony, 164] Leitch, Donald Dewar, 199] Levine, David Mark, [162] Li, Yong, 383] Lichtfu , H. J. 108] Lin, Chyi Yeu, 281] Lin, Jin Ling, 315] Lin, Shyh Chang, 238] Lin, Wei, 208] Liu, J. 99] Lohbeck, T. K. 109] Lohmann, Reinhard, 335] Lohrmann, Hartmut, 20] Louis, Sushil John, 336] Magdalena, Luis, 165] Maini, Harpal Singh, 186] Mandava, ....

[Article contains additional citation context not shown here]

David Mark Levine. A parallel genetic algorithm for the set partitioning problem. PhD thesis, Illinois Institute of Technology, 1994. (also as [409], available via anonymous ftp site info.mcs.anl.gov directory /pub/tech reports le ANL9423.ps.Z) * DAI Vol 55 No 5 ga94aLevine.

....in such a way that some scoring function is maximized. This is use e.g. in transport scheduling, where a number of aircraft have to be assigned to a number of limited capacity routes in a way that minimizes distance travelled. Both of these problems have been tackled using genetic algorithms [32, 61]. In the cluster analysis problems we are working from a large body of data about the problem at hand. We are interested instead in the kind of problem which is too large for traditional statistical analysis, and where we instead need to provide a strategy for deciding which data to compute in ....

D. Levine. A Parallel Genetic Algorithm for the Set Partitioning Problem. PhD thesis, Illinois Institute of Technology/Argonne National Laboratory, 1994.

No context found.

David Levine. A Parallel Genetic Algorithm for the Set Partitioning Problem. PhD thesis, Illinois Institute of Technology, Mathematics and Computer Science Division, Argonne National Laboratory, 9700 South Cass Avenue, Argonne, IL 60439, USA, May 1994.

No context found.

LEVINE D.: `A Parallel Genetic Algorithm for the Set Partitioning Problem', PhD thesis, Illinois Institute of Technology, Mathematics and Computer Science Division, Argonne National Laboratory, USA, May 1994.

No context found.

LEVINE D.: `A Parallel Genetic Algorithm for the Set Partitioning Problem', PhD thesis, Illinois Institute of Technology, Mathematics and Computer Science Division, Argonne National Laboratory, USA, May 1994.

No context found.

D.Levine, A parallel genetic algorithm for the set partitioning problem, T.R. No. ANL-94/23 (Algonne National Laboratory, Mathematics and Computer Science Division, 1994).

No context found.

D. Levine. A parallel genetic algorithm for the set partitioning problem. In I.H. Osman and J.P. Kelly, editors, Meta-Heuristics: Theory & Applications, pages 23--35. Kluwer Academic Publishers, Boston, MA, USA, 1996.

No context found.

D. Levine. A Parallel Genetic Algorithm for the Set Partitioning Problem. PhD thesis, Illinois Institute of Technology, Department of Computer Science, 1994.

No context found.

Levine, D., (1994), A Parallel Genetic Algorithm for the Set Partitioning Problem, ANL-94/23, Argonne National Laboratory.

No context found.

D. Levine. A parallel genetic algorithm for the set partitioning problem. In I.H. Osman and J.P. Kelly, editors, Meta-Heuristics: Theory & Applications, pages 23--35. Kluwer, Norwell, MA, 1996.

No context found.

David Mark Levine. A parallel genetic algorithm for the set partitioning problem. Report ANL-94/23, Argonne National Laboratory, 1994. (also as [179], available via anonymous ftp site info.mcs.anl.gov directory /pub/tech reports file ANL9423.ps.Z) y(N95-10981) ga94bLevine.

No context found.

David Mark Levine. A parallel genetic algorithm for the set partitioning problem. PhD thesis, Illinois Institute of Technology, 1994. (also as [180], available via anonymous ftp site info.mcs.anl.gov directory /pub/tech reports file ANL9423.ps.Z) y(DAI Vol 55 No 5) ga94aLevine.

No context found.

David Mark Levine. A parallel genetic algorithm for the set partitioning problem. Report ANL-94/23, Argonne National Laboratory, 1994. (also as [162], available via anonymous ftp site info.mcs.anl.gov directory /pub/tech reports le ANL9423.ps.Z) * N95-10981 ga94bLevine.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC