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 条
  • [21] Selection of the optimal parameter value for the ISOMAP algorithm
    Shao, C
    Huang, HK
    MICAI 2005: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2005, 3789 : 396 - 404
  • [22] AN ALGORITHM FOR OPTIMAL ROUTE SELECTION IN SNA NETWORKS
    GAVISH, B
    HANTLER, SL
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1983, 31 (10) : 1154 - 1161
  • [23] Optimal Codec Selection Algorithm for Audio Streaming
    Tortosa, Ruben
    Jimenez, Jose M.
    Diaz, Juan R.
    Lloret, Jaime
    2014 GLOBECOM WORKSHOPS (GC WKSHPS), 2014, : 237 - 242
  • [24] Optimal design using clonal selection algorithm
    Su, YH
    Shyr, WJ
    Su, TJ
    KNOWLEDGE-BASED INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS, PT 1, PROCEEDINGS, 2005, 3681 : 604 - 610
  • [25] Optimal Replica Selection Algorithm in Data Grid
    Tang, Bing
    Zhang, Li
    THEORETICAL AND MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE, 2011, 164 : 297 - 304
  • [26] AN OPTIMAL ALGORITHM FOR SELECTION IN A MIN-HEAP
    FREDERICKSON, GN
    INFORMATION AND COMPUTATION, 1993, 104 (02) : 197 - 214
  • [27] CONSTRAINT ALGORITHM FOR OPTIMAL SELECTION OF MANUFACTURING SYSTEMS
    SEWELL, GAE
    PORTER, B
    INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 1974, 5 (06) : 511 - 521
  • [28] A DYNAMIC SELECTION ALGORITHM FOR GLOBALLY OPTIMAL SUBSETS
    YU, B
    YUAN, BZ
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 1992, 5 (05) : 457 - 462
  • [29] Optimal Randomized Algorithm for the Density Selection Problem
    Lin, Tien-Ching
    Lee, D. T.
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 1004 - +
  • [30] Selection of optimal smoothing algorithm for voltammetric curves
    Jakubowska, Malgorzata
    Hull, Ewa
    Piech, Robert
    Kubiak, Wladyslaw W.
    CHEMIA ANALITYCZNA, 2008, 53 (02): : 215 - 226