A decision-theoretic approach to robust optimization in multivalued graphs

@article{Perny2006ADA,
  title={A decision-theoretic approach to robust optimization in multivalued graphs},
  author={Patrice Perny and Olivier Spanjaard and Louis-Xavier Storme},
  journal={Annals of Operations Research},
  year={2006},
  volume={147},
  pages={317-341}
}
This paper is devoted to the search of robust solutions in finite graphs when costs depend on scenarios. We first point out similarities between robust optimization and multiobjective optimization. Then, we present axiomatic requirements for preference compatibility with the intuitive idea of robustness in a multiple scenarios decision context. This leads us to propose the Lorenz dominance rule as a basis for robustness analysis. Then, after presenting complexity results about the determination… 

Anytime Algorithms for Adaptive Robust Optimization with OWA and WOWA

TLDR
This approach consists in interleaving adaptive preference elicitation methods aiming to assess the attitude of the Decision Maker towards robustness or risk with combinatorial optimization algorithms aiming to determine a robust solution.

Lexicographic α-robustness: an application to the 1-median problem

TLDR
A new robustness approach is presented, called lexicographic α-robustness, which compensates for the drawbacks of criteria based on the worst case, which is applied to the 1-median location problem under uncertainty on node weights and can be extended to the case of a general network.

Decision making with multiple objectives using GAI networks

Multiagent Fair Optimization with Lorenz Dominance

TLDR
This work considers the adaptation of the well-known two-phase method proposed in biobjective optimization to the bi-agent optimization case, where one wants to directly compute the Lorenz efficient solutions.

Multiagent Fair Optimization with Lorenz Dominance (Extended Abstract)

TLDR
The adaptation of the well-known two-phase method proposed in biobjective optimization to the bi-agent optimization case, where one wants to directly compute the Lorenz ecient solutions, is considered.

Lorenz versus Pareto Dominance in a Single Machine Scheduling Problem with Rejection

TLDR
This paper addresses the problem of single machine scheduling in which due to some constraints like capacity, rejection of a set of jobs is accepted, and suggests the application of Lorenz-dominance to an adapted bi-objective simulated annealing algorithm.

Exact Methods for Computing All Lorenz Optimal Solutions to Biobjective Problems

TLDR
It is shown that some properties of the Lorenz dominance can provide a more efficient variant of the two-phase method and is compared to state-of-the-art methods on various biobjective combinatorial optimization problems and shows that the new method is more efficient in a majority of cases.
...

References

SHOWING 1-10 OF 52 REFERENCES

An Axiomatic Approach to Robustness in Search Problems with Multiple Scenarios

TLDR
The Lorenz dominance rule is proposed as a basis for robustness analysis and a new sophistication of A* specially designed to determine the set of robust paths in a state space graph is proposed.

Robustness and Efficiency : A Study of the Relationship and an Algorithm for the Bicriteria Discrete Optimization Problem

  • S. Sayin
  • Computer Science, Mathematics
  • 2002
TLDR
An algorithm that relies on a parametric search to identify all of the efficient solutions of a bicriteria discrete optimization problem and a modification of the algorithm that generates a sample of efficient solutions within the coverage error specified by the Decision Maker are proposed.

Multiobjective A*

TLDR
A multiobjective generalization of the heuristic search algorithm A* is presented and it is shown that &fOA * is complete and, when used with a suitably defined set of admissible heuristic functions, admissible.

On the robust shortest path problem

Solving min‐max shortest‐path problems on a network

TLDR
This article presents a label-correcting procedure for determining a path between two nodes in a network that minimizes the maximum of r path length values associated with it and develops two pruning techniques, which are able to speed up the label-Correcting procedure by many orders of magnitude.

On spanning tree problems with multiple objectives

TLDR
This work investigates two versions of multiple objective minimum spanning tree problems defined on a network with vectorial weights and uses neighbourhood search to determine a sequence of solutions with the property that the distance between two consecutive solutions is less than a given accuracy.

An exact algorithm for the robust shortest path problem with interval data

The robust spanning tree problem with interval data

...