Research Output

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

  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.

  • Type:

    Article

  • Date:

    30 May 2006

  • Publication Status:

    Published

  • Publisher

    Springer Science + Business Media

  • DOI:

    10.1007/s10852-006-9041-6

  • Cross Ref:

    9041

  • Library of Congress:

    QA75 Electronic computers. Computer science

  • Dewey Decimal Classification:

    004 Data processing & computer science

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. doi:10.1007/s10852-006-9041-6. ISSN 1570-1166

Authors

Keywords

hybrid meta-heuristics, multi-objective optimization, simulated annealing, tabu search

Monthly Views:

Available Documents