# A Negotiation Optimization Strategy of Collaborative Procurement with Supply Chain Based on Multi-Agent System

Authors: Chouyong Chen; Chao Xu
Journal: Mathematical Problems in Engineering
 (2018)

---

## Abstract

In the process of collaborative procurement, buyers and suppliers are prone to conflict in cooperation due to differences in needs and preferences. Negotiation is a crucial way to resolve the conflict. Aimed at ameliorating the situations of underdeveloped self-adaptive learning effect of current collaborative procurement negotiation, this paper constructs a negotiation model based on multi-agent system and proposes a negotiation optimization strategy combined with machine learning. It provides a novel perspective for the analysis of intelligent SCM. The experimental results suggest that the proposed strategy improves the success rate of self-adaptive learning and joint utility of agents compared with the strategy of single learning machine, and it achieves win-win cooperation between purchasing enterprise and supplier.


---

## Body

## 1. Instruction

Information technology has enabled, and in some cases forced, enterprises to reorient their internal capabilities and to redefine their business models to develop e-commerce techniques. In order to attain timely responsiveness and to proffer higher service level, constructive cooperation among partners in supply chain is critical in any endeavor to ameliorate disruptions and mitigate risks [1]. A small number of successful contemporary associations have transformed from an opportunistic doctrine of cooperation to a synergistic ethos and integrated their supply chain procedures.The synergism of Cluster Supply Chain (CSC), comprising collaborative manufacture, collaborative procurement, collaborative logistics, and collaborative inventory, is the coupling organizing form between industrial cluster and supply chain. And it helps small and medium-sized enterprise (SME) shorten the transaction cycles and reduce costs. Procurement directly affecting the production and operation is the key link in the development of the whole enterprise. In the fierce market competition, therefore, the purchasing mode gradually shifts from traditional independent purchasing that faces the problems of small quantity discount, low bargaining power, and slow response to customer demand to collaborative procurement.In this article, we consider a distributed supply chain (SC) in that each member seeks to optimize personal performance and independently plans his business. A large measure of supply chain managements (SCM) have to communicate and negotiate effectively with SC members. In the process of collaborative purchasing, buyers and suppliers are prone to conflict in cooperation due to differences in needs and preferences. Negotiation is a crucial way to resolve the conflict and an effective mechanism for supply chain coordination and cooperation. It has been demonstrated that the information sharing between the buyers and suppliers ensures effective supplier participation and enhances mutual understanding, which contributes to more excellent performance over the rivals [2]. Negotiation is reckoned to be a sound approach for participators to exchange messages, understand other perspectives, and identify new order alternatives based on the information and knowledge learned in the process. And it allows enterprises in the CSC to prevent both self-interest and local optimization of finicky partner, to proceed to the optimization of objectives of all participators and to achieve a win-win situation in SCM.Former researchers have paid much attention to negotiation problem over the past decade and proposed some salient models. The majority of models primarily use either methods of the improved algorithms or game-theoretic techniques as a basis to formulate autonomous negotiation. However, those approaches are considered to be complicated to spread to widespread problem fields due to the uncertainty and complexity in real-world negotiation. This paper ameliorates the negotiation model combining multi-agent system (MAS) with machine learning for further tackling the conflict in cooperation. New model provides a buyer with a method for purchasing a product systematically. And it helps in achieving a win-win cooperation between two sides during the process of collaborative procurement with supply chain as far as feasible.The remainder of the paper is structured as follows. Section2 shows literature review. Section 3 recalls some general concepts of key techniques. Section 4 is devoted to a negotiation model of collaborative procurement based on MAS. Section 5 describes a self-adaptive negotiation optimization strategy combined with dynamic selective ensemble learning. Finally, the experiments design, results, and concluding remarks are presented in Sections 6 and 7, respectively.


## 2. Literature Review

