.png){kind=icon}
.png){kind=icon}
Return
A chaotic owl search algorithm based bilateral negotiation model
.png){kind=icon}
OA
AI
DOI：10.1016/j.asej.2020.01.005.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Negotiation is a core activity between stakeholders with different goals. This paper offers a solution based on the automated bilateral negotiation model using a recent meta-heuristic algorithm Owl Search Algorithm (OSA), and chaos theory. The proposed algorithm called Chaotic Owl Search Algorithm (COSA). This algorithm is used to adapt negotiation strategies for computing negotiation offers throughout the negotiation process. For this aim, a negotiation grasped between two parties during several negotiation rounds. The results of the proposed algorithm compared with the standard OSA, PSO and the most common negotiation tactics. Different control parameters considered for accurate judgments of the suggested optimization techniques. The comparative study proved that the COSA provides accurate results over compared algorithms in terms of Average buyers' /seller's utility, Average negotiation rounds and Average processing time. This paper is the first of integrating chaos theory with the OSA in optimization problems and especially in the negotiation process. (c) 2020 The Authors. Published by Elsevier B.V. on behalf of Faculty of Engineering, Ain Shams University. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-ncnd/4.0/).
Keywords:
Owl search algorithm
Bilateral negotiation
Chaos
Meta-heuristic algorithms
Logistic chaotic map
Negotiation tactics
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.9
Papers:
3.4K
Citations:
1.2W