Hybrid Metaheuristics for Multi-Objective Optimization
E-G. Talbi
Journal of Algorithms & Computational Technology · 2015
doi:10.1260/1748-3018.9.1.41 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Over the last two decades, interest on hybrid metaheuristics has risen considerably in the field of multi-objective optimization (MOP). The best results found for many real-life or academic multi-objective optimization problems are obtained by hybrid algorithms. Combinations of algorithms such as metaheuristics, mathematical programming and machine learning techniques have provided very powerful search algorithms. Three different types of combinations are considered in this paper to solve multi-objective optimization problems: Combining metaheuristics with (complementary) metaheuristics. Combining metaheuristics with exact methods from mathematical programming approaches. Combining metaheuristics with machine learning and data mining techniques.
Abstract licence: CC BY-NC
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.