Matheuristics: Optimization, Simulation and Control

Authors:
Marco A. Boschetti;Vittorio Maniezzo;Matteo Roffilli;Antonio Bolufé Röhler
Affiliations:
University of Bologna, Bologna, Italy;University of Bologna, Bologna, Italy;University of Bologna, Bologna, Italy;University of Habana, Habana, Cuba
Venue:
HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics
Year:
2009

Citing 5
Cited 5

An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem

INFORMS Journal on Computing
A survey of very large-scale neighborhood search techniques

Discrete Applied Mathematics
Algorithms for the non-bifurcated network design problem

Journal of Heuristics
Benders decomposition, Lagrangean relaxation and metaheuristic design

Journal of Heuristics
Special issue on mathematical contributions to metaheuristics editorial

Journal of Heuristics

A Hybrid Simulated Annealing and Simplex Method for Fixed-Cost Capacitated Multicommodity Network Design

International Journal of Applied Metaheuristic Computing
A genetic algorithm based exact approach for lifetime maximization of directional sensor networks

Ad Hoc Networks
A hybrid metaheuristic approach for the capacitated p-median problem

Applied Soft Computing
Algorithms for nesting with defects

Discrete Applied Mathematics
A Lagrangian heuristic for sprint planning in agile software development

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Matheuristics are heuristic algorithms made by the interoperation of metaheuristics and mathematic programming (MP) techniques. 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 metaheuristics" appearing in the title of some events of the conference series dedicated to matheuristics [1]. The topic has attracted the interest of a community of researchers, and this led to the publication of dedicated volumes and journal special issues, [13], [14], besides to dedicated tracks and sessions on wider scope conferences. The increasing maturity of the area permits to outline some trends and possibilities offered by matheuristic approaches. 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, and also 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.