Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty
From MaRDI portal
Abstract: In this paper we develop two approaches to find minmax robust efficient solutions for multi-objective combinatorial optimization problems with cardinality-constrained uncertainty. First, we extend an algorithm of Bertsimas and Sim (2003) for the single-objective problem to multi-objective optimization. We propose also an enhancement to accelerate the algorithm, even for the single-objective case, and we develop a faster version for special multi-objective instances. Second, we introduce a deterministic multi-objective problem with sum and bottleneck functions, which provides a superset of the robust efficient solutions. Based on this, we develop a label setting algorithm to solve the multi-objective uncertain shortest path problem. We compare both approaches on instances of the multi-objective uncertain shortest path problem originating from hazardous material transportation.
Recommendations
- Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions
- A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty
- scientific article; zbMATH DE number 6914444
- Minmax robustness for multi-objective optimization problems
- Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets
- Mixed uncertainty sets for robust combinatorial optimization
- Min-max-min robust combinatorial optimization
- Robust combinatorial optimization under convex and discrete cost uncertainty
- Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty
- Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios
Cites work
- A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty
- An aggregate label setting policy for the multi-objective shortest path problem
- An application of deterministic and robust optimization in the wood cutting industry
- Bi-objective robust optimisation
- Decision uncertainty in multiobjective optimization
- Generalized multiple objective bottleneck problems
- GitHub
- Handbooks in operations Research \& management science: Transportation
- Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Minmax robustness for multi-objective optimization problems
- On a multicriteria shortest path problem
- On robust multiobjective optimization
- Optimality and duality for robust multiobjective optimization problems
- Robust discrete optimization and network flows
- Robust multiobjective optimization \& applications in portfolio optimization
- Robust multiple objective game theory
- Robust optimization
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The Price of Robustness
- The relationship between multi-objective robustness concepts and set-valued optimization
Cited in
(15)- Algorithms for the minmax regret path problem with interval data
- Facing robustness as a multi-objective problem: a bi-objective shortest path problem in smart regions
- Dominance for multi-objective robust optimization concepts
- Pareto solutions in multicriteria optimization under uncertainty
- A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty
- Extensions of labeling algorithms for multi-objective uncertain shortest path problems
- Solution methods for multi-objective robust combinatorial optimization
- The price of multiobjective robustness: analyzing solution sets to uncertain multiobjective problems
- Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets
- Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions
- Robust optimality conditions for multiobjective programming problems under data uncertainty and its applications
- A fully polynomial time approximation scheme for the probability maximizing shortest path problem
- Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Min-ordering and max-ordering scalarization methods for multi-objective robust optimization
This page was built for publication: Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q723948)
