2019
DOI: 10.1109/access.2019.2917089
|View full text |Cite
|
Sign up to set email alerts
|

Uncertain Team Orienteering Problem With Time Windows Based on Uncertainty Theory

Abstract: Uncertainty theory is a branch of mathematics for modeling indeterminacy, especially belief degrees. This paper considers an application of uncertainty theory in team orienteering problem with time windows. In the problem, travel time is uncertain with known uncertainty distribution, and the impact of uncertainties on visit time and total profit cannot be ignored. Based on the uncertainty theory, a model of uncertain team orienteering problem with time windows (UTOPTW) is established. Since the UTOPTW cannot b… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(4 citation statements)
references
References 26 publications
0
4
0
Order By: Relevance
“…They used the convex efficient frontier to handle the two factors. Wang et al (2019) also treated the weight of arcs as an uncertain variable. They proposed the uncertain team OP with time windows and used uncertainty theory to solve it.…”
Section: Literature Reviewmentioning
confidence: 99%
“…They used the convex efficient frontier to handle the two factors. Wang et al (2019) also treated the weight of arcs as an uncertain variable. They proposed the uncertain team OP with time windows and used uncertainty theory to solve it.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The prove of Theorem 4.1 is in reference [18] requires that the optimal value j f  of each objective function exists; Additionally, the distance formula with ideal point in (14) can also be replaced by following and theorem 4.1 still holds.…”
Section: Tchebycheff Approachmentioning
confidence: 99%
“…If a multi-objective optimization problem in ( 13) is decomposed into multiple single-objective models in (14) with different weight vectors, the optimization algorithm can guide each individual to approach different pareto-optimal solution. Generally, the optimal solutions of subproblems with similar weight vectors are small apart in the solution space.…”
Section: Tchebycheff Approachmentioning
confidence: 99%
See 1 more Smart Citation