A hybrid meta-heuristic for multi-objective optimization: MOSATS

DOI10.1007/s10852-006-9041-6zbMath1178.90351OpenAlexW2141550208MaRDI QIDQ2643719

Yanyan Li

Publication date: 27 August 2007

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-006-9041-6

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Implementation of scatter search for multi-objective optimization: a comparative study ⋮ A hybrid method for solving multi-objective global optimization problems

Uses Software

• SPEA2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
• A mixed heuristic for circuit partitioning
• Parallel VLSI test in a shared-memory multiprocessor
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
• MOSA method: a tool for solving multiobjective combinatorial optimization problems
• Equation of State Calculations by Fast Computing Machines

This page was built for publication: A hybrid meta-heuristic for multi-objective optimization: MOSATS