Ceo rad - PDF (1.3 MB)

More documents

Recommendations

Info

194 Paralelizacija GA za rešavanje nekih NP-kompletnih problema ⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯ [Tch95] Tcha D.W., Paik C.H., "Parametric Uncapacitated Facility Location", International Journal of Production Research, Vol. 33, No. 3 (1995). [Tch97] Tcha D.W., Myung Y.S., Kim H.G., "A Bi-objective Model for the Uncapacitated Facility Location Problem", European Journal of Operational Research, Vol. 100, No.3, (1997). [Tnb81] Tanenbaum A.S., "Computer Networks", Prentice Hall, NJ, ISBN: 0-13- 164699-0 (1981). [Tnb92] Tanenbaum A.S., "Modern Operating Systems", Prentice-Hall, NJ (1992). [Tnl83] Tansel B.C., Francis R.L., Lowe T.L., "Location on Networks: A Survey", Management Science, Vol. 29, pp. 482-511 (1983). [Tns87] Tanese R., "Parallel Genetic Algorithms for a Hypercube", In: Proceedings of the Second International Conference on Genetic Algorithms and Their Applications, Lawrence Erlbaum Associates, Hillsdale, New Jersey, pp. 177-183 (1987). [Tns89] Tanese R., "Distributed Genetic Algorithms", In: Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann, San [Toš97] Mateo, Calif., pp. 434-440 (1989). Tošić D., "Pregled razvoja i opis osnovnih karakteristika evolucionih (genetskih) algoritama", Prolećna škola o programskim jezicima, Institut za Matematiku PMF, Novi Sad, str. 115-122 (1997). [Tra89a] Transputer C Library Description, Inmos Corporation (1989). [Tra89b] Transputer Toolset, Inmos Corporation (1989). [Trm00] Trmčić (Ljubić) I., "Primena genetskih algoritama na probleme povezanosti grafova", Magistarski rad, Univerzitet u Beogradu, Matematički fakultet (2000). [Uck93] Uckun S., Bagchi S., Kawamura K., Miyabe Y., "Managing Genetic Search in Job Shop Scheduling", IEEE Expert, pp. 15-24 (October 1993). [Uro96] Urošević D., "Algoritmi u programskom jeziku C", Mikro knjiga, Beograd (1996). [Voi91] Voigt H.M., Born J., Treptow J., "The Evolution Machine Manual - V 2.1", [VRo83] [Vse91a] [Vse91b] [Vss99] [Vug96] [Wat96] [Whi88] [Whi89] Institute for Informatics and Computing Techniques, Berlin (1991). Van Roy T. J., "Cross Decomposition for Mixed Integer Programming", Mathematical Programming, Vol. 25, pp. 46-63 (1983). Vose M.D., "Modeling Simple Genetic Algorithms", In: Foundations of Genetic Algorithms II - FOGA 2, Whitley D. (ed.), Morgan Kaufmann Publishers, San Mateo, California (1992). Vose M., Liepins G., "Schema disruption", In: Proceedings of the Fourth International Conference on Genetic Algorithms - ICGA '91, Morgan Kaufmann, San Mateo, Calif., pp. 237-242 (1991). Voss S., Martello S., Osman I.H., Roucairol C., "Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization", Kluwer Academic Publishers, Boston, MA (1999). Vugdelija M., Kratica J., Filipović V., Radojević S., "Mogućnosti genetskih algoritama u mašinskom učenju", XXII Jupiter konferencija, Zbornik radova, Mašinski Fakultet, Beograd, str. 4.55 - 4.59 (1996). http://alas.matf.bg.ac.yu/~kratica/jup96.pdf Watson F., "Solving the Uncapacitated Facility Location Problem: A Comparison of Decomposition Methods", Informs, Washington, SD16.2 (1996). Whitley D., Kauth J., "Genitor: A Different Genetic Algorithm", In: Proceedings of the Rocky Mountain Conference of Artificial Intelligence, Denver, pp. 118-130 (1988). Whitley D., "The GENITOR Algorithm and Selection Pressure: Why Rank- Based Allocation of Reproductive Trials is Best", In: Proceedings of the
Literatura 195 ⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯ Third International Conference on Genetic Algorithms - ICGA '89, Morgan Kaufmann, San Mateo, Calif., pp. 116-123 (1989). [Whi90] Whitley D., Starkweather T., "Genitor-II: A Distributed Genetic Algorithm", Journal of Experimental Theoretical Artificial Intelligence, Vol. 2, pp. 189- 214 (1990). [Wlh92] Wilhelms J., Van Gelder A., "Octrees for Faster Isosurface Generation", ACM Transactions on Graphics, Vol. 11, No. 3, pp. 201-227 (1992). [Wlk98] Wilkinson B., Allen M., ”Parallel Programming: Techniques and Application Using Networked Workstations and Parallel Computers”, Prentice-Hall, Upper Saddle River, NJ (1998). [Wlm93] Williams R.N., ”A Painless Guide To CRC Error Detection Algorithms” [Wls91] (1993). ftp://ftp.adelaide.edu.au/pub/rocksoft/crc_v3.txt Wilson S.W., "GA-Easy Does Not Imply Steepest-Ascent Optimizable", In: Proceedings of the Fourth International Conference on Genetic Algorithms- ICGA '91, Morgan Kaufmann, San Mateo, Calif., pp. 85-91 (1991). [WMPI98a] ”WMPI 1.2 - The full implementation of MPI for Microsoft Win32 platforms”, Instituto Supererior de Engenharia de Coimbra, Portugal (November 1998). http://dsg.dei.uc.pt/~fafe/w32mpi/ [WMPI98b] ”PaTENT WMPI”, WinPar European Project, Instituto Supererior de Engenharia de Coimbra, Portugal http://www.genias.de/genias_welcome.html [Wol95] [Ynn97] [You96] [Yur94] [Zan89] [Zha96] Wolpert D.H., Macready W.G., "No Free Lunch Theorems for Search", Internal Report, Santa Fe Institute (1995). http://www.dai.ed.ac.uk/groups/evalg/Local_Copies_of_Papers/Wolpert.Ma cready.No_Free_Lunch_Theorems_for_Search.ps.gz Yannakakis M., "Computational Complexity", In: Local Search in Combinatorial Optimization, Aarts E.H.L. and Lenstra J.K. (eds.), John Wiley & Sons Ltd., pp. 19-56 (1997). Young-Soo M., Dong-Wan T., "Feasible Region Reduction Cuts for the Simple Plant Location Problem", Journal of Operations Research Society of Japan, Vol 39, No. 4, pp. 614-622 (1996). Yuret D., "From Genetic Algorithms to Efficient Optimization", MSc Thesis, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science (1994). http://www.dai.ed.ac.uk/groups/evalg/Local_Copies_of_Papers/Yuret.MSc_ Thesis.From_Genetic_Algorithms_to_Efficient_Optimization.ps.gz Zanakis S.H., Evans J.R., Vazacopoulos A.A., "Heuristic methods and applications: a categorized survey", European Journal of Operational Research, Vol. 43, pp. 88-110 (1989). Zhang W., Korf R.E., "A study of complexity transitions on the asymmetric traveling salesman problem", Artificial Intelligence, Vol. 81, pp. 223-239 (1996).
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:
Page 136 and 137:
Page 138 and 139:
Page 140 and 141:
Page 142 and 143:
Page 144 and 145: 144 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?