Evolutionary Game Algorithm for Multiple Knapsack Problem

  • Authors:
  • Ye Jun;Liu Xiande;Han Lu

  • Affiliations:
  • -;-;-

  • Venue:
  • IAT '03 Proceedings of the IEEE/WIC International Conference on Intelligent Agent Technology
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose a novel algorithm for optimizing multipleknapsack problem based on game theory. The proposed algorithm mapsthe search space and objective function of multiple knapsackproblem tothe strategy profile space and utility function ofnon-cooperative game respectively, and achieves the optimizationobjective through a three-phase equilibrium process of rationalgame agents. In the article, we present the definition and detaileddescription of the proposed algorithm, and give the proof on itsglobal convergence property. The efficiency of the proposedalgorithm has been verified by the simulation test and thecomparison with genetic algorithms.