A Novel Ideal Point Method for Uncertain Random Multi-Objective Programming Problem Under PE Criterion
There are two kinds of methods for uncertain random multi-objective programming (URMOP) problem now. One is to convert the URMOP problem into deterministic multi-objective programming (DMOP) problem directly, and then solves the DMOP problem, which neglects the nature of the uncertainty and randomne...
Gespeichert in:
| Veröffentlicht in: | IEEE access Jg. 7; S. 12982 - 12992 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Piscataway
IEEE
2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Schlagworte: | |
| ISSN: | 2169-3536 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | There are two kinds of methods for uncertain random multi-objective programming (URMOP) problem now. One is to convert the URMOP problem into deterministic multi-objective programming (DMOP) problem directly, and then solves the DMOP problem, which neglects the nature of the uncertainty and randomness. The other is to use the linear weighting method (LVM) to convert the URMOP problem into the uncertain random single-objective programming (URSOP) problem, and then convert it into the deterministic single-objective programming (DSOP) problem, which can be solved directly. However, the LVM has limited application range and low reliability. In this paper, we propose a new method named ideal point method (IPM) for solving the URMOP problem. First, we define the ideal point of URMOP. Based on different modules, we propose three different IPMs named SD-IPM, SWS-IPM, and WMM-IPM. It is then proved that under the P E criterion, the three IPMs can transform the URMOP problem into its equivalent URSOP problem, that is, the optimal solution of the transformed URSOP problem is proved to be the Pareto efficient solution of the original URMOP problem. Then, the URSOP problem can be transformed into its equivalent DSOP problem, which can be solved directly. The example discusses the differences and application range of the IPMs and other methods. The influences of weights are discussed simultaneously. |
|---|---|
| AbstractList | There are two kinds of methods for uncertain random multi-objective programming (URMOP) problem now. One is to convert the URMOP problem into deterministic multi-objective programming (DMOP) problem directly, and then solves the DMOP problem, which neglects the nature of the uncertainty and randomness. The other is to use the linear weighting method (LVM) to convert the URMOP problem into the uncertain random single-objective programming (URSOP) problem, and then convert it into the deterministic single-objective programming (DSOP) problem, which can be solved directly. However, the LVM has limited application range and low reliability. In this paper, we propose a new method named ideal point method (IPM) for solving the URMOP problem. First, we define the ideal point of URMOP. Based on different modules, we propose three different IPMs named SD-IPM, SWS-IPM, and WMM-IPM. It is then proved that under the PE criterion, the three IPMs can transform the URMOP problem into its equivalent URSOP problem, that is, the optimal solution of the transformed URSOP problem is proved to be the Pareto efficient solution of the original URMOP problem. Then, the URSOP problem can be transformed into its equivalent DSOP problem, which can be solved directly. The example discusses the differences and application range of the IPMs and other methods. The influences of weights are discussed simultaneously. There are two kinds of methods for uncertain random multi-objective programming (URMOP) problem now. One is to convert the URMOP problem into deterministic multi-objective programming (DMOP) problem directly, and then solves the DMOP problem, which neglects the nature of the uncertainty and randomness. The other is to use the linear weighting method (LVM) to convert the URMOP problem into the uncertain random single-objective programming (URSOP) problem, and then convert it into the deterministic single-objective programming (DSOP) problem, which can be solved directly. However, the LVM has limited application range and low reliability. In this paper, we propose a new method named ideal point method (IPM) for solving the URMOP problem. First, we define the ideal point of URMOP. Based on different modules, we propose three different IPMs named SD-IPM, SWS-IPM, and WMM-IPM. It is then proved that under the P E criterion, the three IPMs can transform the URMOP problem into its equivalent URSOP problem, that is, the optimal solution of the transformed URSOP problem is proved to be the Pareto efficient solution of the original URMOP problem. Then, the URSOP problem can be transformed into its equivalent DSOP problem, which can be solved directly. The example discusses the differences and application range of the IPMs and other methods. The influences of weights are discussed simultaneously. |
| Author | Wang, Ying Sun, Yun Qi, Yao Liang, Ying |
| Author_xml | – sequence: 1 givenname: Yao orcidid: 0000-0003-2670-8042 surname: Qi fullname: Qi, Yao email: qiyao1234@aliyun.com organization: Equipment Management and UAV Engineering College, Air Force Engineering University, Xi'an, China – sequence: 2 givenname: Ying surname: Wang fullname: Wang, Ying organization: Equipment Management and UAV Engineering College, Air Force Engineering University, Xi'an, China – sequence: 3 givenname: Ying surname: Liang fullname: Liang, Ying organization: Air Force Research Institute, Beijing, China – sequence: 4 givenname: Yun surname: Sun fullname: Sun, Yun organization: Equipment Management and UAV Engineering College, Air Force Engineering University, Xi'an, China |
| BookMark | eNo9jm9LwzAQxoMoqNNP4JuArzuTS9M2L0eZOvDPcPq6pMllZrSJZt3Ab2914nFwDw_P_e7OyXGIAQm54mzKOVM3s7qer1ZTYFxNoVJQSH5EzoAXKhNSFKfkcrvdsLGq0ZLlGXEz-hT32NGFRd3RZfRhoI84vEdLXUz0LRhMg_aBvuhgY08fd93gs-d2g2bwe6TLFNdJ970P6x_ddtiPSxYTXc5pnfyAycdwQU6c7rZ4-Tcn5O12_lrfZw_Pd4t69pBZLhXPEA1CZaUxrbO5aq10SplWSXBlAZaDAA6tq4xxKh-bK6aZK4FBjta2ICZkceDaqDfNR_K9Tl9N1L75NWJaNzoN3nTYOCNAV8zkzrhcMKNcaUSZg8NCC63NyLo-sD5S_Nzhdmg2cZfC-H4DuZSF4KqqxtTVIeUR8f9iVXAOnItvXSN8kg |
| CODEN | IAECCG |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019 |
| DBID | 97E ESBDL RIA RIE 7SC 7SP 7SR 8BQ 8FD JG9 JQ2 L7M L~C L~D DOA |
| DOI | 10.1109/ACCESS.2019.2892651 |
| DatabaseName | IEEE Xplore (IEEE) IEEE Xplore Open Access Journals IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) Computer and Information Systems Abstracts Electronics & Communications Abstracts Engineered Materials Abstracts METADEX Technology Research Database Materials Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional DOAJ Directory of Open Access Journals |
| DatabaseTitle | Materials Research Database Engineered Materials Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace METADEX Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Materials Research Database |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 2169-3536 |
| EndPage | 12992 |
| ExternalDocumentID | oai_doaj_org_article_fc32a80c4fcf430c9f7c3742fe6a3aac 8611211 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: National Natural Science Foundation of China grantid: 71601183 funderid: 10.13039/501100001809 |
| GroupedDBID | 0R~ 4.4 5VS 6IK 97E AAJGR ABAZT ABVLG ACGFS ADBBV AGSQL ALMA_UNASSIGNED_HOLDINGS BCNDV BEFXN BFFAM BGNUA BKEBE BPEOZ EBS EJD ESBDL GROUPED_DOAJ IPLJI JAVBF KQ8 M43 M~E O9- OCL OK1 RIA RIE RNS 7SC 7SP 7SR 8BQ 8FD JG9 JQ2 L7M L~C L~D RIG |
| ID | FETCH-LOGICAL-d1591-eece28d5ccbfd49bd5f99cb952f762d123212bf8ccf94f94190a0f72024eddb23 |
| IEDL.DBID | RIE |
| IngestDate | Fri Oct 03 12:40:44 EDT 2025 Mon Jun 30 02:37:10 EDT 2025 Wed Aug 27 03:05:11 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-d1591-eece28d5ccbfd49bd5f99cb952f762d123212bf8ccf94f94190a0f72024eddb23 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0003-2670-8042 |
| OpenAccessLink | https://ieeexplore.ieee.org/document/8611211 |
| PQID | 2455631988 |
| PQPubID | 4845423 |
| PageCount | 11 |
| ParticipantIDs | ieee_primary_8611211 proquest_journals_2455631988 doaj_primary_oai_doaj_org_article_fc32a80c4fcf430c9f7c3742fe6a3aac |
| PublicationCentury | 2000 |
| PublicationDate | 20190000 20190101 2019-01-01 |
| PublicationDateYYYYMMDD | 2019-01-01 |
| PublicationDate_xml | – year: 2019 text: 20190000 |
| PublicationDecade | 2010 |
| PublicationPlace | Piscataway |
| PublicationPlace_xml | – name: Piscataway |
| PublicationTitle | IEEE access |
| PublicationTitleAbbrev | Access |
| PublicationYear | 2019 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| SSID | ssj0000816957 |
| Score | 2.1142855 |
| Snippet | There are two kinds of methods for uncertain random multi-objective programming (URMOP) problem now. One is to convert the URMOP problem into deterministic... |
| SourceID | doaj proquest ieee |
| SourceType | Open Website Aggregation Database Publisher |
| StartPage | 12982 |
| SubjectTerms | Criteria Equivalence ideal point method Mathematical programming Pareto optimization Probability distribution Programming Random variables SD-IPM SWS-IPM Transforms Uncertain random multi-objective programming Uncertainty Weighting methods WMM-IPM |
| SummonAdditionalLinks | – databaseName: DOAJ Directory of Open Access Journals dbid: DOA link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1NS8NAEF1EPOhB1CpWq-zBazT7kWT3WEuLgtYiVryF_YSKJtLW_n5nN1EKHrwIOYQcdpOdycyb7OQ9hC6MVxKCo050oVMoUESeKG1YAq5FCOOZJ1Hu7fmuGI_Fy4ucrEl9hZ6whh64WbgrbxhVIjXcG89ZaqQvDIN6zrtcMaVMiL5pIdeKqRiDBcllVrQ0QySVV_3BAJ4o9HLJSygyaB62JiNNf6ur8isYxwwz2kO7LTTE_eaW9tGGqw7QzhphYAf5Ph7XK_eGby0APDypZ9US30cRaAzoE0_BhHGLHz-qytbvOP5fmzzo1yau4UnTjvUOo4XzoCWDo_QRngxxkD2AierqEE1Hw6fBTdIqJSQW4AhJnDOOCpsZo73lUtvMS2m0zKiHYGcDbCJUe2GMlxwOQAEq9QWFBO2s1ZQdoc2qrtwxwppTy7gD1JR5DnBBK1toy1IH2M9A8uqi67Bo5UdDhlEGeup4AYxWtkYr_zJaF3XCkv8MInISqOa6qPdtgrJ9lRYl5YHDjEghTv5j6lO0HXyg-YrSQ5vL-ac7Q1tmtZwt5ufRi74Av7fNIA priority: 102 providerName: Directory of Open Access Journals |
| Title | A Novel Ideal Point Method for Uncertain Random Multi-Objective Programming Problem Under PE Criterion |
| URI | https://ieeexplore.ieee.org/document/8611211 https://www.proquest.com/docview/2455631988 https://doaj.org/article/fc32a80c4fcf430c9f7c3742fe6a3aac |
| Volume | 7 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals databaseCode: DOA dateStart: 20130101 customDbUrl: isFulltext: true eissn: 2169-3536 dateEnd: 99991231 titleUrlDefault: https://www.doaj.org/ omitProxy: false ssIdentifier: ssj0000816957 providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources databaseCode: M~E dateStart: 20130101 customDbUrl: isFulltext: true eissn: 2169-3536 dateEnd: 99991231 titleUrlDefault: https://road.issn.org omitProxy: false ssIdentifier: ssj0000816957 providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT9wwEB4tiAMc-uChLt2ufOBIILGdh4_b1SKQussKFcQtsse2BIKkgoVjfztjJ11VKpdKURRFipOM7fE39vj7AI7Qa0XO0SSmNCkFKFWRaIMioaaVZULmPotybzc_ysWiur1VywEcr_fCOOdi8pk7CZdxLd-2-BKmyk6rIguMZBuwUZZFt1drPZ8SBCRUXvbEQlmqTifTKf1DyN5SJxRW8CIsRkZi_l5J5R_3G8eUs4__9zWf4EOPHdmkq-zPMHDNLuz8xSi4B37CFu2re2AXlhAgW7Z3zYrNo0o0I3jKrqmOYw4Au9KNbR9Z3ICbXJr7zvGxZZev9UilhesgNsOiNhJbzljQRaAXtc0-XJ_Nfk7Pk15KIbGEV7LEOXS8sjmi8VYqY3OvFBqVc0_e0AZclXHjK0SvJB0EE3TqS04juLPWcHEAm03buC_AjORWSEewKveS8ITRtjRWpI7AIdLoNoTvwcb1r44tow781fEGGa_uu0PtUXBdpSg9eilSVL5EQVG6d4UWWuMQ9oLB14X0th7C6E-N1X1fe665DCRnmaqqw_ef-grboRF0Eycj2Fw9vbhvsIWvq7vnp3GMwuk8_z0bxyb1Bkj2yq4 |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3BTtwwEB0BRUIcWlpAbAvUhx4bcGxnEx-XFQjUZbuqAHGL7LEtgSBBsPD9HTvpCqlckHKwIsVJZuzxG3tmHsAPDEaTcbSZLS0nB6UaZsaizGho5blURcgT3dvVpJxOq-trPVuCn4tcGO99Cj7zB7GZzvJdi89xq-ywGuaxItkyfCiUErzL1lrsqEQKCV2UfWmhnOvD0XhMfxHjt_QBORZiGI8jU2n-nkvlPwOcVpWTT-_7ng342KNHNurU_RmWfPMF1l_VFNyEMGLT9sXfsTNHGJDN2ptmzs4TTzQjgMouScspCoD9MY1r71lKwc1-29vO9LFZF7F1T73FdqSbYYkdic2OWWRGoBe1zRZcnhxfjE-znkwhc4RY8sx79KJyBaINTmnriqA1Wl2IQPbQRWSVCxsqxKAVXQQUDA-loDXcO2eF3IaVpm38DjCrhJPKE7AqgiJEYY0rrZPcEzxEWt8GcBRlXD909TLqWME63SDh1f2EqANKYSqOKmBQkqMOJUry04MfGmkMDmAzCnzRSS_rAez-01jdz7anWqhY5izXVfX17ae-w9rpxfmknpxNf32LrjnnXT7hLqzMH5_9Hqziy_zm6XE_Dam_aMPLxA |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Novel+Ideal+Point+Method+for+Uncertain+Random+Multi-Objective+Programming+Problem+Under+PE+Criterion&rft.jtitle=IEEE+access&rft.au=Qi%2C+Yao&rft.au=Wang%2C+Ying&rft.au=Liang%2C+Ying&rft.au=Sun%2C+Yun&rft.date=2019&rft.pub=IEEE&rft.eissn=2169-3536&rft.volume=7&rft.spage=12982&rft.epage=12992&rft_id=info:doi/10.1109%2FACCESS.2019.2892651&rft.externalDocID=8611211 |