Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 267, Issue 2, Pages 628-642Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2017.12.018
Keywords
Multiple objective programming; Robust optimization; Combinatorial optimization; Multi-objective robust optimization; Shortest path problem
Funding
- DFG RTG Resource Efficiency in Interorganizational Networks [1703]
Ask authors/readers for more resources
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 existing algorithm 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. (C) 2017 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available