Improving convergence of evolutionary multi-objective optimization with local search: a concurrent-hybrid algorithm
DOI10.1007/s11047-011-9250-4zbMath1251.90358OpenAlexW2103073782WikidataQ109314770 ScholiaQ109314770MaRDI QIDQ1761699
Kalyanmoy Deb, Karthik Sindhya, Kaisa M. Miettinen
Publication date: 15 November 2012
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-70135
Pareto optimalitymultiple criteria decision makinghybrid algorithmsevolutionary algorithmsmulticriteria optimizationNSGA-IIachievement scalarizing functions
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Uses Software
Cites Work
- Optimization by Simulated Annealing
- Theory of multiobjective optimization
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- Nonlinear multiobjective optimization
- Evolution strategies. A comprehensive introduction
- Retrieval and use of the balance set in multiobjective global optimization
- Experiments with classification-based scalarizing functions in interactive multiobjective optimization
- Use of substitute scalarizing functions to guide a local search based heuristic: the case of moTSP
- On the Use of Preferential Weights in Interactive Reference Point Based Methods
- Tabu Search—Part I
- Applications of Multi-Objective Evolutionary Algorithms
- Evolutionary Algorithms for Solving Multi-Objective Problems
- Genetic local search for multi-objective combinatorial optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item