2015
DOI: 10.1007/978-3-319-19644-2_27
|View full text |Cite
|
Sign up to set email alerts
|

Learning-Based Multi-agent System for Solving Combinatorial Optimization Problems: A New Architecture

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 16 publications
0
2
0
Order By: Relevance
“…The suggested method HEFT-NSGA [15] was compared to HEFT [28] and CPGA algorithms [29]. Results are reported over the Gaussian Elimination and Fast Fourier Transformation graphs [34]. One more comparison metric was considered in [15], Schedule Length Ration (SLR), which is calculated as follows:…”
Section: Evaluation and Experimental Resultsmentioning
confidence: 99%
“…The suggested method HEFT-NSGA [15] was compared to HEFT [28] and CPGA algorithms [29]. Results are reported over the Gaussian Elimination and Fast Fourier Transformation graphs [34]. One more comparison metric was considered in [15], Schedule Length Ration (SLR), which is calculated as follows:…”
Section: Evaluation and Experimental Resultsmentioning
confidence: 99%
“…Due to the advantages of RL algorithms, researchers have explored how to implement RL in combination with metaheuristics with the objective of identifying more efficient methods for solving OR problems [50][51][52][53][54][55]. Recently, some studies have shown promising results of using RL for solving combinatorial optimization problems [56].…”
Section: Reinforcement Learning and Operations Researchmentioning
confidence: 99%