Skip to main content
SpringerLink
Log in

A Hybrid Ant-Based Approach to the Economic Triangulation Problem for Input-Output Tables

  • Conference paper
Hybrid Artificial Intelligence Systems (HAIS 2009)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5572))

Included in the following conference series:

Abstract

The Triangulation Problem for Input-Output Matrices has been intensively studied in order to understand the complex series of interactions among the sectors of an economy. The problem refers to finding a simultaneously permutation of rows and columns of a matrix such as the sum of the entries which are above the main diagonal is maximum. This is a linear ordering problem – a well-known NP-hard combinatorial optimization problem. A new hybrid heuristic based on ant algorithms is proposed to efficiently solve the triangulation problem. Starting from a greedy solution, the proposed model hybridizes the Ant Colony System (ACS) metaheuristic with an Insert-Move (IM) local search mechanism able to refine ant solutions. The proposed ACS-IM algorithm is tested with good results on some real-life economic data sets.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Pryor, F.L.: Economic evolution and structure: The impact of complexity on the US economic system. Cambridge University Press, Cambridge (1996)

    Google Scholar 

  2. Chenery, H.B., Watanabe, T.: International comparisons of the structure of productions. Econometrica 26(4), 487–521 (1958)

    Article  Google Scholar 

  3. Reinelt, G.: The linear ordering problem: algorithms and applications. In: Research and Exposition in Mathematics, vol. 8, Heldermann Verlag, Berlin (1985)

    Google Scholar 

  4. Chanas, S., Kobylanski, P.: A new heuristic algorithm solving the linear ordering problem. Computational Optimization and Applications 6, 191–205 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  5. Kaas, R.: A branch and bound algorithm for the acyclic subgraph problem. European Journal of Operational Research 8, 355–362 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Chapter  Google Scholar 

  9. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publisher, Boston (1997)

    Book  MATH  Google Scholar 

  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)

    Chapter  Google Scholar 

  11. Lourenco, H.R., Martin, O., Stützle, T.: Iterated Local Search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, International Series in Operations Research & Management Science, vol. 57, pp. 321–353. Kluwer Academic Publishers, Dordrecht (2002)

    Google Scholar 

  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)

    Article  MATH  Google Scholar 

  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)

    Google Scholar 

  14. Dorigo, M., Stűtzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)

    MATH  Google Scholar 

  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)

    MATH  Google Scholar 

  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)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Babes-Bolyai University, M. Kogalniceanu 1, 400084, Cluj-Napoca, Romania

    Camelia-M. Pintea, Camelia Chira & D. Dumitrescu

  2. Bacau University, Calea Marasesti 157, 600115 Bacau, Romania, and, Centre Interuniversitaire de Recherche sur les Reseaux d’Entreprise, la Logistique et le Transport, C.P. 8888, Succursale Centre-ville, Montreal (QC), Canada, H3C 3P8

    Gloria Cerasela Crisan

Authors
  1. Camelia-M. Pintea
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gloria Cerasela Crisan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Camelia Chira
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. D. Dumitrescu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Grupo de Investigación GICAP, Área de Lenguajes Higher Polytechnic School, Universidad de Burgos, Burgos, Spain

    Emilio Corchado

  2. Department of Computer Science, University of Vermont, 33 Colchester Avenue, Burlington, VT, USA

    Xindong Wu

  3. Computer and Information Science, Helsinki University of Technology, P.O. Box 5400, 02015 HUT, Finland

    Erkki Oja

  4. Grupo de Investigación GICAP, Área de Lenguajes y Sistemas Informáticos, Departamento de Ingeniería Civil, Escuela Politécnica Superior, Universidad de Burgos, Campus Vena, Francisco de Vitoria, 09006, Burgos, Spain

    Álvaro Herrero  & Bruno Baruque  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pintea, CM., Crisan, G.C., Chira, C., Dumitrescu, D. (2009). A Hybrid Ant-Based Approach to the Economic Triangulation Problem for Input-Output Tables. In: Corchado, E., Wu, X., Oja, E., Herrero, Á., Baruque, B. (eds) Hybrid Artificial Intelligence Systems. HAIS 2009. Lecture Notes in Computer Science(), vol 5572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02319-4_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02319-4_45

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02318-7

  • Online ISBN: 978-3-642-02319-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation