Metrika članka

  • citati u SCindeksu: 0
  • citati u CrossRef-u:0
  • citati u Google Scholaru:[=>]
  • posete u poslednjih 30 dana:6
  • preuzimanja u poslednjih 30 dana:4
članak: 3 od 3  
Back povratak na rezultate
Yugoslav Journal of Operations Research
2011, vol. 21, br. 2, str. 225-238
jezik rada: engleski
vrsta rada: neklasifikovan
objavljeno: 12/01/2012
doi: 10.2298/YJOR1102225K
A new genetic representation for quadratic assignment problem
(naslov ne postoji na srpskom)
aSrpska akademija nauke i umetnosti (SANU), Matematički institut, Beograd
bUniverzitet u Beogradu, Matematički fakultet

e-adresa: jkratica@mi.sanu.ac.rs, dtosic@matf.bg.ac.rs, vladaf@matf.bg.ac.rs, dugosija@matf.bg.ac.rs

Projekat

Matematički Modeli i Metode Optimizacije Velikih Sistema (MPNTR - 174010)

Sažetak

(ne postoji na srpskom)
In this paper, we propose a new genetic encoding for well known Quadratic Assignment Problem (QAP). The new encoding schemes are implemented with appropriate objective function and modified genetic operators. The numerical experiments were carried out on the standard QAPLIB data sets known from the literature. The presented results show that in all cases proposed genetic algorithm reached known optimal solutions in reasonable time.

Ključne reči

Reference

Abraham, A., Nedjah, N., Mourelle, L. (2006) Evolutionary computation: From genetic algorithms to genetic programming. u: Nedjah N., i dr. [ur.] Studies in computational intelligence, Springer, str. 1-20
Aleret, R.M., Valls, J., Fernandez, O. (2007) Evolving generalized euclidean distances for training RBNN. Computing and Informatics, 26 (1) 33-43
Ben-David, G., Malah, D. (2005) Bounds on the Performance of Vector-Quantizers Under Channel Errors. IEEE Transactions on Information Theory, 51(6): 2227-2235
Davendra, D., Zelinka, I. (2009) Optimization of quadratic assignment problem using self organizing migrating algorithm. Computing and Informatics, 28 (2), 169-180
Drezner, Z. (2005) Compounded genetic algorithms for the quadratic assignment problem. Operations Research Letters, 33(5): 475-480
Drezner, Z. (2005) The extended concentric tabu for the quadratic assignment problem. European Journal of Operational Research, 160(2): 416-422
Drezner, Z. (2008) Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem. Computers & Operations Research, 35(3): 717-736
Duman, E., Or, I. (2007) The quadratic assignment problem in the context of the printed circuit board assembly process. Computers & Operations Research, 34(1): 163-179
Đurić, B., Kratica, J., Tošić, D., Filipović, V. (2008) Solving the maximally balanced connected partition problem in graphs by using genetic algorithm. Computing and Informatics, 27 (3), 341-354
el-Baz Adel, M. (2004) A genetic algorithm for facility layout problems of different manufacturing environments. Computers and Industrial Engineering, 47, 233-246
Filipović, V. (2003) Fine-grained tournament selection operator in genetic algorithms. Computing and Informatics, vol. 22, br. 2, str. 143-161
Hani, Y., Amodeo, L., Yalaoui, F., Chen, H. (2007) Ant colony optimization for solving an industrial layout problem. European Journal of Operational Research, 183(2): 633-642
Holland, J.H. (1975) Adaptation in natural and artificial Systems: an Introductory Analysis with Applications to Biology, Control, and ArtificialIntelligence. Ann Arbor: The University of Michigan Press
James, T., Rego, C., Glover, F. (2009) A cooperative parallel tabu search algorithm for the quadratic assignment problem. European Journal of Operational Research, 195(3): 810-826
Khamis, A.M., Girgis, M.R., Ghiduk, A.S. (2007) Automatic software test data generation for spanning sets coverage using genetic algorithms. Computing and Informatics, 26 (4) 383-401
Koopmans, T.C., Beckmann, M.J. (1957) Assignment problems and the location of economic activities. Econometrica, 25, 53-76
Kratica, J., Stanimirovic, Z., Tokic, D., Filipovic, V. (2007) Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem. European Journal of Operational Research, 182(1): 15-28
Kratica, J., Kovačević-Vujčić, V., Čangalović, M. (2008) Computing strong metric dimension of some special classes of graphs by genetic algorithms. Yugoslav Journal of Operations Research, vol. 18, br. 2, str. 143-151
Kratica, J.J. (1999) Improving performances of the genetic algorithm by caching. Computers and artificial intelligence, 18(3): 271-283
Liu, H., Abraham, A., Zhang, J. (2007) A particle swarm approach to quadratic assignment problems. u: Saad A., i dr. [ur.] Advances in soft computing, Springer Verlag, 39, 213-222
Liu, H., Abraham, A. (2007) An hybrid fuzzy variable neighborhood particle swarm optimization algorithm for solving quadratic assignment problems. Journal of Universal Computer Science, 13 (9) 1309-1331
Loiola, E.M., de Abreu, N.M.M., Boaventura-Netto, P.O., Hahn, P., Querido, T. (2007) A survey for the quadratic assignment problem. European Journal of Operational Research, 176(2): 657-690
Misevicius, A. (2003) A modified simulated annealing algorithm for the quadratic assignment problem. Informatica (Vilnius), 14(4): 497
Misevicius, A. (2005) A Tabu Search Algorithm for the Quadratic Assignment Problem. Computational Optimization and Applications, 30(1): 95-111
Mitchell, M. (1999) An introduction to genetic algorithms. Cambridge, MA, itd: Massachusetts Institute of Technology Press / MIT Press
Oliveira, C.A.S., Pardalos, P.M., Resende, M.G.G. (2004) GRASP with path-relinking for the quadratic assignment problem. Lecture Notes in Computer Science, 3059, str. 356-368
Qahrisaremi, H., Abedin, B., Meimandkermani, A. (2008) Website structure improvement: Quadratic assignment problem approach and ant colony meta-heuristic technique. Applied Mathematics and Computation, 195(1): 285-298
Sahni, S., Gonzalez, T. (1976) P-complete approximation problems. J. Assoc. Comput. Mach, 23, 555-565
Singh, S.P., Sharma, R.R.K. (2008) Two-level modified simulated annealing based approach for solving facility layout problem. International Journal of Production Research, 46(13): 3563-3582
Stutzle, T. (2006) Iterated local search for the quadratic assignment problem. European Journal of Operational Research, 174(3): 1519-1539
Tao, J., Wang, N., Wang, X. (2007) Genetic algorithm based recurrent fuzzy neural network modeling of chemical processes. Journal of Universal Computer Science, 13 (9) 1332-1343
Tseng, L., Liang, S. (2006) A Hybrid Metaheuristic for the Quadratic Assignment Problem. Computational Optimization and Applications, 34(1): 85-113
Wang, R.L., Okazaki, K. (2005) Solving facility layout problem using an improved genetic algorithm. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, E88a (2) 606-610
Wess, B., Zeitlhofer, T. (2004) On the phase coupling problem between data memory layout generation and address pointer assignment. Lecture Notes in Computer Science, 3199, str. 152-166