Skip to main content
SpringerLink
Log in

Implementing Artificial Immune Systems for the Linear Ordering Problem

  • Conference paper
Soft Computing Models in Industrial and Environmental Applications

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 188))

Abstract

Linear Ordering Problem (LOP) is a well know NP-hard combinatorial optimization problem attractive for its complexity, rich library of test data, and variety of real world applications. This study investigates the bio-inspired Artificial Immune Systems (AIS) as a pure metaheuristic soft computing solver of the LOP. The well known LOP library LOLIB was used to compare the results obtained by AIS and other pure soft computing metaheuristics.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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. Abraham, A.: Editorial - hybrid soft computing and applications. International Journal of Computational Intelligence and Applications 8(1) (2009)

    Google Scholar 

  2. Affenzeller, M., Winkler, S., Wagner, S., Beham, A.: Genetic Algorithms and Genetic Programming: Modern Concepts and Practical Applications. Chapman & Hall/CRC (2009)

    Google Scholar 

  3. Campos, V., Glover, F., Laguna, M., Martí, R.: An experimental evaluation of a scatter search for the linear ordering problem. J. of Global Optimization 21(4), 397–414 (2001)

    Article  MATH  Google Scholar 

  4. Chira, C., Pintea, C.M., Crisan, G.C., Dumitrescu, D.: Solving the linear ordering problem using ant models. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, GECCO 2009, pp. 1803–1804. ACM, New York (2009)

    Chapter  Google Scholar 

  5. Corchado, E., Arroyo, A., Tricio, V.: Soft computing models to identify typical meteorological days. Logic Journal of the IGPL 19(2), 373–383 (2011)

    Article  MathSciNet  Google Scholar 

  6. Dyer, J.D., Hartfield, R.J., Dozier, G.V., Burkhalter, J.E.: Aerospace design optimization using a steady state real-coded genetic algorithm. Applied Mathematics and Computation 218(9), 4710–4730 (2012)

    Article  MATH  Google Scholar 

  7. Engelbrecht, A.: Computational Intelligence: An Introduction, 2nd edn. Wiley, New York (2007)

    Google Scholar 

  8. Hart, E., Timmis, J.: Application areas of ais: The past, the present and the future. Applied Soft Computing 8(1), 191–201 (2008)

    Article  Google Scholar 

  9. Huang, G., Lim, A.: Designing a hybrid genetic algorithm for the linear ordering problem. In: GECCO, pp. 1053–1064 (2003)

    Google Scholar 

  10. Krömer, P., Platos, J., Snasel, V.: Differential evolution for the linear ordering problem implemented on cuda. In: Smith, A.E. (ed.) Proceedings of the 2011 IEEE Congress on Evolutionary Computation, June 5-8, pp. 790–796. IEEE Computational Intelligence Society, IEEE Press, New Orleans (2011)

    Google Scholar 

  11. Krömer, P., Platoš, J., Snášel, V.: Modeling permutations for genetic algorithms. In: Proceedings of the International Conference of Soft Computing and Pattern Recognition (SoCPaR 2009), pp. 100–105. IEEE Computer Society (2009)

    Google Scholar 

  12. Krömer, P., Snášel, V., Platoš, J.: Evolving feasible linear ordering problem solutions. In: CSTST 2008: Proceedings of the 5th International Conference on Soft Computing as Transdisciplinary Science and Technology, pp. 337–342. ACM, New York (2008)

    Chapter  Google Scholar 

  13. Krömer, P., Snášel, V., Platoš, J., Husek, D.: Genetic Algorithms for the Linear Ordering Problem. Neural Network World 19(1), 65–80 (2009)

    Google Scholar 

  14. Lozano, M., Herrera, F., Cano, J.: Replacement Strategies to Maintain Useful Diversity in Steady-State Genetic Algorithms, pp. 85–96 (2005)

    Google Scholar 

  15. Martí, R., Reinelt, G.: The Linear Ordering Problem - Exact and Heuristic Methods in Combinatorial Optimization. Applied Mathematical Sciences, vol. 175. Springer, Heidelberg (2011)

    MATH  Google Scholar 

  16. Martí, R., Reinelt, G., Duarte, A.: A benchmark library and a comparison of heuristic methods for the linear ordering problem. In: Computational Optimization and Applications, pp. 1–21 (2011)

    Google Scholar 

  17. Mitchell, J.E., Borchers, B.: Solving linear ordering problems with a combined interior point/simplex cutting plane algorithm. Tech. rep., Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, NY 12180–3590 (September 1997), http://www.math.rpi.edu/~mitchj/papers/combined.ps ; accepted for publication in Proceedings of HPOPT 1997, Rotterdam, The Netherlands

  18. Price, K.V., Storn, R.M., Lampinen, J.A.: Differential Evolution A Practical Approach to Global Optimization. Natural Computing Series. Springer, Berlin (2005)

    MATH  Google Scholar 

  19. Reinelt, G.: The Linear Ordering Problem: Algorithms and Applications, Research and Exposition in Mathematics, vol. 8. Heldermann Verlag, Berlin (1985)

    Google Scholar 

  20. Schiavinotto, T., Stützle, T.: Search Space Analysis of the Linear Ordering Problem. In: Raidl, G.R., Cagnoni, S., Cardalda, J.J.R., Corne, D.W., Gottlieb, J., Guillot, A., Hart, E., Johnson, C.G., Marchiori, E., Meyer, J.-A., Middendorf, M. (eds.) EvoIASP 2003, EvoWorkshops 2003, EvoSTIM 2003, EvoROB/EvoRobot 2003, EvoCOP 2003, EvoBIO 2003, and EvoMUSART 2003. LNCS, vol. 2611, pp. 322–333. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  21. Schiavinotto, T., Stützle, T.: The linear ordering problem: Instances, search space analysis and algorithms. Journal of Mathematical Modelling and Algorithms 3(4), 367–402 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  22. Sedano, J., Curiel, L., Corchado, E., de la Cal, E., Villar, J.R.: A soft computing method for detecting lifetime building thermal insulation failures. Integr. Comput.-Aided Eng. 17(2), 103–115 (2010)

    Google Scholar 

  23. Snášel, V., Krömer, P., Platoš, J.: Differential Evolution and Genetic Algorithms for the Linear Ordering Problem. In: Velásquez, J.D., Ríos, S.A., Howlett, R.J., Jain, L.C. (eds.) KES 2009, Part I. LNCS, vol. 5711, pp. 139–146. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  24. Snyder, L.V., Daskin, M.S.: A random-key genetic algorithm for the generalized traveling salesman problem. European Journal of Operational Research 174(1), 38–53 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  25. Timmis, J., Hone, A., Stibor, T., Clark, E.: Theoretical advances in artificial immune systems. Theoretical Computer Science 403(1), 11–32 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  26. Timmis, J., Andrews, P.S., Hart, E.: Special issue on artificial immune systems. Swarm Intelligence 4(4), 245–246 (2010)

    Article  Google Scholar 

  27. Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation 1(1), 67–82 (2002)

    Article  Google Scholar 

  28. Yu, H.: Optimizing task schedules using an artificial immune system approach. In: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, GECCO 2008, pp. 151–158. ACM, New York (2008)

    Chapter  Google Scholar 

  29. Zhao, S.Z., Iruthayarajan, M.W., Baskar, S., Suganthan, P.: Multi-objective robust pid controller tuning using two lbests multi-objective particle swarm optimization. Information Sciences 181(16), 3323–3335 (2011)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, FEECS, VŠB – Technical University of Ostrava, 17. listopadu 15, 708 33, Ostrava, Poruba, Czech Republic

    Pavel Krömer, Jan Platoš & Václav Snášel

  2. IT4Innovations, Center of Excellence, VŠB – Technical University of Ostrava, 17. listopadu 15, 708 33, Ostrava, Poruba, Czech Republic

    Pavel Krömer, Jan Platoš & Václav Snášel

Authors
  1. Pavel Krömer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jan Platoš
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Václav Snášel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. VŠB-TU Ostrava, 17. listopadu 15, Ostrava, 70833, Czech Republic

    Václav Snášel

  2. (MIR Labs), Scientific Network for Innovation and, Machine Intelligence Research Labs, Auburn, 98071-2259, Washington, USA

    Ajith Abraham

  3. , Dept. de Informática y Automática, University of Salamanca, Plaza de la Merced, s/n, Salamanca, 37008, Spain

    Emilio S. Corchado

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Krömer, P., Platoš, J., Snášel, V. (2013). Implementing Artificial Immune Systems for the Linear Ordering Problem. In: Snášel, V., Abraham, A., Corchado, E. (eds) Soft Computing Models in Industrial and Environmental Applications. Advances in Intelligent Systems and Computing, vol 188. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32922-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32922-7_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32921-0

  • Online ISBN: 978-3-642-32922-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation