Loading…

Simplifying the Complexity in the Problem of Choosing the Best Private-Sector Partner

Governments frequently partner with the private sector to provide infrastructure and public services. These cooperations, known as public–private partnerships (PPPs), have often failed. Sometimes, due to the problem’s complexity, the public sector cannot choose the right partner for these projects,...

Full description

Saved in:
Bibliographic Details
Published in:Systems (Basel) 2023-02, Vol.11 (2), p.80
Main Authors: Qiu, Peiyao, Sorourkhah, Ali, Kausar, Nasreen, Cagin, Tonguc, Edalatpanah, Seyyed Ahmad
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c443t-47a07cf084f5773b961c8e8959d048da860cf9c71bdc741ecaef0641a0402e3c3
cites cdi_FETCH-LOGICAL-c443t-47a07cf084f5773b961c8e8959d048da860cf9c71bdc741ecaef0641a0402e3c3
container_end_page
container_issue 2
container_start_page 80
container_title Systems (Basel)
container_volume 11
creator Qiu, Peiyao
Sorourkhah, Ali
Kausar, Nasreen
Cagin, Tonguc
Edalatpanah, Seyyed Ahmad
description Governments frequently partner with the private sector to provide infrastructure and public services. These cooperations, known as public–private partnerships (PPPs), have often failed. Sometimes, due to the problem’s complexity, the public sector cannot choose the right partner for these projects, which is one of the main reasons for failures. Complexity in such problems is associated with a large number of indicators, imprecise judgments of decision-makers or problem owners, and the unpredictability of the environment (under conditions of uncertainty). Therefore, presenting a simplified algorithm for this complicated process is the primary goal of the current research so that it can consider the problem’s various dimensions. While many researchers address the critical risk factors (CRFs) and others focus on key performance indicators (KPIs), this research has considered both CRFs and KPIs to choose the best private-sector partner. In addition, we used single-valued neutrosophic sets (SVNSs) to collect decision-makers’ views, which can handle ambiguous, incomplete, or imprecise information. Next, by defining the ideal alternative and using the similarity measure, we specified the ranks of the alternative. Additionally, to face the uncertain environment, we examined the performance of options in four future scenarios. The steps of the proposed algorithm are explained in the form of a numerical example. The results of this research showed that by employing a simple algorithm, even people who do not have significant operations research knowledge could choose the best option by paying attention to the dimensions of the problem complexity.
doi_str_mv 10.3390/systems11020080
format article
fullrecord <record><control><sourceid>gale_doaj_</sourceid><recordid>TN_cdi_doaj_primary_oai_doaj_org_article_cd228083f7f0415e8f370e1f1808f1dd</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A742984519</galeid><doaj_id>oai_doaj_org_article_cd228083f7f0415e8f370e1f1808f1dd</doaj_id><sourcerecordid>A742984519</sourcerecordid><originalsourceid>FETCH-LOGICAL-c443t-47a07cf084f5773b961c8e8959d048da860cf9c71bdc741ecaef0641a0402e3c3</originalsourceid><addsrcrecordid>eNptUU1LAzEQXUTBop69LnhenWzSTXLU4kehYEE9hzQ7qSndTU2i2H9vbP3G5JCZl_ceb5iiOCZwSqmEs7iOCbtICNQAAnaKQQ1cVkIO2e6Per84inEB-UhCRcMGxcOd61ZLZ9eun5fpEcuRzz2-urQuXb9BpsHPltiV3pajR-_jJ_MCY8qf7kUnrO7QJB_KqQ6px3BY7Fm9jHj08R4UD1eX96ObanJ7PR6dTyrDGE0V4xq4sSCYHXJOZ7IhRmAOKltgotWiAWOl4WTWGs4IGo0WGkY0MKiRGnpQjLe-rdcLtQqu02GtvHZqA_gwVzmQM0tUpq1rAYJaboGRIQpLOSCxJIOWtG32Otl6rYJ_es6zqYV_Dn2Or2rOZSMYb8Q3a66zqeutT0GbzkWjzjmrpWBDIjPr9B9Wvi12zvgercv4L8HZVmCCjzGg_RqGgHrfsPqzYfoGyK2YZA</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2779684768</pqid></control><display><type>article</type><title>Simplifying the Complexity in the Problem of Choosing the Best Private-Sector Partner</title><source>Publicly Available Content (ProQuest)</source><creator>Qiu, Peiyao ; Sorourkhah, Ali ; Kausar, Nasreen ; Cagin, Tonguc ; Edalatpanah, Seyyed Ahmad</creator><creatorcontrib>Qiu, Peiyao ; Sorourkhah, Ali ; Kausar, Nasreen ; Cagin, Tonguc ; Edalatpanah, Seyyed Ahmad</creatorcontrib><description>Governments frequently partner with the private sector to provide infrastructure and public services. These cooperations, known as public–private partnerships (PPPs), have often failed. Sometimes, due to the problem’s complexity, the public sector cannot choose the right partner for these projects, which is one of the main reasons for failures. Complexity in such problems is associated with a large number of indicators, imprecise judgments of decision-makers or problem owners, and the unpredictability of the environment (under conditions of uncertainty). Therefore, presenting a simplified algorithm for this complicated process is the primary goal of the current research so that it can consider the problem’s various dimensions. While many researchers address the critical risk factors (CRFs) and others focus on key performance indicators (KPIs), this research has considered both CRFs and KPIs to choose the best private-sector partner. In addition, we used single-valued neutrosophic sets (SVNSs) to collect decision-makers’ views, which can handle ambiguous, incomplete, or imprecise information. Next, by defining the ideal alternative and using the similarity measure, we specified the ranks of the alternative. Additionally, to face the uncertain environment, we examined the performance of options in four future scenarios. The steps of the proposed algorithm are explained in the form of a numerical example. The results of this research showed that by employing a simple algorithm, even people who do not have significant operations research knowledge could choose the best option by paying attention to the dimensions of the problem complexity.</description><identifier>ISSN: 2079-8954</identifier><identifier>EISSN: 2079-8954</identifier><identifier>DOI: 10.3390/systems11020080</identifier><language>eng</language><publisher>Basel: MDPI AG</publisher><subject>Algorithms ; Bids ; Complexity ; Data envelopment analysis ; Decision making ; Failure ; Fuzzy sets ; Indicators ; key performance indicators ; Management science ; Medical research ; Medicine, Experimental ; Methods ; Operations research ; Politics ; Private sector ; Public sector ; Public-private sector cooperation ; public–private partnership ; Researchers ; risk factors ; single-valued neutrosophic sets ; Social service ; State budgets ; Sustainable development</subject><ispartof>Systems (Basel), 2023-02, Vol.11 (2), p.80</ispartof><rights>COPYRIGHT 2023 MDPI AG</rights><rights>2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c443t-47a07cf084f5773b961c8e8959d048da860cf9c71bdc741ecaef0641a0402e3c3</citedby><cites>FETCH-LOGICAL-c443t-47a07cf084f5773b961c8e8959d048da860cf9c71bdc741ecaef0641a0402e3c3</cites><orcidid>0000-0001-9349-5695 ; 0000-0002-4961-5941</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/2779684768/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2779684768?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>314,780,784,25753,27924,27925,37012,44590,75126</link.rule.ids></links><search><creatorcontrib>Qiu, Peiyao</creatorcontrib><creatorcontrib>Sorourkhah, Ali</creatorcontrib><creatorcontrib>Kausar, Nasreen</creatorcontrib><creatorcontrib>Cagin, Tonguc</creatorcontrib><creatorcontrib>Edalatpanah, Seyyed Ahmad</creatorcontrib><title>Simplifying the Complexity in the Problem of Choosing the Best Private-Sector Partner</title><title>Systems (Basel)</title><description>Governments frequently partner with the private sector to provide infrastructure and public services. These cooperations, known as public–private partnerships (PPPs), have often failed. Sometimes, due to the problem’s complexity, the public sector cannot choose the right partner for these projects, which is one of the main reasons for failures. Complexity in such problems is associated with a large number of indicators, imprecise judgments of decision-makers or problem owners, and the unpredictability of the environment (under conditions of uncertainty). Therefore, presenting a simplified algorithm for this complicated process is the primary goal of the current research so that it can consider the problem’s various dimensions. While many researchers address the critical risk factors (CRFs) and others focus on key performance indicators (KPIs), this research has considered both CRFs and KPIs to choose the best private-sector partner. In addition, we used single-valued neutrosophic sets (SVNSs) to collect decision-makers’ views, which can handle ambiguous, incomplete, or imprecise information. Next, by defining the ideal alternative and using the similarity measure, we specified the ranks of the alternative. Additionally, to face the uncertain environment, we examined the performance of options in four future scenarios. The steps of the proposed algorithm are explained in the form of a numerical example. The results of this research showed that by employing a simple algorithm, even people who do not have significant operations research knowledge could choose the best option by paying attention to the dimensions of the problem complexity.</description><subject>Algorithms</subject><subject>Bids</subject><subject>Complexity</subject><subject>Data envelopment analysis</subject><subject>Decision making</subject><subject>Failure</subject><subject>Fuzzy sets</subject><subject>Indicators</subject><subject>key performance indicators</subject><subject>Management science</subject><subject>Medical research</subject><subject>Medicine, Experimental</subject><subject>Methods</subject><subject>Operations research</subject><subject>Politics</subject><subject>Private sector</subject><subject>Public sector</subject><subject>Public-private sector cooperation</subject><subject>public–private partnership</subject><subject>Researchers</subject><subject>risk factors</subject><subject>single-valued neutrosophic sets</subject><subject>Social service</subject><subject>State budgets</subject><subject>Sustainable development</subject><issn>2079-8954</issn><issn>2079-8954</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><sourceid>DOA</sourceid><recordid>eNptUU1LAzEQXUTBop69LnhenWzSTXLU4kehYEE9hzQ7qSndTU2i2H9vbP3G5JCZl_ceb5iiOCZwSqmEs7iOCbtICNQAAnaKQQ1cVkIO2e6Per84inEB-UhCRcMGxcOd61ZLZ9eun5fpEcuRzz2-urQuXb9BpsHPltiV3pajR-_jJ_MCY8qf7kUnrO7QJB_KqQ6px3BY7Fm9jHj08R4UD1eX96ObanJ7PR6dTyrDGE0V4xq4sSCYHXJOZ7IhRmAOKltgotWiAWOl4WTWGs4IGo0WGkY0MKiRGnpQjLe-rdcLtQqu02GtvHZqA_gwVzmQM0tUpq1rAYJaboGRIQpLOSCxJIOWtG32Otl6rYJ_es6zqYV_Dn2Or2rOZSMYb8Q3a66zqeutT0GbzkWjzjmrpWBDIjPr9B9Wvi12zvgercv4L8HZVmCCjzGg_RqGgHrfsPqzYfoGyK2YZA</recordid><startdate>20230201</startdate><enddate>20230201</enddate><creator>Qiu, Peiyao</creator><creator>Sorourkhah, Ali</creator><creator>Kausar, Nasreen</creator><creator>Cagin, Tonguc</creator><creator>Edalatpanah, Seyyed Ahmad</creator><general>MDPI AG</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7XB</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope><scope>DOA</scope><orcidid>https://orcid.org/0000-0001-9349-5695</orcidid><orcidid>https://orcid.org/0000-0002-4961-5941</orcidid></search><sort><creationdate>20230201</creationdate><title>Simplifying the Complexity in the Problem of Choosing the Best Private-Sector Partner</title><author>Qiu, Peiyao ; Sorourkhah, Ali ; Kausar, Nasreen ; Cagin, Tonguc ; Edalatpanah, Seyyed Ahmad</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c443t-47a07cf084f5773b961c8e8959d048da860cf9c71bdc741ecaef0641a0402e3c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Bids</topic><topic>Complexity</topic><topic>Data envelopment analysis</topic><topic>Decision making</topic><topic>Failure</topic><topic>Fuzzy sets</topic><topic>Indicators</topic><topic>key performance indicators</topic><topic>Management science</topic><topic>Medical research</topic><topic>Medicine, Experimental</topic><topic>Methods</topic><topic>Operations research</topic><topic>Politics</topic><topic>Private sector</topic><topic>Public sector</topic><topic>Public-private sector cooperation</topic><topic>public–private partnership</topic><topic>Researchers</topic><topic>risk factors</topic><topic>single-valued neutrosophic sets</topic><topic>Social service</topic><topic>State budgets</topic><topic>Sustainable development</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Qiu, Peiyao</creatorcontrib><creatorcontrib>Sorourkhah, Ali</creatorcontrib><creatorcontrib>Kausar, Nasreen</creatorcontrib><creatorcontrib>Cagin, Tonguc</creatorcontrib><creatorcontrib>Edalatpanah, Seyyed Ahmad</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>Publicly Available Content (ProQuest)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><collection>Directory of Open Access Journals</collection><jtitle>Systems (Basel)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Qiu, Peiyao</au><au>Sorourkhah, Ali</au><au>Kausar, Nasreen</au><au>Cagin, Tonguc</au><au>Edalatpanah, Seyyed Ahmad</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Simplifying the Complexity in the Problem of Choosing the Best Private-Sector Partner</atitle><jtitle>Systems (Basel)</jtitle><date>2023-02-01</date><risdate>2023</risdate><volume>11</volume><issue>2</issue><spage>80</spage><pages>80-</pages><issn>2079-8954</issn><eissn>2079-8954</eissn><abstract>Governments frequently partner with the private sector to provide infrastructure and public services. These cooperations, known as public–private partnerships (PPPs), have often failed. Sometimes, due to the problem’s complexity, the public sector cannot choose the right partner for these projects, which is one of the main reasons for failures. Complexity in such problems is associated with a large number of indicators, imprecise judgments of decision-makers or problem owners, and the unpredictability of the environment (under conditions of uncertainty). Therefore, presenting a simplified algorithm for this complicated process is the primary goal of the current research so that it can consider the problem’s various dimensions. While many researchers address the critical risk factors (CRFs) and others focus on key performance indicators (KPIs), this research has considered both CRFs and KPIs to choose the best private-sector partner. In addition, we used single-valued neutrosophic sets (SVNSs) to collect decision-makers’ views, which can handle ambiguous, incomplete, or imprecise information. Next, by defining the ideal alternative and using the similarity measure, we specified the ranks of the alternative. Additionally, to face the uncertain environment, we examined the performance of options in four future scenarios. The steps of the proposed algorithm are explained in the form of a numerical example. The results of this research showed that by employing a simple algorithm, even people who do not have significant operations research knowledge could choose the best option by paying attention to the dimensions of the problem complexity.</abstract><cop>Basel</cop><pub>MDPI AG</pub><doi>10.3390/systems11020080</doi><orcidid>https://orcid.org/0000-0001-9349-5695</orcidid><orcidid>https://orcid.org/0000-0002-4961-5941</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 2079-8954
ispartof Systems (Basel), 2023-02, Vol.11 (2), p.80
issn 2079-8954
2079-8954
language eng
recordid cdi_doaj_primary_oai_doaj_org_article_cd228083f7f0415e8f370e1f1808f1dd
source Publicly Available Content (ProQuest)
subjects Algorithms
Bids
Complexity
Data envelopment analysis
Decision making
Failure
Fuzzy sets
Indicators
key performance indicators
Management science
Medical research
Medicine, Experimental
Methods
Operations research
Politics
Private sector
Public sector
Public-private sector cooperation
public–private partnership
Researchers
risk factors
single-valued neutrosophic sets
Social service
State budgets
Sustainable development
title Simplifying the Complexity in the Problem of Choosing the Best Private-Sector Partner
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-03T21%3A14%3A34IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_doaj_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Simplifying%20the%20Complexity%20in%20the%20Problem%20of%20Choosing%20the%20Best%20Private-Sector%20Partner&rft.jtitle=Systems%20(Basel)&rft.au=Qiu,%20Peiyao&rft.date=2023-02-01&rft.volume=11&rft.issue=2&rft.spage=80&rft.pages=80-&rft.issn=2079-8954&rft.eissn=2079-8954&rft_id=info:doi/10.3390/systems11020080&rft_dat=%3Cgale_doaj_%3EA742984519%3C/gale_doaj_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c443t-47a07cf084f5773b961c8e8959d048da860cf9c71bdc741ecaef0641a0402e3c3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2779684768&rft_id=info:pmid/&rft_galeid=A742984519&rfr_iscdi=true