Given that research on negotiation of collaborative procurement is new and largely fragmented, it is practically paramount to arouse individuals’ attention. Previous studies have, nevertheless, proposed a basic model of supply chains and a negotiation strategy for solving conflicts in consideration of efficiency and cost. A multi-objective cooperative production–distribution planning model was formulated by Jolai et al. [3] applying the fuzzy goal programming approach to maximize the gains of all participators. To discover the optimal solutions of resource allocation, Lin et al. [4] recommended a collaborative negotiation mechanism that was built on price schedules decomposition algorithm. But the popular methods to research the negotiation’s conundrum in SCM involve Game Theory and artificial intelligence (AI). Game theorists deem the negotiation as an incomplete, dynamic information game, and attempt to settle the game by offering some predictions on certain conditions [5]. Primary methodological tools of Game Theory are Nash game [6] and Stackelberg game [7], which concentrate on the sequential and simultaneous decision-making of multiple players, respectively. For those relevant analytic modeling studies, the problem is analyzed mostly from a theoretical perspective. Despite being extremely successful in a quantity of situations, the game theoretical approach is considered to be difficult to spread to universal problem fields owing to the uncertainty and complexity in real-world negotiation.Compared to Game Theory, participants that bargain with consideration of human preference and thoughts could be considerably represented by the agent technology which is a branch of AI [8]. The use of information and communication technology tools, offering the capacities of customer sensitivity, information sharing, and process integration, is observed as the uppermost enabler for this collaborative perception’s realization [9]. In computer science, an agent is generally considered as a software entity, which is autonomous to communicate and coordinate with other agents to accomplish its design objectives. Consequently, multi-agent simulation modeling, which originated from AI, is suitable for the conduction of distributed system and has certain advantages in being testable, quantifiable, and efficient. It is superior in expansibility, is easy to configure, and has been widely used in the SCM. Kwon et al. [10] constructed an integrated framework that was based on multi-agent cooperation and case-based reasoning to help address emerging uncertainties. Lin et al. [11] demonstrated a supply chain coordination model of multi-agent and put forward a conflict solution method built on constraint satisfaction algorithm due to the different form of demand. Considering the conflict between businesses caused by the difference of information asymmetry and goals, Behdani et al. [12] developed a negotiation method based on multi-agent in the condition that demand is uncertain. The significance of addressing negotiation mechanisms for collaborative matters is shown by the discussed literatures. The combination of negotiation model and optimization technology is requisite to help negotiators achieve optimal selections.In order to better promote the agent’s self-adaptive negotiation ability, an army of scholars have begun to introduce machine learning into the negotiation. Bayesian Learning estimates the probability distribution of opponent negotiation parameters and preferences and adaptively adjusts the concession strategy [13]. Q-Learning generates the optimal negotiation strategy by calculating the utility cumulative value [14]. Radial Basis Function (RBF) neural network is capable of optimizing the Actor-Critic learning algorithm to predict and amend the concession magnitude of agents [15]. Unfortunately, previous self-adaptive negotiation is built on a single or integrated learning machine to draw the final result [16]. Selective ensemble learning improves the efficiency of general integrated learning machine by eliminating the less accurate ones in sublearning models [17].This paper is built on our previous work in the field of automated negotiation. In particular, it lays the foundation for accomplishing an experiment to investigate the performance of agent which is operating in the supply chain system and equipped with our negotiation model. The main contribution consists of constructing a negotiation model concerning collaborative procurement based on MAS by analyzing the characteristics of multilateral transact and proposing a negotiation strategy founded on dynamic selective ensemble learning. We exploited supply chain analysis detailedly that was based on agent technology, which detects novel patterns through the improved data mining techniques and provides a new perspective for the analysis of intelligent SCM. Moreover, agent job was led by this association between intelligent agents and machine learning to do faster and better. And the negotiation strategy has also potential for big data decrement and compression.


## 3. Methods

### 3.1. Machine Learning

Machine learning gradually becomes an irreplaceable method for processing data in the big data era. As an embranchment of AI, it has entered foreland of the mainstream computer science’s research that often uses statistical techniques to give agents the ability to learn with data, without being explicitly programmed. Machine learning has substantial connections with mathematical optimization, which delivers theory, application domains, and methods to the field. Moreover, it is a popular method practiced to devise complicated models and algorithms for prediction. These analytical models permit researchers to find results and authentic decisions and reveal hidden insights via learning from historical relationships and tendencies in the data.


### 3.2. K-Means Clustering

K-means clustering, an unsupervised learning, is fundamentally a partitioning method that is utilized to analyze data and treat the data’s observations as objects on the basis of locations and distance between diverse input data points. It helps to partition the undisposed objects into mutually exclusive clusters (K) so that objects remain as close as possible to each other within individual cluster but as far as possible from other clusters’ objects.


