Generation of grey patterns using an improved genetic-evolutionary algorithm: Some new results

Information Technology and Control

Volumn 40, Issue 4, 2011, Pages 330-343

  Misevičius, Alfonsas ^a  

^a KAUNAS UNIVERSITY OF TECHNOLOGY   (Lithuania)

Author keywords

Combinatorial optimization; Genetic evolutionary algorithms; Grey pattern problem; Heuristics

Indexed keywords

EID: 84855270376     PISSN: 1392124X     EISSN: None     Source Type: Journal    
DOI: 10.5755/j01.itc.40.4.983     Document Type: Article

References (31)

1. R.M. Aiex, M.G.C. Resende, C.C. Ribeiro. Probability distribution of solution time in GRASP: An experimental investigation. Journal of Heuristics, 2002, Vol.8, 343-373.
2. T. Bäck, D.B. Fogel, Z. Michalewicz (eds). Handbook of Evolutionary Computation. Institute of Physics Publishing, Bristol, 1997.
3. O. Berman, Z. Drezner. The multiple server location problem. Journal of Operational Research Society, 2007, Vol.58, 91-99.
4. R.E. Burkard, E. Çela, P.M. Pardalos, L. Pitsoulis. The quadratic assignment problem. In D.Z. Du, P.M. Pardalos (eds.), Handbook of Combinatorial Optimization, Kluwer, Dordrecht, 1998, Vol.3, 241-337.
5. Z. Drezner. Finding a cluster of points and the grey pattern quadratic assignment problem. OR Spectrum, 2006, Vol.28, 417-436.
6. C. Fleurent, J.A. Ferland. Genetic hybrids for the quadratic assignment problem. In P.M. Pardalos, H. Wolkowicz (eds.), Quadratic Assignment and Related Problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol.16, AMS, Providence, 1994, 173-188.
7. F. Glover, M. Laguna. Tabu search. Kluwer, Dordrecht, 1997.
8. D.E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, 1989.
9. A. Hertz, D. Kobler. A framework for the description of evolutionary algorithms. European Journal of Operational Research, 2000, Vol.126, 1-12.
10. J.H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, 1975.
11. E.L. Lawler. The quadratic assignment problem. Management Science, 1963, Vol.9, 586-599.
12. Z. Michalewicz, D.B. Fogel. How to Solve It: Modern Heuristics. Springer, Berlin-Heidelberg, 2000.
13. A. Misevicius. Genetic algorithm hybridized with ruin and recreate procedure: application to the quadratic assignment problem. Knowledge-Based Systems, 2003, Vol.16, 261-268.
14. A. Misevicius. Ruin and recreate principle based approach for the quadratic assignment problem. In E. Cantú-Paz, J.A. Foster, K. Deb et al. (eds.), Lecture Notes in Computer Science, Vol. 2723: Genetic and Evolutionary Computation-GECCO 2003, Proceedings, Part I, Springer, Berlin-Heidelberg-New York, 2003, 598-609.
15. A. Misevicius. An improved hybrid genetic algorithm: new results for the quadratic assignment problem. Knowledge-Based Systems, 2004, Vol.17, 65-73.
16. A. Misevicius. A tabu search algorithm for the quadratic assignment problem. Computational Optimization and Applications, 2005, Vol.30, 95-111.
17. A. Misevičius. Experiments with hybrid genetic algorithm for the grey pattern problem. Informatica, 2006, Vol.17, 237-258.
18. A. Misevičius. Testing of crossover operators for the grey pattern problem. Ūkio technologinis ir ekonominis vystymas (Technological and Economic Development of Economy), 2006, Vol.17, 37-43.
19. A. Misevičius. Experiments with local search heuristics for the traveling salesman problem. In A. Targamadze R. Butleris, R. Butkienė (eds.), Proceedings of the 16th International Conference on Information and Software Technologies, IT-2010, Technologija, Kaunas, 2010, 47-53.
20. A. Misevičius, A. Lenkevičius, D. Rubliauskas. Iterated tabu search: an improvement to standard tabu search. Information Technology and Control, 2006, Vol.35, 187-197.
21. A. Misevičius, D. Rubliauskas. Enhanced improvement of individuals in genetic algorithms. Information Technology and Control, 2008, Vol.37, No.3, 179-186.
22. A. Misevičius, D. Rubliauskas, V. Barkauskas. Some further experiments with the genetic algorithm for the quadratic assignment problem. Information Technology and Control, 2009, Vol.38, No.4, 325-332.
23. P. Moscato. Memetic algorithms: a short introduction. In D. Corne, M. Dorigo, F. Glover (eds.), New Ideas in Optimization, 1999, McGraw-Hill, London, 219-234.
24. V. Nissen. Solving the quadratic assignment problem with clues from nature. IEEE Transactions on Neural Networks, 1994, Vol.5, 66-72.
25. I. Rechenberg. Evolutionsstrategie: Optimierung Technischer Systeme nach Prinzipien der Biologischen Evolution. Formann-Holzboog Verlag, Stuttgart, 1973.
26. H.-P. Schwefel. Evolutionsstrategie und numerische Optimierung. PhD Thesis, Technische Universität Berlin, Germany, 1975.
27. T. Stützle. MAX-MIN ant system for quadratic assignment problems. Res. Report AIDA-97-04, Darmstadt University of Technology, Germany, 1997.
28. G. Syswerda. Uniform crossover in genetic algorithms. In J.D. Schaffer (ed.), Proceedings of the Third International Conference on Genetic Algorithms, 1989, Morgan Kaufmann, San Mateo, 2-9.
29. E. Taillard. Comparison of iterative searches for the quadratic assignment problem. Location Science, 1995, Vol.3, 87-105.
30. E. Taillard, L.M. Gambardella. Adaptive memories for the quadratic assignment problem. Tech. Report IDSIA-87-97, Lugano, Switzerland, 1997.
31. D.M. Tate, A.E. Smith. A genetic approach to the quadratic assignment problem. Computers & Operations Research, 1995, Vol.1,73-83.