2003
DOI: 10.1007/s10115-003-0082-0
|View full text |Cite
|
Sign up to set email alerts
|

A Heuristic Genetic Algorithm for Solving Resource Allocation Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2007
2007
2019
2019

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 28 publications
(7 citation statements)
references
References 13 publications
0
7
0
Order By: Relevance
“…This is not the first attempt to deploy GA for optimization of resource allocation. Mature solutions have been proposed for allocation of generic resource [23], [24], radio resource [25] and cloud resource [26], [27]. All these approaches consider the problem of global resource optimization, where the system allocates resource blocks from a certain pool to a known set of targets (activities, links, users, etc.).…”
Section: Proposed Methods a Slicing Strategies As Binary Sequence Codesmentioning
confidence: 99%
“…This is not the first attempt to deploy GA for optimization of resource allocation. Mature solutions have been proposed for allocation of generic resource [23], [24], radio resource [25] and cloud resource [26], [27]. All these approaches consider the problem of global resource optimization, where the system allocates resource blocks from a certain pool to a known set of targets (activities, links, users, etc.).…”
Section: Proposed Methods a Slicing Strategies As Binary Sequence Codesmentioning
confidence: 99%
“…3) For random dispersion, the mutation probability at this time is multiplied by several multiples. We set the probability to amplify by 5 times to perform a large-variation operation, which causes individuals in the population to exhibit a relatively large variation [15].…”
Section: E Improved Genetic Algorithmmentioning
confidence: 99%
“…In this paper, in order to avoid maintenance of infeasible chromosomes, the penalty functions method is applied. The penalty functions method is very effective in constrained optimization problems [39,40].…”
Section: Genetic Algorithm For Solving the Clustering Problemmentioning
confidence: 99%