Matheuristics

Matheuristics[1][2] are problem agnostic optimization algorithms that make use of mathematical programming (MP) techniques in order to obtain heuristic solutions. Problem-dependent elements are included only within the lower-level mathematic programming, local search or constructive components. An essential feature is the exploitation in some part of the algorithms of features derived from the mathematical model of the problems of interest, thus the definition "model-based heuristics" appearing in the title of some events of the conference series dedicated to matheuristics matheuristics web page.

The topic has attracted the interest of a community of researchers, and this led to the publication of dedicated volumes and journal special issues[3][4][5] besides to dedicated tracks and sessions on wider scope conferences.

A word of caution is needed before delving into the subject, because obviously the use of MP for solving optimization problems, albeit in a heuristic way, is much older and much more widespread than matheuristics. However, this is not the case for metaheuristics. Even the very idea of designing MP methods specifically for heuristic solution has innovative traits, when opposed to exact methods which turn into heuristics when enough computational resources are not available.

Some approaches using MP combined with metaheuristics have begun to appear regularly in the matheuristics literature. This combination can go two-ways, both in MP used to improve or design metaheuristics and in metaheuristics used for improving known MP techniques, even though the first of these two directions is by far more studied.

References

  1. ^ Maniezzo, Vittorio, Boschetti, Marco Antonio, Stützle, Thomas: Matheuristics, Algorithms and Implementations. Springer International Publishing (2021). [1]
  2. ^ Boschetti, Marco Antonio, Maniezzo, Vittorio: Matheuristics: using mathematics for heuristic design. 4OR 20(2), 173-208, 2022. [2]
  3. ^ Hybridizing Metaheuristics and Mathematical Programming. Series: Annals of Information Systems, Vol. 10 Maniezzo, Vittorio; Stützle, Thomas; Voß, Stefan (Eds.), Springer, 2009. [3]
  4. ^ Special Issue on Mathematical Contributions to Metaheuristics. Guest Editors: Vittorio Maniezzo, Stefan Voß, and Pierre Hansen, Journal of Heuristics, Volume 15, Number 3 / June, 2009 [4][dead link]
  5. ^ Marco A. Boschetti, V. Maniezzo, M. Roffilli and Antonio Bolufé Röhler. Matheuristics: Optimization, Simulation and Control. Proc. of HM 2009, LNCS 5818, pp. 171–177, 2009. Springer-Verlag Berlin Heidelberg 2009 [5]

Selected publications

  • [6] Maniezzo, Vittorio, Boschetti, Marco Antonio, Stützle, Thomas: Matheuristics, Algorithms and Implementations. Springer International Publishing (2021)
  • [7] M. Caserta, S. Voß: A math-heuristic algorithm for the DNA sequencing problem. Lecture Notes in Computer Science 6073 (2010), 25 - 36
  • [8] Boschetti, Marco Antonio, Maniezzo, Vittorio: Matheuristics: using mathematics for heuristic design. 4OR 20(2), 173–208, 2022

Content Disclaimer

Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.

  1. The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
  2. There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
  3. It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
  4. Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
  5. Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.