Ceo rad - PDF (1.3 MB)

More documents

Recommendations

Info

176 Paralelizacija GA za rešavanje nekih NP-kompletnih problema ⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯ svakog procesa, a zatim elemente rezultujućeg vektora deli na delove, i šalje redom procesima od 0, 1, ... n-1. Osim osnovnih sistemskih operatora, mogu se koristiti i operatori koje je definisao korisnik. Oni se prethodno moraju kreirati naredbom MPI_Op_create(opfunc, commute, pop), gde je opfunc definicija date korisničke funkcije, a pop je pokazivač na kreirani operator. Ukoliko nam neki od korisnički definisanih operatora više nije potreban, može se ukloniti naredbom MPI_Op_free(pop).
LITERATURA [Abr95] [Ack87] [Aik85] [Akl89] [Aln95] [AlS96] [Alv92] [Ant89] [Aqe90] [Ard95] [Ard96a] [Ard96b] Abramson D., De Silva A., "A Parallel Interior Point Algorithm and its Application to Facility Location Problems", Research Report CIT:95-12, School of Computing and Information Technology, Griffith University, Nathan (1995). Ackley D.H., "An empirical study of bit vector function optimization", In: Genetic algorithms and Simulated Annealing, Davis L. (ed), chapter 13, pp. 170-204 (1987). Aikens C.H., "Facility location models for distribution planning", European Journal of Operational Research, Vol. 22, pp.263-279 (1985). Akl S., "Design and Analysis of Parallel Algorithms", Prentice-Hall International, Englewoods Cliffs, NJ (1989). Alander J.T., "Indexed bibliography of genetic algorithms in operations research", Report 94-1-OR, University of Vassa, Department of Information Technology and Production Economics (1995). ftp://ftp.uwasa.fi/cs/report94-1/gaORbib.ps.Z Al-Sultan K., Hussain M., Nizami J, "A genetic algorithm for the set covering problem", Journal of the Operational Research Society, Vol. 47, pp. 702-709 (1996). Alves M.L., Almeida M.T., "Simulated Annealing Algorithm for the Simple Plant Location Problem: A Computational Study", Revista Investigaçăo, Vol. 12 (1992). Antonisse J., "A new interpretation of schema that overturns the binary encoding constraint", In: Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, Calif., pp. 86-91 (1989). Aqeev A.A., Beresnev V.S., "Polynomially Solvable Cases of the Simple Plant Location Problem", In: Proceeding of the First Integer Programming and Combinatorial Optimization Conference, Kannan R. and Pulleyblank W.R. (eds), University of Waterloo Press, ON, Canada, pp. 1-6 (1990) Aardal K., van Hoesel S., "Polyhedral Techniques in Combinatorial Optimization II: Computations", Technical Report UU-CS-1995-42, Department of Computer Science, Utrecht University, 44 p. (1995). http://www.cs.ruu.nl/~aardal/survey1.ps Aardal K., Labbe M., Leung J., Queyranne M., "On the Two-Level Uncapacitated Facility Location Problem", Informs Journal of Computing, Vol. 8, pp. 289-301 (1996). http://smg.ulb.ac.be/Preprints/Aardal94_15.html Aardal K., van Hoesel S., "Polyhedral Techniques in Combinatorial Optimization I: Theory", Statistica Neerlandica, Vol. 50, No. 1, pp. 3-26 (1996). http://www.cs.ruu.nl/~aardal/survey2.ps
Page 1:
Univerzitet u Beogradu Matematički
Page 5:
Ovaj rad posvećujem mojim najdraž
Page 9:
Parallelization of the genetic algo
Page 12 and 13:
neophodne literature. Posebno se za
Page 14 and 15:
14 Paralelizacija GA za rešavanje
Page 16 and 17:
Page 18 and 19:
Page 20 and 21:
Page 22 and 23:
Page 24 and 25:
Page 26 and 27:
Page 28 and 29:
Page 30 and 31:
Page 32 and 33:
Page 34 and 35:
Page 36 and 37:
Page 38 and 39:
Page 40 and 41:
Page 42 and 43:
Page 44 and 45:
Page 46 and 47:
Page 48 and 49:
Page 50 and 51:
Page 52 and 53:
Page 54 and 55:
Page 56 and 57:
Page 58 and 59:
Page 60 and 61:
Page 62 and 63:
Page 64 and 65:
Page 66 and 67:
Page 68 and 69:
Page 70 and 71:
Page 72 and 73:
Page 74 and 75:
Page 76 and 77:
Page 78 and 79:
Page 80 and 81:
Page 82 and 83:
Page 84 and 85:
Page 86 and 87:
Page 88 and 89:
Page 90 and 91:
Page 92 and 93:
Page 94 and 95:
Page 96 and 97:
Page 98 and 99:
Page 100 and 101:
Page 102 and 103:
Page 104 and 105:
Page 106 and 107:
Page 108 and 109:
Page 110 and 111:
Page 112 and 113:
Page 114 and 115:
Page 116 and 117:
Page 118 and 119:
Page 120 and 121:
Page 122 and 123:
Page 124 and 125:
Page 126 and 127: 126 Paralelizacija GA za rešavanje
Page 196 and 197: SADRŽAJ 1. UVOD 13 1.1 Složenost
Page 198 and 199: 2.5.1.6 Neregularan završetak izvr
Page 200 and 201: 7.3 GA implementacija 108 7.3.1 Kod
Page 202 and 203: SPISAK SLIKA Slika 1.1 Shematski za
Page 204 and 205: Tabela C.23 Instance AG i AH 161 Ta
Page 206 and 207: MPI message passing interface stand
Page 208 and 209: štampanje izveštaja, 60 uklanjanj
Page 210: ezultati izvršavanja ISP, 111 keš
show all

Ceo rad - PDF (1.3 MB)

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?