A Hybrid Meta-Heuristic for Multi-Objective Optimization: MOSATS

Ba�os, R; Gil, C; Paechter, B; Ortega, J

Abstract

Real optimization problems often involve not one, but multiple objectives, usually in conflict. In single-objective optimization there exists a global optimum, while in the multi-objective case no optimal solution is clearly defined but rather a set of solutions, called the Pareto-optimal front. Thus, the goal of multi-objective strategies is to generate a set of non-dominated solutions as an approximation to this front. However, the majority of problems of this kind cannot be solved exactly because they have very large and highly complex search spaces. In recent years, meta-heuristics have become important tools for solving multi-objective problems encountered in industry as well as in the theoretical field. This paper presents a novel approach based on hybridizing Simulated Annealing and Tabu Search. Experiments on the Graph Partitioning Problem show that this new method is a better tool for approximating the efficient set than other strategies also based on these meta-heuristics.

Citation

Baños, R., Gil, C., Paechter, B., & Ortega, J. (2007). A Hybrid Meta-Heuristic for Multi-Objective Optimization: MOSATS. Journal of Mathematical Modelling and Algorithms, 6(2), 213-230. https://doi.org/10.1007/s10852-006-9041-6

• Journal Article Type: Article
• Online Publication Date: May 30, 2006
• Publication Date: 2007-06
• Deposit Date: Aug 1, 2016
• Journal: Journal of Mathematical Modelling and Algorithms
• Print ISSN: 1570-1166
• Electronic ISSN: 1572-9214
• Publisher: Springer
• Peer Reviewed: Peer Reviewed
• Volume: 6
• Issue: 2
• Pages: 213-230
• DOI: https://doi.org/10.1007/s10852-006-9041-6
• Keywords: hybrid meta-heuristics, multi-objective optimization, simulated annealing, tabu search
• Public URL: http://researchrepository.napier.ac.uk/Output/321963