Return
Proportion-based robust optimization and team orienteering problem with interval data
DOI:10.1016/j.ejor.2012.10.038.png)
Abstract
En 中文
In this paper, a proportion-based robust optimization approach is developed to deal with uncertain combinatorial optimization problems. This approach assumes that a certain proportion of uncertain coefficients in each solution are allowed to change and optimizes a deterministic model so as to achieve a trade-off between optimality and feasibility when the coefficients change. We apply this approach on team orienteering problem with interval data (TOPID), a variant of vehicle routing problem, which has not yet been studied before. A branch and price algorithm is proposed to solve the robust counterpart by using two novel dominance relations. Finally, numerical study is performed. The results show the usefulness of the proposed robust optimization approach and the effectiveness of our algorithm. (C) 2012 Elsevier B.V. All rights reserved.
Keywords:
Uncertainty modeling
Robust optimization
Combinatorial optimization
Team orienteering problem
Vehicle routing 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
Cited Papers
Understanding the Effect of Side Reactions on the Recyclability of Furan–Maleimide Resins Based on Thermoreversible Diels–Alder Network
Polymers
IF0

