A hybrid ant-based approach to the economic triangulation problem for input-output tables

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5572 LNAI, Issue , 2009, Pages 376-383

  Pintea, Camelia M ^a   Crisan, Gloria Cerasela ^b,c   Chira, Camelia ^a   Dumitrescu, D ^a  

^a BABE BOLYAI UNIVERSITY   (Romania)

^b VASILE ALECSANDRI UNIVERSITY OF BACAU   (Romania)

^c INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

Author keywords

Ant Colony Optimization; Heuristics; Linear Ordering Problem

Indexed keywords

ANT ALGORITHMS; ANT COLONY OPTIMIZATION; ANT COLONY SYSTEMS; COMBINATORIAL OPTIMIZATION PROBLEMS; COMPLEX SERIES; ECONOMIC DATA; HEURISTICS; HYBRID HEURISTICS; INPUT-OUTPUT; INPUT-OUTPUT TABLE; LINEAR ORDERING PROBLEM; LINEAR ORDERINGS; LOCAL SEARCH; MATRIX; METAHEURISTIC; NP-HARD; TRIANGULATION PROBLEM;

ARTIFICIAL INTELLIGENCE; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; HEURISTIC ALGORITHMS; SET THEORY; TRIANGULATION;

HEURISTIC METHODS;

EID: 70350655406     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02319-4_45     Document Type: Conference Paper

References (17)

1. Pryor, F.L.: Economic evolution and structure: The impact of complexity on the US economic system. Cambridge University Press, Cambridge (1996)
2. Chenery, H.B., Watanabe, T.: International comparisons of the structure of productions. Econometrica 26(4), 487-521 (1958)
3. Reinelt, G.: The linear ordering problem: algorithms and applications. In: Research and Exposition in Mathematics, vol. 8, Heldermann Verlag, Berlin (1985)
4. Chanas, S., Kobylanski, P.: A new heuristic algorithm solving the linear ordering problem. Computational Optimization and Applications 6, 191-205 (1996)
5. Kaas, R.: A branch and bound algorithm for the acyclic subgraph problem. European Journal of Operational Research 8, 355-362 (1981)
6. Mitchell, J.E., Borchers, B.: Solving linear ordering problem with a combined interior point/simplex cutting plane algorithm. In: Frenk, H., Roos, K., Terlaky, T., Zhang, S. (eds.) High Performance Optimization, pp. 349-366. Kluwer Academic Publishers, Dordrecht (2000)
7. Mishra, S., Sikdar, K.: On approximability of linear ordering and related NP-optimization problems in graphs. Discrete Applied Mathematics 136(2-3), 249-269 (2004)
8. Hassin, R., Rubinstein, S.: Approximations algorithms for maximum linear arrangement. In: Halldórsson, M.M. (ed.) SWAT 2000. LNCS, vol. 1851, pp. 231-236. Springer, Heidelberg (2000)
9. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publisher, Boston (1997)
10. Glover, F.: A template for Scatter Search and Path Relinking. In: Hao, J.-K., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds.) AE 1997. LNCS, vol. 1363, pp. 13-54. Springer, Heidelberg (1998)
11. Lourenco, H.R., Martin, O., Stützle, T.: Iterated Local Search. In: Glover, F., Kochenber-ger, G. (eds.) Handbook of Metaheuristics, International Series in Operations Research & Management Science, vol. 57, pp. 321-353. Kluwer Academic Publishers, Dordrecht (2002)
12. Garcia, C., Perez, D., Campos, V., Marti, R.: Variable neighborhood search for the linear ordering problem. Computers and Operations Research 33, 3549-3565 (2006)
13. Snásel, V., Kromer, P., Platos, J.: Evolutionary approaches to linear ordering problem in DEXA Workshops, pp. 566-570. IEEE Computer Society, Los Alamitos (2008)
14. Dorigo, M., Stutzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
15. LOLIB site, http://www.iwr.uni-heidelberg.de/groups/comopt/software/ LOLIB/
16. Knuth, D.E.: The Stanford GraphBase: A Platform for Combinatorial Computing. Addison Wesley, New York (1993)
17. Dorigo, M., Gambardella, L.M.: Ant Colony System: A cooperative learning approach in the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1(1), 53-66 (1997)