Multi‐objective optimization using metaheuristics: non‐standard algorithms

DOI10.1111/j.1475-3995.2011.00808.xzbMath1270.90067OpenAlexW1984180799MaRDI QIDQ4918257

Antonio J. Nebro, El-Ghazali Talbi, Matthieu Basseur, Enrique Alba

Publication date: 24 April 2013

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2011.00808.x

zbMATH Keywords

multi-objective optimizationmetaheuristicsparallelismhybridizationoptimization under uncertainty

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (15)

Many-objective Pareto local search ⋮ Pareto uncertainty index for evaluating and comparing solutions for stochastic multiple objective problems ⋮ Deep Gaussian process for multi-objective Bayesian optimization ⋮ An evolutionary algorithm for the multi‐objective pick‐up and delivery pollution‐routing problem ⋮ A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem ⋮ A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach ⋮ Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests ⋮ Supply chain network design with efficiency, location, and inventory policy using a multiobjective evolutionary algorithm ⋮ Towards a tropical automaton product minimizing global completion times ⋮ Scheduling aspects in keyword extraction problem ⋮ The weighted intruder path covering problem ⋮ A new approach to generate pattern-efficient sets of non-dominated vectors for multi-objective optimization ⋮ A separation based optimization approach to dynamic maximal covering location problems with switched structure ⋮ A comparative study of variation operators used for evolutionary multi-objective optimization ⋮ Empirical study of exact algorithms for the multi-objective spanning tree

Uses Software

• Scatter Search
• MACS-VRPTW
• SPEA2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem. (Abstract of thesis)
• Generalized dynamic programming for multicriteria optimization
• Multi-start and path relinking methods to deal with multiobjective Knapsack problems
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
• An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
• Parallelizing tabu search on a cluster of heterogeneous workstations
• A comparison of evolution strategies with other direct search methods in the presence of noise
• A simulated annealing approach to bicriteria scheduling problems on a single machine
• ``MOSS multiobjective scatter search applied to nonlinear multiple criteria optimization
• Continuous scatter search: an analysis of the integration of some combination methods and improvement strategies
• Ant colony optimization theory: a survey
• Spatially structured evolutionary algorithms. Artificial evolution in space and time
• Parallel Multiobjective Optimization
• Note—A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness
• Multiobjective A*
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• A multi-criteria tabu search approach to cell formation problems in group technology with multiple objectives
• MOSA method: a tool for solving multiobjective combinatorial optimization problems
• Genetic local search for multi-objective combinatorial optimization

This page was built for publication: Multi‐objective optimization using metaheuristics: non‐standard algorithms