So sánh phương pháp
Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.
| Simheuristics: Kết hợp mô phỏng với siêu heuristic để tối ưu hóa ngẫu nhiên× | Matheuristics: Kết hợp Lập trình Toán học và Siêu nghiệm thức× | |
|---|---|---|
| Lĩnh vực | Tối ưu hóa | Tối ưu hóa |
| Họ | Process / pipeline | Process / pipeline |
| Năm ra đời≠ | 2015 | 2009 |
| Người khởi xướng≠ | Juan et al. | Maniezzo, Stützle & Voß |
| Loại≠ | Hybrid simulation-optimization framework | Hybrid optimization framework |
| Công trình gốc≠ | 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. DOI ↗ | Maniezzo, V., Stützle, T., & Voß, S. (Eds.). (2009). Matheuristics: Hybridizing Metaheuristics and Mathematical Programming. Springer. ISBN: 978-1-4419-1305-0 |
| Tên gọi khác | Simulation-based Metaheuristics, Stochastic Metaheuristics with Simulation, Hybrid Simulation-Optimization, Simülistik Sezgiseller | Hybrid Metaheuristics, MIP-based Heuristics, Math-Programming Hybrids, Matematiksel Sezgisel Yöntemler |
| Liên quan | 3 | 3 |
| Tóm tắt≠ | 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. | 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. |
| ScholarGateBộ dữ liệu ↗ |
|
|