Uporedite metode

	Математичке евристике: Хибридизација математичког програмирања и метаевристика	Целобројно програмирање	Симхеуристика: Спајање симулације са метахеуристиком за стохастичку оптимизацију
Oblast	Optimizacija	Optimizacija	Optimizacija
Porodica	Process / pipeline	Process / pipeline	Process / pipeline
Godina nastanka	2009	1958	2015
Tvorac	Maniezzo, Stützle & Voß	Ralph Gomory (cutting planes, 1958); land-and-doig branch-and-bound (1960)	Juan et al.
Tip	Hybrid optimization framework	Mathematical optimisation — exact combinatorial method	Hybrid simulation-optimization framework
Temeljni izvor	Maniezzo, V., Stützle, T., & Voß, S. (Eds.). (2009). Matheuristics: Hybridizing Metaheuristics and Mathematical Programming. Springer. ISBN: 978-1-4419-1305-0	Wolsey, L.A. (1998). Integer Programming. Wiley. ISBN: 9780471283669	Juan, A. A., et al. (2015). A review of simheuristics: Extending metaheuristics to deal with stochastic combinatorial optimization problems. Operations Research Perspectives, 2, 62–72.
Drugi nazivi	Hybrid Metaheuristics, MIP-based Heuristics, Math-Programming Hybrids, Matematiksel Sezgisel Yöntemler	IP, MIP, mixed-integer programming, mixed-integer linear programming	Simulation-based Metaheuristics, Stochastic Metaheuristics with Simulation, Hybrid Simulation-Optimization, Simülistik Sezgiseller
Srodne	3	4	3
Sažetak	Matheuristics is a class of hybrid optimization methods that tightly couple exact mathematical programming components—such as mixed-integer programming (MIP) solvers—with metaheuristic search procedures. Formally introduced and named by Maniezzo, Stützle, and Voß in 2009, the framework leverages the global-search capability of metaheuristics and the structural exploitation of mathematical programming to tackle large-scale combinatorial optimization problems that neither approach can solve effectively alone.	Integer programming (IP), also called mixed-integer programming (MIP) when only some variables are restricted to whole numbers, is a branch of mathematical optimisation in which some or all decision variables must take integer or binary values. Building on linear programming, it was formalised through Ralph Gomory's cutting-plane method (1958) and the Land-and-Doig branch-and-bound algorithm (1960), and it has since become the standard exact framework for scheduling, assignment, routing, and resource-allocation problems.	Simheuristics is a hybrid algorithmic framework that integrates Monte Carlo or discrete-event simulation into metaheuristic search procedures to solve stochastic combinatorial optimization problems. Introduced by Juan et al. in 2015, it addresses settings where objective function evaluations involve random variables, providing near-optimal solutions with probabilistic quality guarantees. The approach is especially suited for real-world logistics, transportation, and scheduling problems where uncertainty is inherent and classical deterministic solvers fail to capture variability.