Ceo rad - PDF (1.3 MB)

More documents

Recommendations

Info

184 Paralelizacija GA za rešavanje nekih NP-kompletnih problema ⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯ [GolA93] Goldberg A. V., "Scaling Algorithms for the Shortest Paths Problem", In: Proceedings of the 4nd ACM-SIAM Symposium on Discrete Algorithms, pp. 222-231 (1993). [Grd93] Gordon S., Whitley D., "Serial and parallel genetic algorithms as function optimizers", In: Proceedings of the Fifth International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, Calif., pp. 177-183 (1993). http://www.cs.colostate.edu/~ftppub/TechReports/1993/tr-114.ps.Z [Grg89] Gorges-Schleuter M., Asparagos: An Asynchronous Parallel Genetic Optimisation Strategy", In: Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, Calif., pp. 416-421 (1989). [Grg91] Gorges-Schleuter M., "Explicit parallelism of genetic algorithms through population structures", In: Parallel Problem Solving from Nature - PPSN , Schwefel H.P. and Manner R. (eds.), Springer-Verlag, Berlin, pp. 150-159 (1991). [Gre84] Grefenstette J.J., "Genesis: A system for Using Genetic Search Procedures", In: Proceedings of the Conference on Intelligent Systems and Machines, pp. 161-165 (1984). [Gre85] Grefenstette J.J., Gopal R., Rosmaita R., Gucht D.V., "Genetic Algorithms for the traveling salesman problem", In: Proceedings of an International Conference of Genetic Algorithms and Their Applications, Texas Instrument and U.S. Navy Center for Applied Research and Artificial Intelligence, pp. 154-159 (1985). [Gre86] Grefenstette J.J., "Optimization of control parameters for genetic algorithms", IEEE Transactions on Systems, Man and Cybernetics, Vol 16, pp. 122-128 (1986). [Gre87] Grefenstette J.J., "Incorporating problem specific knowledge into genetic algorithms", In: Genetic Algorithms and Simulated Annealing, L.Davis, (ed.),chap. 4, pp. 42-60, Pitman (1987). [Gre93] Grefenstette J.J., "Deception considered harmful", In: Foundations Of Genetic Algorithms - FOGA 2, D. Whitley (ed.), pp. 75-91, Morgan Kaufmann (1993). [Grf87] Griffiths G., Carlyle Stones G., "The Tea-Leaf Reader Algorithm: An Efficient Implementation of CRC-16 and CRC-32", Communications of the ACM, Vol. 30, No. 7, pp. 617-620 (1987). [Grn72] Garfinkel R., Nemhauser G., "Integer Programming", John Wiley & Sons Inc., New York (1972). [Gro94] Gropp W., Lusk E., Skjellum A., "Using MPI: Portable Parallel Programming with the Message-Passing Interface", MIT Press, Cambridge (1994). http://www.mcs.anl.gov/mpi/usingmpi/index.html [Gro96a] Gropp W., Doss N., "Instalation Guide to mpich, an Portable Implementation of MPI", Technical Report ANL/MCS-TM-ANL-96/5, Argonne National Laboratory, Department of Computer Science, University of Chicago, 45 p. (1996). ftp://ftp.mcs.anl.gov/pub/mpi/install.ps.Z [Gro96b] Gropp W., Lusk E., "User's Guide for mpich, a Portable Implementation of MPI", Technical Report ANL/MCS-TM-ANL-96/6, Argonne National Laboratory, Department of Computer Science, University of Chicago, 51 p. (1996). ftp://ftp.mcs.anl.gov/pub/mpi/userguide.ps.Z [Gro96c] Gropp W., Lusk E., Doss N., Skjellum A., "A high-performance portable implementation of the MPI message-passing interface standard", Parallel Computing, Vol. 22, pp. 789-828 (1996).
Literatura 185 ⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯ http://www.mcs.anl.gov/mpi/mpich/ [Gro97] Gropp W., Lusk E., Doss N., Skjellum A., "MPICH Model MPI Implementation: Reference Manual", Technical Report ANL-00, Argonne National Laboratory, Department of Computer Science, University of Chicago, 176 p. (1997). [Grö95] Grötschel M., Monma C.L., Stoer M., "Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements", Operations Research, Vol. 43, No. 6, pp. 1012-1024 (1995). [Grs94] Grishukhin V.P., "On polynomial solvability conditions for the simplest plant location problem", In: Selected topics in discrete mathematics, Kelmans A.K. and Ivanov S. (eds), American Mathematical Society, Providence, RI, pp. 37-46 (1994) [Gui88] Guignard M., "A Lagrangean dual ascent algorithm for simple plant location problems", European Journal of Operational Research, Vol. 35, pp. 193-200 (1988). [Han99] Hansen P., Mladenović N., "An Introduction to Variable Neighborhood Search", In: Meta-Heuristics: Advances and Trends in Local Search Pa<strong>rad</strong>igms for Optimization, Voss S., Martello S., Osman I.H., Roucairol C. (eds.), Kluwer Academic Publishers, pp. 433-458 (1999). [Hat85] Hatzopoulos M., Kollias J.G., "On the selection of a reduced set of indexes", The Computer Journal, Vol. 28, pp. 406-408 (1985). [Hei93] Heitkoetter J., Beasley D., "The Hitch-Hiker's Guide to Evolutionary computation", FAQ in comp.ai.genetic , (1993). ftp://rtfm.mit.edu/pub/usenet/news.answers/ai-faq/genetic/ [Hel92] Hellstrand J., Larsson T., Migdalas A., "A Characterization of the Uncapacitated Network Design Polytope", Operations Research Letters, Vol. 12, pp. 159-163 (1992). [Hel94] Helstrand J., Holmberg K., "A Lagrangean Heuristic Applied to the Uncapacitated Network Design Problem", Technical Report LiTH- MAT/OPT-WP-1994-04, Department of Mathematics, Linköping Institute of Technology, Sweden (1994). [Her97] Hertz A., Taillard E., de Werra D., "Tabu search", In: Local Search in Combinatorial Optimization, Aarts E.H.L. and Lenstra J.K. (eds.), John Wiley & Sons Ltd., pp. 121-136 (1997). [Hil98] Hill J., Warren M., Goda P., ”Loki”, LINUX Journal, pp. 56-60, January 1998. [Hll75] Holland J.H., "Adaptation in Natural and Artificial Systems", The University of Michigan Press, Ann Arbor (1975). [Hlm86] Holmberg K., Jörnsten K., Migdalas A., "Decomposition methods applied to discrete network design", Technical Report LiTH-MAT/OPT-WP-1986-07, Department of Mathematics, Linköping Institute of Technology, Sweden (1986). [Hlm90] Holmberg K., "On the Convergence of Cross Decomposition", [Hlm91] Mathematical Programming, Vol. 47, pp. 269-296 (1990). Holmberg K., Migdalas A., "Solution Methods for the Discrete Choice Network Design Problem Combining Lagrangean Relaxation and Decomposition with Generation of Valid Inequalities", Technical Report LiTH-MAT/OPT-WP-1991-07, Department of Mathematics, Linköping Institute of Technology, Sweden (1991). [Hlm95] Holmberg K., "Experiments with primal-dual decomposition and subg<strong>rad</strong>ient methods for the uncapacitated facility location problem", Research Report LiTH-MAT/OPT-WP-1995-08, Optimization Group, Department of Mathematics, Linkoping Institute of Technology, Sweden (1995).
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:
Page 128 and 129:
Page 130 and 131:
Page 132 and 133:
Page 134 and 135: 134 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?