### 3.3. Support Vector Machine

Support Vector Machine (SVM), introduced by Vapnik, is originated from the theory of structural risk minimization belonging to statistical learning theory. The essential idea of SVM is to map input vectors into a high dimensional feature space and construct the optimal separating hyperplane in this space. SVM tries to minimize an upper bound of the generalization error by maximizing the margin between the test data and the separating hyperplane [18]. It has several merits: (1) A unique hyperplane maximizing the margin of separation between the classes can be discovered by SVM, so it has a good ability of robustness. (2) SVM’s power is to use kernel function to transform data from the low dimension space to the high dimension space and create a linear binary classifier. (3) The solving of SVM is a convex programming problem, and its local optimum is selected as the global optimum. In the field of machine learning, models combined with learning algorithms for analyzing and classifying data are represented by SVM.


## 3.1. Machine Learning

Machine learning gradually becomes an irreplaceable method for processing data in the big data era. As an embranchment of AI, it has entered foreland of the mainstream computer science’s research that often uses statistical techniques to give agents the ability to learn with data, without being explicitly programmed. Machine learning has substantial connections with mathematical optimization, which delivers theory, application domains, and methods to the field. Moreover, it is a popular method practiced to devise complicated models and algorithms for prediction. These analytical models permit researchers to find results and authentic decisions and reveal hidden insights via learning from historical relationships and tendencies in the data.


## 3.2. K-Means Clustering

K-means clustering, an unsupervised learning, is fundamentally a partitioning method that is utilized to analyze data and treat the data’s observations as objects on the basis of locations and distance between diverse input data points. It helps to partition the undisposed objects into mutually exclusive clusters (K) so that objects remain as close as possible to each other within individual cluster but as far as possible from other clusters’ objects.


## 3.3. Support Vector Machine

Support Vector Machine (SVM), introduced by Vapnik, is originated from the theory of structural risk minimization belonging to statistical learning theory. The essential idea of SVM is to map input vectors into a high dimensional feature space and construct the optimal separating hyperplane in this space. SVM tries to minimize an upper bound of the generalization error by maximizing the margin between the test data and the separating hyperplane [18]. It has several merits: (1) A unique hyperplane maximizing the margin of separation between the classes can be discovered by SVM, so it has a good ability of robustness. (2) SVM’s power is to use kernel function to transform data from the low dimension space to the high dimension space and create a linear binary classifier. (3) The solving of SVM is a convex programming problem, and its local optimum is selected as the global optimum. In the field of machine learning, models combined with learning algorithms for analyzing and classifying data are represented by SVM.


## 4. Negotiation Model of Collaborative Procurement Based on MAS

One of the most distinguishing advantages of using MAS for SCM is the dynamic supply chain construction via automated negotiation between agents. In the MAS, the coordinator agent is introduced to regulate multiple buyer and seller agents. A distributed negotiation model based on MAS is demonstrated in Figure1. The model assists enterprises in choosing the most suitable suppliers quickly, efficiently, and economically. The system consists of 3 mutually coordinated agents: CA represents the supplier agent, PA the purchasing enterprise agent of industrial cluster, and MA the broker agent of collaborative purchasing service. Agents participating in the negotiation must register with MA (such as an e-commerce platform) in advance and configure a unique ID. The MA manages various information in the negotiation process and coordinates the communication between the agents. The selection of the supplier is done with the assistance of the MA and repeated negotiation between the PA and the CA (the types of messages used by the agents in the negotiation process are shown in Table 1).Table 1
Instructions of related messages.
Agent Message Description of Message Announce Publish PA’s requirement information to registered Agents Adjust Forward PA’s improved requests to CA MA Result Inform of results and send the agreed protocol contents to CA Reply Send the product and enterprise information to PA Confirm Transform the confirmation messages or protocol modification information Request Ask MA to release massage to corresponding CA Inquire Consult MA for information about the supplier PA Improve Request PA to improve the relevant attributes on MA Selection Post results and agreements to selected PA Reject Notify the MA not to participate in the consultation CA Bid Give information of the product and the enterprise or submit the improved relevant attributes Accept Acquaint MA the accepted agreements Refuse Object the protocol or request for verificationFigure 1
MAS negotiation model of collaborative procurement.MA: (i) It promptly registers, verifies, and updates information about registered agents. (ii) It duly publishes, forwards, and organizes messages. (iii) It comprehensively utilize real-time environment and enterprise data to evaluate the operation of businesses.PA: If Reply is received, PA will compare the property values of the products given by the participating CA with accredited ones, and then send Improve to the nonoptimal CA. Subsequently, it selects CA whose values are no less than the threshold as a candidate supplier. If there is no qualified supplier, purchasing enterprise will modify the relevant threshold and renegotiate with all suppliers. Finally, the result opted for is sent to the MA with Selection. After receiving Confirm, if the CA is found to have objected to the negotiation result, check the modification and resend Improve until no objection occurs.CA: After monitoring Announce published by the MA, if the requirements of order are met, deliver the Bid to participate in the negotiation. In the event of corresponding values suggested by the PA being acceptable, during Adjust, CA sends a new Bid, or else emits Reject. Eventually, when receiving Result, the selected CA checks the content of the protocol, and if there is no objection, the Accept is fed back. Otherwise, the Refuse is transmitted to point out the problem.The specific negotiation process is showed in Figure2.Figure 2
MAS sequence diagram of negotiation model.


