Skip to main content

Part of the book series: Intelligent Systems Reference Library ((ISRL,volume 62))

  • 2719 Accesses

Abstract

In this chapter, an emerging mathematics-based CI category called matheuristics is introduced. We first, in Sect. 28.1, describe the background knowledge regarding the metaheuritics. Then, the fundamentals and representative application of matheuristics are briefed in Sect. 28.2. Finally, Sect. 28.3 draws the conclusions of this chapter.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and 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
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  • Alba, E. (Ed.). (2005). Parallel metaheuristics: A new class of algorithms. New Jeresy: Wiley. ISBN 978-0-471 -67806-9.

    Google Scholar 

  • Archetti, C., Corberán, Á., Plana, I., Sanchis, J. M., & Speranza, M. G. (2013). A matheuristic for the team orienteering arc routing problem. Report No.: WPDEM 2013/9. Italy: Department of Economics and Management, University of Brescia.

    Google Scholar 

  • BIRATTARI, M. 2009. Tuning metaheuristics: A machine learning perspective. Berlin: Springer.

    Google Scholar 

  • Caserta, M., & Voß, S. (2012). A hybrid algorithm for the DNA sequencing problem. Discrete Applied Mathematics. doi:10.1016/j.dam.2012.08.025.

  • Glover, F., & Kochenberger, G. A. (Eds.). (2003). Handbook of metaheuristics. Dordrecht: Kluwer Academic Publishers. ISBN 1-4020-7263-5.

    Google Scholar 

  • Gonzalez, T. F. (2007). Handbook of approximation algorithms and metaheuristics. Boca Raton: Taylor & Francis Group, LLC. ISBN 978-1-58488-550-4.

    Google Scholar 

  • Maniezzo, V., Stützle, T., & VOß, S. (eds.). (2009). Matheuristics: Hybridizing metaheuristics and mathematical programming. New York: Springer Science + Business Media LLC. ISBN 978-1-4419-1305-0.

    Google Scholar 

  • Pirkwieser, S. (2012). Hybrid metaheuristics and matheuristics for problems in bioinformatics and transportation. Unpublished Doctoral Thesis, Vienna University of Technology, Vienna.

    Google Scholar 

  • Sniedovich, M., & Voß, S. (2005). The corridor method: A dynamic programming inspired metaheuristic. Control and Cybernetics, 35, 551–578.

    Google Scholar 

  • Talbi, E.-G. (2009). Metaheuristics: From design to implementation. New Jersey: Wiley. ISBN 978-0-470-27858-1.

    Google Scholar 

  • Xhafa, F., & Abraham, A. (2008). Metaheuristics for scheduling in industrial and manufacturing applications. Berlin: Springer. ISBN 978-3-540-78984-0.

    Google Scholar 

  • Yang, X.-S. (2010). Engineering optimization: An introduction with metaheuristic applications. New Jersey: Wiley. ISBN 978-0-470-58246-6.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bo Xing .

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Xing, B., Gao, WJ. (2014). Emerging Mathematics-based CI Algorithms. In: Innovative Computational Intelligence: A Rough Guide to 134 Clever Algorithms. Intelligent Systems Reference Library, vol 62. Springer, Cham. https://doi.org/10.1007/978-3-319-03404-1_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-03404-1_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-03403-4

  • Online ISBN: 978-3-319-03404-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics