Abstract
In this paper, game-theoretic optimization by particle swarm optimization (PSO) is used to determine the Nash equilibrium value, in order to resolve the confusion in choosing appropriate bidders in multi-round procurement. To this end, we introduce an approach that proposes (i) a game-theoretic model of the multi-round procurement problem; (ii) a Nash equilibrium strategy corresponding to the multi-round strategy bid; and (iii) an application of PSO for the determination of the global Nash equilibrium point. The balance point in Nash equilibrium can help to maintain a sustainable structure, not only in terms of project management but also in terms of future cooperation. As an alternative to procuring entities subjectively, a methodology using Nash equilibrium to support decision-making is developed to create a balance point that benefits procurement in which buyers and suppliers need multiple rounds of bidding. To solve complex optimization problems like this, PSO has been found to be one of the most effective meta-heuristic algorithms. These results propose a sustainable optimization procedure for the question of how to choose bidders and ensure a win-win relationship for all participants involved in the multi-round procurement process.
Highlights
Project management is a key activity in software development organizations
A decision support system based on particle swarm optimization (PSO)-MRP was developed to define the Nash equilibrium point for multi-round procurement
This paper at hand presents a novel approach on how to combine Game theory and PSO algorithm to support decision-making in the multi-round of an auction
Summary
Project management is a key activity in software development organizations. One of the key problems in software project planning is the scheduling, which involves resource allocation and scheduling activities on time, optimizing the cost and/or duration of the project. The scheduling is a complex constrained optimization problem, because for the optimization of resources, time, and cost, it is necessary to consider a combination of variables, rules, and restrictions that cause the problem to be NP-hard search-based software engineering (SBSE) is an emerging area focused on solving software engineering problems by using search-based optimization algorithms. The software project scheduling problem (SPSP) consists in finding a suitable assignment of employees to tasks, such that the project can be delivered in the shortest possible time and with the minimum cost [1,2].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Computational Intelligence Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.