## 5. Self-Adaptive Negotiation Optimization Strategy

### 5.1. Negotiation Parameter

Negotiation parameters consisted of four elements which are proposed and explained in Table2. (1)NM=A,P,w,UTable 2
Instructions of negotiation parameters.
Parameters Instructions A A C represents Supplier, AP Industrial cluster buyer P Issue value of negotiation w Weight vector of the issue U Utility value of the issue


### 5.2. Concessional Learning Based on Dynamic Selective Ensemble of SVM

According to the current negotiation issues, the nearest neighbor sample set is used as the training sample to evaluate the performance of each submodel and select the better ones. In the negotiation, K-means algorithm is adopted for each negotiation issue, and the k sample subsets are found as the training datasets. And the Support Vector Machine (SVM) is used to learn the concession amplitude in each evaluation sample. Taking root-mean-square error (RMSE) as the evaluation criterion, we eliminate some submodels with poor performance. The combination weight is calculated and the final dynamic selective SVM model is established.(1) K-means algorithm generates evaluation datasets.Pq is negotiation sequence to be predicted and its number of the nearest neighbor sample in the data set PL is k, and the first k samples Pk can be got by calculating the Euclidean Distance PD between Pq and the sample points Pi.(2)PDPq,Pi=∑i∈LPq-Pi2(2) Input sample set Pk, and estimate concession amplitude with SVM. Assume that negotiation values of AC and AP in round t and issue j are denoted as PtC and PtP, respectively, and ΔDt is the negotiation difference between AC and AP obtained by (3). The average concession amplitudes of AC, AP for the first t rounds are C-tC, C-tP. As inputs to the SVM, t, ΔDt, C-tC, and C-tP are mapped to the high dimensional space using the Radial Basis Function Ht=(φ(t),φ(ΔDt),φ(C-tC),φ(C-tP)). Ct+1P is the output variable of the linear regression function obtained by (5).(3)ΔDt=PtC-PtP(4)C-tP=∑i=2tΔDiPi-1P(5)Ct+1P=wT∗φt,φΔDt,φC-tP,φC-tC+bwhere wT is the weight vector of 4 input variables and b is a offset value.The errorε between predicted value y and function value Ct+1Pcould be calculated by (6). If the error ε is regarded as an error-free fitting, then we can get the nonlinear regression function as (7) of the concession amplitude Ct+1Pof the opponent in round t+1. After the equivalent substitution, we can get the final regression function as (8).(6)max⁡0,y-Ct+1P-ε(7)Ct+1P=∑j=1naj-aj′KHt,Ht-1+b(8)Ct+1P=∑j=1najexp⁡-Ht-Ht-12σ2+bwhere aj(aj>0) is a Lagrange multiplier, identified by SVM training. Similarly, Ct+1C is the predictive concession amplitude value of AC in round t+1.(3) Using the RMSE as a filter criterion as (9), we select the corresponding first k- sublearning machines. (9)Eij=∑i=1kc~ij-Cij2kwhere c~ij is the next predictive concession value in issue j of sublearning machine i and Cij means the actual concession amplitude.(4) Calculate the combined weight of each submodel. According to the RMSE valueEij of the i-th submodel, the weight of the submodel is obtained.(10)αi=1/Eij2∑i=1k-1/Eij2When all the k sublearning machines are successfully trained, select the k- sublearning models with the smallest error. Input the actual concession Cij, and then get the output of ultimate concession about issue j in the round t+1.(11)Ct+1,jC/P=∑i=1k-αiCij


