An interactive evolutionary metaheuristic for multiobjective combinatorial optimization
From MaRDI portal
Recommendations
- An evolutionary metaheuristic for approximating preference-nondominated solutions
- scientific article; zbMATH DE number 1784664
- An interactive heuristic method for multi-objective combinatorial optimization
- Interactive multiobjective optimization with the Pareto memetic algorithm
- Interactive evolutionary multi-objective optimization for quasi-concave preference functions
Cited in
(30)- g-dominance: Reference point based dominance for multiobjective metaheuristics
- An interactive heuristic method for multi-objective combinatorial optimization
- Efficient pairwise preference elicitation allowing for indifference
- EMOSOR: evolutionary multiple objective optimization guided by interactive stochastic ordinal regression
- Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization
- An evolutionary metaheuristic for approximating preference-nondominated solutions
- An interactive evolutionary multi-objective optimization algorithm with a limited number of decision maker calls
- scientific article; zbMATH DE number 6612888 (Why is no real title available?)
- Interactive multiobjective optimization with the Pareto memetic algorithm
- Multiobjective combinatorial optimization: some approaches
- The iPICEA-g: a new hybrid evolutionary multi-criteria decision making approach using the brushing technique
- Using Choquet integral as preference model in interactive evolutionary multiobjective optimization
- Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems
- Finding all nondominated points of multi-objective integer programs
- Interactive multiple criteria decision making based on preference driven evolutionary multiobjective optimization with controllable accuracy
- Can a linear value function explain choices? An experimental study
- Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems
- scientific article; zbMATH DE number 1784664 (Why is no real title available?)
- PGA/MOEAD: a preference-guided evolutionary algorithm for multi-objective decision-making problems with interval-valued fuzzy preferences
- Interactive evolutionary multiobjective optimization driven by robust ordinal regression
- Multi-objective route planning of an unmanned air vehicle in continuous terrain: an exact and an approximation algorithm
- Effects of many conflicting objectives on decision-makers' cognitive burden and decision consistency
- Vector optimization with Gaussian process bandits
- Fifty years of multi-objective optimization and decision-making: from mathematical programming to evolutionary computation
- A multi-objective evolutionary algorithm based on incremental support vector regression for the irregular strip packing problem
- Cárnico-ICSPEA2--A metaheuristic co-evolutionary navigator for a complex co-evolutionary farming system
- MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem
- A multi-objective optimization evolutionary algorithm incorporating preference information based on fuzzy logic
- Interactive evolutionary multi-objective optimization for quasi-concave preference functions
- A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem
This page was built for publication: An interactive evolutionary metaheuristic for multiobjective combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3114878)
