Hybrid ant models with a transition policy for solving a complex problem

Logic Journal of the IGPL

Volumn 20, Issue 3, 2012, Pages 560-569

  Pintea, Camelia M ^a   Crişan, Gloria Cerasela ^b   Chira, Camelia ^c  

^a George Cosbuc N College   (Romania)

^b Vasile Alecsandri University   (Romania)

^c BABE BOLYAI UNIVERSITY   (Romania)

Author keywords

Ant colony optimization; Hybrid models; Local search; Matrix bandwidth minimization problem

Indexed keywords

BANDWIDTH; LOCAL SEARCH (OPTIMIZATION); MATRIX ALGEBRA; PROBLEM SOLVING;

ANT MODEL; APPLICATIONS DOMAINS; BANDWIDTH MINIMIZATION PROBLEM; COMBINATORIAL PROBLEM; COMPLEX PROBLEMS; DIVERSE APPLICATIONS; HYBRID MODEL; LOCAL SEARCH; MATRIX; MATRIX BANDWIDTH MINIMIZATION PROBLEM;

ANT COLONY OPTIMIZATION;

EID: 84858775981     PISSN: 13670751     EISSN: 13689894     Source Type: Journal    
DOI: 10.1093/jigpal/jzr004     Document Type: Article

References (27)

1. A. Abraham, E. Corchado, and J. M. Corchado. Hybrid learning machines. Neurocomputing, 72, 13-15, 2729-2730, 2009.
2. A. Blum, G. Konjevod, R. Ravi, and S. Vempala. Semi-definite relaxations for minimum bandwith and other vertex-ordering problems. In Proceedings of the Annual 30th ACM Symposium on the Theory of Computing, pp. 100-105. ACM, 1998.
3. A. Caprara, F. Malucelli, and D. Pretolani. On bandwidth-2 graphs. Discrete Applied Mathematics, 117, 2002.
4. E. Corchado, A. Abraham, and A. C. P. L. F. de Carvalho. Hybrid intelligent algorithms and applications. Information Science, 180, 2633-2634, 2010.
5. E. Corchado, A. Arroyo, and V. Tricio. Soft computing models to identify typical meteorological days. Logic Journal of the IGPL [Epub ahead of print; doi:10.1093/jigpal/jzq035; 21 July 2010].
6. E. Cuthill and J. McKee. Reducing the bandwidth of sparse symmetric matrices. In Proceedings of the 24th National Conference on ACM, pp. 157-172, 1969.
7. M. Dorigo and T. Stützle. Ant Colony Optimization. MIT Press, 2004.
8. A. George. Computer implementation of the finite element method. Technical Report STANCS-71-208, Computer Science Department, Stanford University, 1971.
9. B. L. Golden and A. A. Assad. A decision-theoretic framework for comparing heuristics. European Journal of Operational Research, 18, 167-171, 1984.
10. R. L. Graham. Bounds for certain multiprocessing anomalies. Bell System Technical Journal. 45, 1563-1581, 1966.
11. J. Haralambides, F. Makedon, and B. Monien. Bandwidth minimization: an approximation algorithm for caterpillars. Mathematical Systems Theory, 24, 169-177, 1991.
12. M. Karpinski, J. Wirtgen, and A. Zelikovsky. An approximation algorithm for the bandwidth problem on dense graphs. Technical Report TR 97-017, ECCC, 1997.
13. T. Kloks, D. Kratsch, and H. Müller. Bandwidth of chain graphs. Information Processing Letters, 68, 313-315, 1998.
14. J. H. Legarreta, F. Boto, I. Macía, J. Maiora, G. García, C. Paloc, M. Graña, and M. de Blas. Hybrid decision support system for endovascular aortic aneurysm repair follow-up. In Hybrid Artificial Intelligence Systems, Part I. Vol. 6076 of Lecture Notes in Computer Science, pp. 500-507. Springer, 2010.
15. J. Y.-T. Leung, O. Vornberger, and J. D. Witthoff. On some variants of the bandwidth minimization problem. SIAM Journal on Computing, 13, 650-667, 1984.
16. A. Lim, J. Lin, B. Rodrigues, and F. Xiao. Ant colony optimization with hill climbing for the bandwidth minimization problem. Applied Soft Computing, 6, 180-188, 2006.
17. A. Lim, B. Rodrigues, and F. Xiao. Heuristics for matrix bandwidth reduction. European J ournal of Operational Research, 174, 69-91, 2006.
18. L. Lin and Y. Lin. Two models of two-dimensional bandwidth problems. Information Processing Letters, 110, 469-473, 2010.
19. R. Martí, V. Campos, E. Piñana. A branch and bound algorithm for the matrix bandwidth minimization. European Journal of Operational Research, 186, 513-528, 2008.
20. R. Martí, M. Laguna, F. Glover, and V. Campos. Reducing the bandwidth of a sparse matrix with Tabu search. European Journal of Operation Research, 135, 211-220, 2001.
21. National Institute of Standards and Technology. Matrix Market, Harwell-Boeing Sparse Matrix Collection, http://math.nist.gov/MatrixMarket/data/Harwell-Boeing/ (date last accessed October 2010).
22. C. H. Papadimitriou. The NP-completeness of the bandwidth minimization problem. Computing, 16, 263-270, 1976.
23. E. Piñana, I. Plana, V. Campos, R. Martí. GRASP and Path Relinking for the matrix bandwidth minimization. European Journal of Operational Research, 153, 200-210, 2004.
24. E. Rodriguez-Tello, H. Jin-Kao, and J. Torres-Jimenez. An improved simulated annealing algorithm for the matrix bandwidth minimization. European Journal of Operational Research, 185, 1319-1335, 2008.
25. R. Sun, S. Tatsumi, and G. Zhao. Multiagent reinforcement learning method with an improved ant colony system. IEEE International Conference on Systems, Man, and Cybernetics, 3, 1612-1617, 2001.
26. M. Wozniak and M. Zmyslony. Designing Fusers on the basis of discriminants - evolutionary and neural methods of training. In Hybrid Artificial Intelligence Systems, Part I. Vol. 6076 of Lecture Notes in Computer Science, pp. 590-597. Springer, 2010.
27. T-test, http://www.physics.csbsju.edu/stats/t-test.html (date last accessed October 2010).