The concurrent negotiation based on genetic algorithm has special advantages in e-commerce applications. But, the relativity of issues and the dynamic weights of issues are not taken into account in existing research. Thus, this paper proposes a solution to these problems by grouping the issues and adapting the dynamic weights, according to data mining from history resources. The concurrent negotiation model of relative issues is described in detail, including the formal definition of the model, the design of concurrent negotiation algorithm, and the update scheme of dynamic weights. The experimental results show that the model can meet the requirements of different negotiations, solve the issues’ relativity problem in the process of negotiation, and improve the negotiation efficiency.