2023
DOI: 10.1016/j.cor.2022.106070
|View full text |Cite
|
Sign up to set email alerts
|

Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 72 publications
0
1
0
Order By: Relevance
“…4 Currently, there are three common fitness allocation strategies: allocation strategies based on Pareto priority relationship ranking, assignment strategies based on random weight summation, and assignment strategies based on selective weights. [5][6][7] Among them, the Pareto ranking method cannot effectively reflect the density information around the individuals in its fitness assignment, so that it is difficult to ensure the diversity of the population and the fast convergence of the algorithm. Therefore, this method cannot achieve better results in solving high-dimensional multi-objectives.…”
Section: Introductionmentioning
confidence: 99%
“…4 Currently, there are three common fitness allocation strategies: allocation strategies based on Pareto priority relationship ranking, assignment strategies based on random weight summation, and assignment strategies based on selective weights. [5][6][7] Among them, the Pareto ranking method cannot effectively reflect the density information around the individuals in its fitness assignment, so that it is difficult to ensure the diversity of the population and the fast convergence of the algorithm. Therefore, this method cannot achieve better results in solving high-dimensional multi-objectives.…”
Section: Introductionmentioning
confidence: 99%