### 5.3. Utility Optimization

TakingAP as an example, the utility difference of sequential negotiations is used to decide whether to stop the current consultation. Ct+1,jP means a predictive concession value about issue j in round t+1. Pt,jP is an actual value of buyer AP about issue j in round t.(12)Ut=∑j=1nwjPt,jP(13)Pt+1,jP=Pt,jP+Ct+1,jPThe error between the predictive utility value in round t+1 and actual utility value in round t can be calculated by coordinating equations (12) and (13). While ΔUt+1,t>0, the utility of concession has not been maximized; it will increase. Conversely, end the concession.


### 5.4. Selection of the Most Appropriate Partner

After the negotiation, the common-neighbor algorithm [19] is applied to compute the similarity of the issues, and AP choose more suitable partners according to the similarity. (14)SP,C=1+e-DP,C/2∗IP∩ICDP,C means the total issue difference between AP and AC. IP∩IC is the quantity of accredited issue after the negotiation.Procedures are as follows (see Figure3). First, K-means search was adopted to generate sample sets. Second, the SVM was used to learn the concession amplitude in each evaluation sample and then eliminated the poor performance of sublearning model with RMSE and calculated the combined weight and the final dynamic selective SVM model was established. Third, the utility function was used to decide whether to terminate the negotiation. Finally, the most appropriate partner was selected on the basis of issues’ similarity calculated with common-neighbor algorithm.Figure 3
Flowchart of Self-adaptive negotiation optimization strategy.Furthermore, the self-adaptive negotiation optimization strategy is also suitable for complicated problems of big data in massively parallel environments. The complexity of big data could be decreased by data processing algorithms’ application.


## 5.1. Negotiation Parameter

Negotiation parameters consisted of four elements which are proposed and explained in Table2. (1)NM=A,P,w,UTable 2
Instructions of negotiation parameters.
Parameters Instructions A A C represents Supplier, AP Industrial cluster buyer P Issue value of negotiation w Weight vector of the issue U Utility value of the issue


## 5.2. Concessional Learning Based on Dynamic Selective Ensemble of SVM

According to the current negotiation issues, the nearest neighbor sample set is used as the training sample to evaluate the performance of each submodel and select the better ones. In the negotiation, K-means algorithm is adopted for each negotiation issue, and the k sample subsets are found as the training datasets. And the Support Vector Machine (SVM) is used to learn the concession amplitude in each evaluation sample. Taking root-mean-square error (RMSE) as the evaluation criterion, we eliminate some submodels with poor performance. The combination weight is calculated and the final dynamic selective SVM model is established.(1) K-means algorithm generates evaluation datasets.Pq is negotiation sequence to be predicted and its number of the nearest neighbor sample in the data set PL is k, and the first k samples Pk can be got by calculating the Euclidean Distance PD between Pq and the sample points Pi.(2)PDPq,Pi=∑i∈LPq-Pi2(2) Input sample set Pk, and estimate concession amplitude with SVM. Assume that negotiation values of AC and AP in round t and issue j are denoted as PtC and PtP, respectively, and ΔDt is the negotiation difference between AC and AP obtained by (3). The average concession amplitudes of AC, AP for the first t rounds are C-tC, C-tP. As inputs to the SVM, t, ΔDt, C-tC, and C-tP are mapped to the high dimensional space using the Radial Basis Function Ht=(φ(t),φ(ΔDt),φ(C-tC),φ(C-tP)). Ct+1P is the output variable of the linear regression function obtained by (5).(3)ΔDt=PtC-PtP(4)C-tP=∑i=2tΔDiPi-1P(5)Ct+1P=wT∗φt,φΔDt,φC-tP,φC-tC+bwhere wT is the weight vector of 4 input variables and b is a offset value.The errorε between predicted value y and function value Ct+1Pcould be calculated by (6). If the error ε is regarded as an error-free fitting, then we can get the nonlinear regression function as (7) of the concession amplitude Ct+1Pof the opponent in round t+1. After the equivalent substitution, we can get the final regression function as (8).(6)max⁡0,y-Ct+1P-ε(7)Ct+1P=∑j=1naj-aj′KHt,Ht-1+b(8)Ct+1P=∑j=1najexp⁡-Ht-Ht-12σ2+bwhere aj(aj>0) is a Lagrange multiplier, identified by SVM training. Similarly, Ct+1C is the predictive concession amplitude value of AC in round t+1.(3) Using the RMSE as a filter criterion as (9), we select the corresponding first k- sublearning machines. (9)Eij=∑i=1kc~ij-Cij2kwhere c~ij is the next predictive concession value in issue j of sublearning machine i and Cij means the actual concession amplitude.(4) Calculate the combined weight of each submodel. According to the RMSE valueEij of the i-th submodel, the weight of the submodel is obtained.(10)αi=1/Eij2∑i=1k-1/Eij2When all the k sublearning machines are successfully trained, select the k- sublearning models with the smallest error. Input the actual concession Cij, and then get the output of ultimate concession about issue j in the round t+1.(11)Ct+1,jC/P=∑i=1k-αiCij


