A Memetic Algorithm for Resource Allocation Problem Based on Node-Weighted Graphs [Application Notes]

@article{Wu2014AMA,
  title={A Memetic Algorithm for Resource Allocation Problem Based on Node-Weighted Graphs [Application Notes]},
  author={Jianshe Wu and Zhiyan Chang and Lin Yuan and Yunting Hou and Maoguo Gong},
  journal={IEEE Computational Intelligence Magazine},
  year={2014},
  volume={9},
  pages={58-69}
}
Resource allocation problems usually seek to find an optimal allocation of a limited amount of resources to a number of activities. The allocation solutions of different problems usually optimize different objectives under constraints [1, 2]. If the activities and constraints among them are presented as nodes and edges respectively, the resource allocation problem can be modeled as a k-coloring problem with additional optimization objectives [3, 4]. Since the amount of resources is limited, it… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 47 references

Improvements to Graph Coloring Register Allocation

ACM Trans. Program. Lang. Syst. • 1994
View 13 Excerpts
Highly Influenced

Cordón,“Image segmentation using extended topological active nets optimized by scatter search,

N. Bova, Ó. Ibáñez
IEEE Comput. Intell. Mag., • 2013
View 1 Excerpt

Understanding of GP-Evolved Motion Detectors

IEEE Computational Intelligence Magazine • 2013
View 1 Excerpt

Similar Papers

Loading similar papers…