IDEAS home Printed from https://ideas.repec.org/a/pal/jorapm/v23y2024i2d10.1057_s41272-023-00443-9.html
   My bibliography  Save this article

A combined algorithm for selection of optimal bidder(s)

Author

Listed:
  • J. Ravichandran

    (Amrita School of Physical Sciences, Amrita Vishwa Vidyapeetham)

  • B. Vanishree

    (Amrita School of Physical Sciences, Amrita Vishwa Vidyapeetham)

Abstract

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.

Suggested Citation

  • J. Ravichandran & B. Vanishree, 2024. "A combined algorithm for selection of optimal bidder(s)," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 23(2), pages 179-193, April.
  • Handle: RePEc:pal:jorapm:v:23:y:2024:i:2:d:10.1057_s41272-023-00443-9
    DOI: 10.1057/s41272-023-00443-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/s41272-023-00443-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1057/s41272-023-00443-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:jorapm:v:23:y:2024:i:2:d:10.1057_s41272-023-00443-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.