## 5.3. Utility Optimization

TakingAP as an example, the utility difference of sequential negotiations is used to decide whether to stop the current consultation. Ct+1,jP means a predictive concession value about issue j in round t+1. Pt,jP is an actual value of buyer AP about issue j in round t.(12)Ut=∑j=1nwjPt,jP(13)Pt+1,jP=Pt,jP+Ct+1,jPThe error between the predictive utility value in round t+1 and actual utility value in round t can be calculated by coordinating equations (12) and (13). While ΔUt+1,t>0, the utility of concession has not been maximized; it will increase. Conversely, end the concession.


## 5.4. Selection of the Most Appropriate Partner

After the negotiation, the common-neighbor algorithm [19] is applied to compute the similarity of the issues, and AP choose more suitable partners according to the similarity. (14)SP,C=1+e-DP,C/2∗IP∩ICDP,C means the total issue difference between AP and AC. IP∩IC is the quantity of accredited issue after the negotiation.Procedures are as follows (see Figure3). First, K-means search was adopted to generate sample sets. Second, the SVM was used to learn the concession amplitude in each evaluation sample and then eliminated the poor performance of sublearning model with RMSE and calculated the combined weight and the final dynamic selective SVM model was established. Third, the utility function was used to decide whether to terminate the negotiation. Finally, the most appropriate partner was selected on the basis of issues’ similarity calculated with common-neighbor algorithm.Figure 3
Flowchart of Self-adaptive negotiation optimization strategy.Furthermore, the self-adaptive negotiation optimization strategy is also suitable for complicated problems of big data in massively parallel environments. The complexity of big data could be decreased by data processing algorithms’ application.


## 6. Simulation Example

