Ceo rad - PDF (1.3 MB)

More documents

Recommendations

Info

186 Paralelizacija GA za rešavanje nekih NP-kompletnih problema ⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯ http://www.mai.liu.se/~kahol/abstracts/Abstr-ULoc.txt [Hlm97a] Holmberg K., Ling J., "A Lagrangean Heuristic for the Facility Location Problem with Staircase Costs", European Journal of Operational Research, Vol. 97, pp. 63-74 (1997). http://www.mai.liu.se/~kahol/papers/Rep-ScLoc.ps.gz [Hlm97b] Holmberg K., Hellstrand J., "Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound", Operations Research (1997). http://www.mai.liu.se/~kahol/papers/Rep-NDbabsub.ps.gz [Hmf93] Homaifar A., Guan S., Liepins G.E., "A New Approach on the Traveling Salesman Problem by Genetic Algorithms", In: Proceedings of the Fifth International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, Calif., pp. 460-466 (1993). [Hmf94] Homaifar A., Lai S.H., Qi X., "Constrained optimization via genetic algorithms, Simulation, Vol. 62, pp. 242-254 (1994). [Hoc91] Hockney R., ”Performance parameters and benchmarking of supercomputers”, Parallel Computing, Vol. 17, pp. 1111-1130 (1991). [Hoc94] Hockney R., Berry M., ”Public international benchmarks for parallel computers”, parkbench committee report, Scientific Programming, Vol. 3, No. 2, pp. 101-146 (1994). [Hof91] Hoffmeister F., "The User's Guide to Escapade 1.2: A Runtime Environment for Evolution Strategies", Department of Computer Science, University of Dortmund, Germany (1991). [Hou95] Houck C.R., Joines J.A., Kay M.G., "Comparison of Genetic Algorithms, Random Restart, and Two-Opt Switching for Solving Large Location- Allocation Problems", Techical Report, Department of Industrial Engineering, North Carolina State University, Raleigh, NC (1995). ftp://ftp.eos.ncsu.edu/pub/simul/GAOT/papers/gala.ps.gz [Hug89] Hughes M., "Genetic Algorithm Workbench Documentation", Cambridge Consultants, Cambridge, UK (1989). [Ip83] Ip M.Y.L., Saxton L.V., Raghavan V.V., "On the Selection of an Optimal Set of Indexes", IEEE Transactions on Software Engineering, Vol. 9, pp. 135-143 (1983). [Jan91] Janikow C.Z., Michalewicz Z., "An Experimental Comparasion of Binary and Floating Point Representations in Genetic Algorithms", In: Proceedings of the Fourth International Conference on Genetic Algorithms - ICGA '91, Morgan Kaufmann, San Mateo, Calif., pp. 37-44 (1991). [Jog89] Jog P., Suh J.Y., Van Gucht D., "The effects of Population size, Heuristic Crossover and Local Improvement on a Genetic Algorithm for the Traveling Salesman Problem", In: Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, Calif., pp. 110-115 (1989). [Jog90] Jog P., Suh J.Y., Van Gucht D., "Parallel Genetic Algorithms Applied to the Traveling Salesman Problem", Technical Report 314, Indiana University (1990). [Joh77] Johnson D.S., "Efficient algorithms for shortest paths in sparse networks", Journal of the ACM, Vol. 24, No. 1, pp. 1-13 (1977). [Joh78] Johnson D.S., Lenstra J.K., Rinnooy Kan A.H.G., "The Complexity of the Network Design Problem", Networks, Vol. 8, pp. 279-285 (1978). [Joh97] Johnson D.S., McGeoch L.A., "The Traveling Salesman Problem: A Case Study in Local Optimization", Local Search in Combinatorial Optimization, eds. Aarts E.H.L., Lenstra J.K., John Wiley & Sons Ltd., pp. 215-310 (1997).
Literatura 187 ⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯ [Jon95] Jones P.C., Lowe T.J., Muller G., Xu N., Yinyu Y., Zydiak J.L., "Specially Structured Uncapacitated Facility Location Problems", Operations Research, Vol. 43., No. 4, pp. 661-669 (1995). [Jun98] Jungnickel D., "Graphs, Networks and Algorithms", Springer Verlag, Berlin (1998). [Kam92] Kamel N., King R., "Intelligent Database Caching Through the Use of Page-Answers and Page-Traces", ACM Transactions on Database Systems, Vol. 17, No. 4, pp. 601-646 (December 1992). [Khu94] Khuri S., Back T., Heitkotter J., "An Evolutionary Approach to Combinatorial Optimization Problems", In: Proceedings of CSC '94, Phoenix, Arizona (1994). ftp://lumpi.informatik.uni-dortmund.de/pub/GA/papers/csc94.ps.gz [Kid93] Kido T., Kitano H., Nakanishi M., "A hybrid search for genetic algorithms: Combining genetic algorithms, tabu search, and simulated annealing", In: Proceedings of the Fifth International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, Calif., pp. 614 (1993). [Kir83] Kirkpatrick S., Gellat C., Vecchi M., "Optimization by simulated annealing", Science, Vol. 220, pp. 671-680 (1983). [Kno89] Knox J., "The application of TABU search to the symmetric traveling salesman problem", PhD dissertation, University of Colorado (1989). [Knu73] Knuth D.E., "The Art of Computer Programming", second edition, Addison- Wesley, Reading, MA (1973). [Koe89] Koerkel M., "On the exact solution of large-scale simple plant location problems", European Journal of Operational Research, Vol. 39, pp. 157- 173 (1989). [Kon98] Konchady M., "Parallel Computing Using LINUX", LINUX Journal, pp. 78- 81, January 1998. [Kor65] Kornai J., Liptak T., "Two-level planning", Econometrica, Vol. 33, pp. 141- [Koz93] 169 (1965). Koza J.R., "Genetic programming: On the programming of computers by means of natural selection", MIT Press, Cambridge, MA (1993). [Kra94] Kratica J., "Paralelizacija funkcionalnih programskih jezika i implementacija na transpjuterskim sistemima", Magistarski rad, Univerzitet u Beogradu, Matematički fakultet (1994). http://alas.matf.bg.ac.yu/~kratica/msc.pdf [Kra96a] [Kra96b] Kratica J., Filipović V., Šešum V., Tošić D., "Solving of the uncapacitated warehouse location problem using a simple genetic algorithm", In: Proceedings of the XIV International conference on material handling and warehousing, Faculty of Mechanical Engineering, Belgrade, pp. 3.33 - 3.37 (1996). http://alas.matf.bg.ac.yu/~kratica/cmhw96.pdf Kratica J., Radojević S., Filipović V., Šćepanović A., "Primena epsilontransformacije u problemu pretrage drveta", Međunarodni naučno-razvojni simpozijum: Stvaralaštvo kao uslov privrednog razvoja - Nove tehnologije i tehnike u službi čoveka, u štampi, Beograd (1996). http://alas.matf.bg.ac.yu/~kratica/ntt96.pdf [Kra97a] Kratica J., "Napredne tehnike genetskih algoritama i njihova implementacija", Prolećna škola o programskim jezicima, Institut za Matematiku PMF, Novi Sad, str. 123-130 (1997). http://alas.matf.bg.ac.yu/~kratica/pspj97.pdf [Kra97b] Kratica J., Radojević S., Šešum V., "Jedna metoda poboljšanja vremena izvršavanja prostog genetskog algoritma", XXIII Jupiter konferencija, Zbornik radova, Mašinski Fakultet, Beograd, str. 457 - 462 (1997).
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: 136 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?