A combined algorithm for selection of optimal bidder(s)

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 r...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of revenue and pricing management 2024-04, Vol.23 (2), p.179-193
Hauptverfasser: Ravichandran, J., Vanishree, B.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 193
container_issue 2
container_start_page 179
container_title Journal of revenue and pricing management
container_volume 23
creator Ravichandran, J.
Vanishree, B.
description 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.
doi_str_mv 10.1057/s41272-023-00443-9
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2986714878</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2986714878</sourcerecordid><originalsourceid>FETCH-LOGICAL-c376t-15d17babd0f8e7952fb25502047f80f1d954d1f8b2d3bf28207903e88a8523953</originalsourceid><addsrcrecordid>eNp9kEtLAzEUhYMoWKt_wFXAjS6iN69JsizFFxTcKLgLM5OkTplOajJd-O-NHcGdq3vhfuecy0HoksItBanusqBMMQKMEwAhODFHaEaFUqSS6v34sFekMhxO0VnOGwDGKqFmSC1wG7dNN3iH634dUzd-bHGICWff-3bs4oBjwHE3dtu6x03nnE_X-eYcnYS6z_7id87R28P96_KJrF4en5eLFWm5qkZCpaOqqRsHQXtlJAsNkxIYCBU0BOqMFI4G3TDHm8A0A2WAe61rLRk3ks_R1eS7S_Fz7_NoN3GfhhJpmdGVokIrXSg2UW2KOScf7C6Vf9OXpWB_CrJTQbYUZA8FWVNEeBL5Ng5d_pNoA7LQXBWET0gux2Ht01_6P8bfUM1w2w</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2986714878</pqid></control><display><type>article</type><title>A combined algorithm for selection of optimal bidder(s)</title><source>SpringerLink Journals - AutoHoldings</source><creator>Ravichandran, J. ; Vanishree, B.</creator><creatorcontrib>Ravichandran, J. ; Vanishree, B.</creatorcontrib><description>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.</description><identifier>ISSN: 1476-6930</identifier><identifier>EISSN: 1477-657X</identifier><identifier>DOI: 10.1057/s41272-023-00443-9</identifier><language>eng</language><publisher>London: Palgrave Macmillan UK</publisher><subject>Algorithms ; Bids ; Business and Management ; Corporate purchasing ; Research Article</subject><ispartof>Journal of revenue and pricing management, 2024-04, Vol.23 (2), p.179-193</ispartof><rights>The Author(s), under exclusive licence to Springer Nature Limited 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c376t-15d17babd0f8e7952fb25502047f80f1d954d1f8b2d3bf28207903e88a8523953</citedby><cites>FETCH-LOGICAL-c376t-15d17babd0f8e7952fb25502047f80f1d954d1f8b2d3bf28207903e88a8523953</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1057/s41272-023-00443-9$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1057/s41272-023-00443-9$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Ravichandran, J.</creatorcontrib><creatorcontrib>Vanishree, B.</creatorcontrib><title>A combined algorithm for selection of optimal bidder(s)</title><title>Journal of revenue and pricing management</title><addtitle>J Revenue Pricing Manag</addtitle><description>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.</description><subject>Algorithms</subject><subject>Bids</subject><subject>Business and Management</subject><subject>Corporate purchasing</subject><subject>Research Article</subject><issn>1476-6930</issn><issn>1477-657X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNp9kEtLAzEUhYMoWKt_wFXAjS6iN69JsizFFxTcKLgLM5OkTplOajJd-O-NHcGdq3vhfuecy0HoksItBanusqBMMQKMEwAhODFHaEaFUqSS6v34sFekMhxO0VnOGwDGKqFmSC1wG7dNN3iH634dUzd-bHGICWff-3bs4oBjwHE3dtu6x03nnE_X-eYcnYS6z_7id87R28P96_KJrF4en5eLFWm5qkZCpaOqqRsHQXtlJAsNkxIYCBU0BOqMFI4G3TDHm8A0A2WAe61rLRk3ks_R1eS7S_Fz7_NoN3GfhhJpmdGVokIrXSg2UW2KOScf7C6Vf9OXpWB_CrJTQbYUZA8FWVNEeBL5Ng5d_pNoA7LQXBWET0gux2Ht01_6P8bfUM1w2w</recordid><startdate>20240401</startdate><enddate>20240401</enddate><creator>Ravichandran, J.</creator><creator>Vanishree, B.</creator><general>Palgrave Macmillan UK</general><general>Palgrave Macmillan</general><scope>OQ6</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20240401</creationdate><title>A combined algorithm for selection of optimal bidder(s)</title><author>Ravichandran, J. ; Vanishree, B.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c376t-15d17babd0f8e7952fb25502047f80f1d954d1f8b2d3bf28207903e88a8523953</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Algorithms</topic><topic>Bids</topic><topic>Business and Management</topic><topic>Corporate purchasing</topic><topic>Research Article</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ravichandran, J.</creatorcontrib><creatorcontrib>Vanishree, B.</creatorcontrib><collection>ECONIS</collection><collection>CrossRef</collection><jtitle>Journal of revenue and pricing management</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ravichandran, J.</au><au>Vanishree, B.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A combined algorithm for selection of optimal bidder(s)</atitle><jtitle>Journal of revenue and pricing management</jtitle><stitle>J Revenue Pricing Manag</stitle><date>2024-04-01</date><risdate>2024</risdate><volume>23</volume><issue>2</issue><spage>179</spage><epage>193</epage><pages>179-193</pages><issn>1476-6930</issn><eissn>1477-657X</eissn><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.</abstract><cop>London</cop><pub>Palgrave Macmillan UK</pub><doi>10.1057/s41272-023-00443-9</doi><tpages>15</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1476-6930
ispartof Journal of revenue and pricing management, 2024-04, Vol.23 (2), p.179-193
issn 1476-6930
1477-657X
language eng
recordid cdi_proquest_journals_2986714878
source SpringerLink Journals - AutoHoldings
subjects Algorithms
Bids
Business and Management
Corporate purchasing
Research Article
title A combined algorithm for selection of optimal bidder(s)
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T23%3A47%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20combined%20algorithm%20for%20selection%20of%20optimal%20bidder(s)&rft.jtitle=Journal%20of%20revenue%20and%20pricing%20management&rft.au=Ravichandran,%20J.&rft.date=2024-04-01&rft.volume=23&rft.issue=2&rft.spage=179&rft.epage=193&rft.pages=179-193&rft.issn=1476-6930&rft.eissn=1477-657X&rft_id=info:doi/10.1057/s41272-023-00443-9&rft_dat=%3Cproquest_cross%3E2986714878%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2986714878&rft_id=info:pmid/&rfr_iscdi=true