Relying on modern logistics network system, Yiwu has become the largest small commodity distribution center in the world. The merchandise is sold to Europe, America, the Middle East, and South Asia and other regions. Yiwu market now has more than 4.3 million square meters of business area, 63 thousand operators, and more than 400 thousand kinds of products. In 2016, the trading volume of commodity markets reached 373 billion RMB and the total export-import volume extended to 223 billion RMB (Yiwu China Commodities City Group Official Website 2017). Yiwu Global Purchasing (www.yiwuok.com) as an e-commerce platform contributed 60% of the first value. The key link of supply chain synergism is to utilize e-commerce platform services to develop a healthy relationship of trust among partners and establish an effective mechanism for information collaboration. This paper takes Yiwu Small Commodity Industry Cluster (SCIC) as an instance and grabs five main parameters: product price, quantity, delivery time, warranty time, and defective rate as the negotiation issue. The effectiveness of self-adaptive Integrated Optimization Strategy (IOS) is verified by using Matlab R2014a, which is compared with the General Learning Strategies (GLS) based on single SVM.According to the historical data analysis of electric appliances industry in Yiwu SCIC, the supplier cares more about price, quantity, and delivery time, while concentrating less on warranty time and defective rate. The purchasing enterprise is a little bit different; they focus on defective rate rather than warranty time, demonstrated detailedly in Table3. Initial experimental datasets could be extracted from Dataverse repository. The whole examinations were performed on a laptop (4 GB of RAM that operated under Windows 10 desktop, Intel core i3 CPU @ 2.54 GHz). In addition, we selected the open source libraries, VLFeat for K-means clustering and LIBSVM for SVM algorithm, with excellent interfaces in Matlab for ease of use. To get the generation of optimal solutions, the experimental time is limited to 2 minutes.Table 3
Intervals and weights of negotiation issue.
Parameters Intervals of supplier’s issue Intervals of purchaser’s issue Weight vector of supplier Weight vector of purchaser Price/Yuan [100, 150] [100, 130] 0.40 0.35 Quantity [800, 1000] [850, 1200] 0.25 0.30 Delivery time/Month [1.5, 2] [1, 2] 0.20 0.20 Warranty time/Month [12, 18] [15, 24] 0.10 0.05 Defective rate/% [80, 95] [90,95] 0.05 0.10A separating hyperplane of datasets illustrated by the IOS is exhibited in Figure4. In place of the smaller margin, the hyperplane creates sheltered subregions to make most examples with identical class label drop on the same side of the decision boundary. And subregions are produced by decision boundary with diverse piecewise shapes, such as jutting out as peninsulas that are virtually surrounded by the antagonists. The misclassifications might comprise some stray examples submerged in the opponents. As the crucial target of sustaining the native class’ membership, the IOS eliminates the stray examples—those characterized as black solid symbols—from the hyperplane. As mentioned above, we are working on the assumption that the margin shrinkage is a price to trade off with the misclassification decrease in the practice stage.Figure 4
A separating hyperplane depicted by the IOS.50 couples are selected in the experiment to predict the margin of opponent concessions by comparing two strategies. According to Figure5, we can draw the conclusion that in most cases this IOS infers lower error rate than the ordinary single SVM. Additionally, the basic descriptive statistics of the data is provided in Table 4. The average error of IOS for all 50 objects is 11.97% with a standard deviation of 6.05%. It could be seen that the IOS outperforms the GLS in four vital error measures. The max error is 6.0% lower, the median error is 4.1% lower, the average error is 3.89% lower, and standard deviation is 2.32% lower than the GLS, respectively.Table 4
Error rate (%) comparison of experimental results.
Strategy Min error Max error Median error Average error Standard Deviation GLS 2.8 32.1 14.2 15.86 8.37 IOS 3.2 26.1 10.1 11.97 6.05Figure 5
Simulation results of error rate of 2 strategies.In Figure6, the average joint utility value founded by IOS is mainly concentrated in [0.50, 0.75], while another value is mainly concentrated in [0.40, 0.70]. The total average joint utility of the former is 0.641, and 60% of agents are higher than that value. Nevertheless, the numbers of the latter calculated severally are 0.565 and 46%. Distinctly, the strategy proposed by this paper is superior to GLS in both the amounts of successful agents and joint utility value.Figure 6
The comparison of joint utility and successful agent.


## 7. Conclusions

Previous studies proposed a number of basic supply chain models which are difficult to spread to universal problem fields owing to the uncertainty and complexity in real-world negotiation. The most fascinating modern application of ensemble systems lies in processing high dimensional, complex, and big data that cannot be analyzed efficiently by single-model methods. To better solve the conflict in negotiation, this paper has discussed the negotiation problem of collaborative procurement operating on MAS model with a negotiation optimization strategy. We exploited supply chain analysis minutely based on agent technology and machine learning, which provides a new perspective for the analysis of intelligent SCM. Apparently, we perceive that the negotiation and learning are key aspects in the system performance by the simulation of the proposed MAS model for the procurement management of CSC. The agents have symmetric preferences, complicating the negotiation. However, the learning helped each one acquire the ultimate strategy choice. The experimental results show that the IOS based on dynamic selective ensemble SVM can reduce the error rate and elevate the joint utility, compared with GLS of the ordinary single learning machine. The test reveals that the model plays a key role in negotiation issue inside the intelligent SCM, and the agent negotiation performance and efficiency can be enhanced via the combination of the improved data mining techniques.The procurement management of supply chain involves fabrication, inventory, distribution, and other issues, and the supply chain needs collaboration of upstream and downstream enterprises to achieve a synergistic, dynamic, and timely supply-production-marketing operation mode. Future research will focus on the resolution of conflict in self-adaptive negotiation to further improve the intelligent level of supply chain.



---

*Source: 4653648-2018-08-26.xml*