Lorenz dominance based algorithms to solve a practical multiobjective problem

DOI10.1016/j.cor.2018.12.003zbMath1458.90569OpenAlexW2901989083WikidataQ128838447 ScholiaQ128838447MaRDI QIDQ1725590

Matthieu Basseur, Jin-Kao Hao, Brahim Chabane

Publication date: 14 February 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.12.003

zbMATH Keywords

heuristicsmultiobjective optimizationdecision supportLorenz dominanceaction planningfair optimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• MOTGA
• MOEA/D
• HypE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Preference-inspired co-evolutionary algorithms using weight vectors
• MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem
• Solving efficiently the 0-1 multi-objective knapsack problem
• New multi-objective method to solve reentrant hybrid flow shop scheduling problem
• Inequality measures and equitable approaches to location problems
• Multiple criteria linear programming model for portfolio selection
• A box decomposition algorithm to compute the hypervolume indicator
• Equitable aggregations and multiple criteria analysis
• On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study
• A decision-theoretic approach to robust optimization in multivalued graphs
• Exact Methods for Computing All Lorenz Optimal Solutions to Biobjective Problems
• Linear optimization with multiple equitable criteria
• Evolutionary Multi-Criterion Optimization