A combined algorithm for selection of optimal bidder(s)

被引:1
|
作者
Ravichandran, J. [1 ]
Vanishree, B. [1 ]
机构
[1] Amrita Vishwa Vidyapeetham, Amrita Sch Phys Sci, Dept Math, Coimbatore 641112, India
关键词
Artificial neural network; Composite score; Financial score; Hyper sphere cluster density; K-means clustering; Multi-layer perceptron; Quality and cost-based selection; Technical score;
D O I
10.1057/s41272-023-00443-9
中图分类号
F8 [财政、金融];
学科分类号
0202 ;
摘要
Organizations (manufacturing, service, healthcare etc.) buy goods and services for their operational needs from reliable and subject-optimized companies frequently. In fact, procurement processes follow stringent procedures to ensure that the process is fair and efficient with a minimal wastage of resources. The main challenge of all such procurement processes is the selection of optimal bidder(s) such that they satisfy the 'best value for money' criteria than accomplishing the 'best optimized price' criteria alone. In fact, choosing an optimal bidder requires, in general, consideration of both technical and financial criteria with appropriate assignment of weightage for each. In this work, an innovative approach is proposed where only an optimal set of shortlisted bidders is made to undergo quality and cost-based selection (QCBS) evaluation procedure. The proposed method combines a few significant algorithms together for effective results. These algorithms are studied and implemented in the following order: hyper sphere cluster density (HSCD) algorithm; K-means algorithm; artificial neural network (ANN) model and QCBS evaluation model. Initially, the coupling of HSCD algorithm with standard K-means is done for creating robust and reliable non-overlapping clusters. Then, the multi-layer perceptron (MLP) model of ANN is applied to determine optimal cluster from set of all non-overlapping clusters. This model is effective in reducing the laborious task of unnecessarily evaluating all the shortlisted bidders. Next, the QCBS evaluation is done to select the optimal bidder from the already chosen optimal cluster. Numerical example is considered to demonstrate the proposed procedure. Several conclusions are drawn based on which recommendations for the application of the proposed method are made.
引用
收藏
页码:179 / 193
页数:15
相关论文
共 50 条
  • [1] A combined algorithm for selection of optimal bidder(s)
    J. Ravichandran
    B. Vanishree
    Journal of Revenue and Pricing Management, 2024, 23 : 179 - 193
  • [2] AN OPTIMAL ALGORITHM FOR PARALLEL SELECTION
    AKL, SG
    INFORMATION PROCESSING LETTERS, 1984, 19 (01) : 47 - 50
  • [3] Bidder optimal assignments for general utilities
    Duetting, Paul
    Henzinger, Monika
    Weber, Ingmar
    THEORETICAL COMPUTER SCIENCE, 2013, 478 : 22 - 32
  • [4] Bidder Optimal Assignments for General Utilities
    Duetting, Paul
    Henzinger, Monika
    Weber, Ingmar
    INTERNET AND NETWORK ECONOMICS, PROCEEDINGS, 2009, 5929 : 575 - 582
  • [5] The Bidder's Curse
    Malmendier, Ulrike
    Lee, Young Han
    AMERICAN ECONOMIC REVIEW, 2011, 101 (02): : 749 - 787
  • [6] Relay Node Selection for Cooperative Wireless Systems using the Bidder's Game
    Adeleke, Oluseye A.
    Akande, Damilare O.
    2017 IEEE 3RD INTERNATIONAL CONFERENCE ON ELECTRO-TECHNOLOGY FOR NATIONAL DEVELOPMENT (NIGERCON), 2017, : 101 - 106
  • [7] Bidder Solicitation, Adverse Selection, and the Failure of Competition
    Lauermann, Stephan
    Wolinsky, Asher
    AMERICAN ECONOMIC REVIEW, 2017, 107 (06): : 1399 - 1429
  • [8] Optimal Channel Selection algorithm for CRahNs
    Pal, Raghavendra
    Dahiya, Suresh
    PHYSICAL COMMUNICATION, 2022, 54
  • [9] Selection of Optimal Fault Location Algorithm
    Kezunovic, M.
    Knezev, M.
    2008 IEEE POWER & ENERGY SOCIETY GENERAL MEETING, VOLS 1-11, 2008, : 1272 - 1276
  • [10] RANDOMIZED OPTIMAL ALGORITHM FOR SLOPE SELECTION
    MATOUSEK, J
    INFORMATION PROCESSING LETTERS, 1991, 39 (04) : 183 - 187