Ceo rad - PDF (1.3 MB)

188 Paralelizacija GA za rešavanje nekih NP-kompletnih problema
⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯
[Kra97c] Kratica J., Stojanović Z., Stojanović Ž., ”Primena genetskih algoritama
za nalaženje optimalne trase cevovoda”, Seminar iz genetskih algoritama,
Matematički fakultet, Beograd, 25.12.1997.
[Kra98a] Kratica J., Ljubić I., Šešum V., Filipović V., "Neke metode za rešavanje
problema trgovačkog putnika pomoću genetskih algoritama", Zbornik
radova sa drugog međunarodnog simpozijuma iz industrijskog inženjerstva,
Mašinski fakultet, Beograd, str. 281-284 (1998).
[Kra98b] Kratica J., Filipović V., Tošić D., "Solving the Uncapacitated Warehouse
Location Problem by SGA with Add-Heuristic", In: Proceedings of the XV
International conference on material handling and warehousing, Faculty of
Mechanical Engineering, Belgrade, pp. 2.28-2.32 (1998).
[Kra99a] Kratica J., "Improvement of Simple Genetic Algorithm for Solving the
Uncapacitated Warehouse Location Problem", In: Advances in Soft
Computing - Engineering Design and Manufacturing, Roy R., Furuhashi T.
and Chawdhry (eds.), Springer-Verlag London Ltd., pp. 390-402 (1999).
[Kra99b] Kratica J., "Improving Performances of the Genetic Algorithm by Caching",
Computers and Artificial Intelligence, Vol. 18, No. 3, pp. 271-283 (1999).
[Kra99c] Kratica J., "Solving the simple plant location problem by genetic
algorithms", Submitted to Operations Research Spektrum (1999).
[Krl94] Karrels E., Lusk E., "Performance analysis of MPI programs", In:
Proceedings of the Workshop on Environments and Tools for Parallel
Scientific Computing, Dongarra J. and Tourancheau B. (eds.), SIAM
Publications (1994).
[Krp72] Karp R., "Reducibility among combinatorial problems", In: Complexity of
Computer Computations, Miller R.E and Thatcher J.W. (eds.), Plenum
Press, New York, NY, pp. 85-104 (1972).
[Krr83] Krarup J., Pruzan P.M., "The simple plant location problem: Survey and
synthesis", European Journal of Operational Research, Vol. 12, pp. 36-81
(1983).
[Krr90] Krarup J., Pruzan P.M., "Ingredients of Locational Analysis", In: Discrete
Location Theory, Mirchandani P.B. and Francis R.L. (eds), John Wiley &
Sons, chap. 3, pp. 120-171 (1990).
[Lam88] Lam J., "An Efficient Simulated Annealing Schedule", PhD dissertation,
Yale University (1988).
[Las91] Laszevski G., Mühlenbien H., "Partitioning a graph with a parallel genetic
algorithm", In: Parallel Problem Solving from Nature - PPSN , Schwefel
H.P. and Manner R. (eds.), Springer-Verlag, Berlin, pp. 165-169 (1991).
[Les93] Lester B., ”The Art of Parallel Programming”, Prentice-Hall Inter.,
Englewood Cliffs, NJ (1993).
[Lew92] Lewis T., El-Rewini H., "Introduction to Parallel Computing", Prentice-Hall
Inter., Englewood Cliffs, NJ (1992).
[Lin82] Lin S., "Effective use of heuristic algorithms in network design",
Proceedings of Symposia in Applied Mathematics, Vol. 26, pp. 63-84
(1982).
[Lju98] Ljubić I., Kratica J., Filipović V., "Primena genetskih algoritama u
nalaženju minimalnog Steinerovog stabla", Zbornik radova sa drugog
međunarodnog simpozijuma iz industrijskog inženjerstva, Mašinski fakultet,
Beograd, str. 277-280 (1998).
[Lou91] Louis S.J., Rawlins G.J.E., ”Designer genetic algorithms: Genetic
algorithms in structure design”, In: Proceedings of the Fourth International
Conference on Genetic Algorithms - ICGA '91, Morgan Kaufmann, San
Mateo, Calif., pp. 53-60 (1991).
[Lov88] Love R.F., Morris J.G., Wesolowshy G.O., Facilities Location: Models &
Methods, North-Holland, New York (1988).