.png){kind=icon}
.png){kind=icon}
Return
Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2017.12.018.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Multiple objective programming
Robust optimization
Combinatorial optimization
Multi-objective robust optimization
Shortest path problem
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
View more organizations