Topsis for multiple objective programming with rough decision set

Many optimization problems have competing objectives that require being optimized at the same time. These problems are called ?multiple objective programming problems (MOPPs)?. Real-world MOPPs may have some imprecision (roughness) in the decision set and/or the objective functions. These problems a...

Full description

Saved in:
Bibliographic Details
Published in:Yugoslav Journal of Operations Research Vol. 35; no. 1; pp. 113 - 134
Main Authors: Abou-El-Enien, Tarek, Abo-Elnaga, Y., Mohammad, Kamilia
Format: Journal Article
Language:English
Published: University of Belgrade 2025
Subjects:
multiple objective programming
rough decision set
rough programming
topsis
ISSN:0354-0243, 1820-743X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Many optimization problems have competing objectives that require being optimized at the same time. These problems are called ?multiple objective programming problems (MOPPs)?. Real-world MOPPs may have some imprecision (roughness) in the decision set and/or the objective functions. These problems are known as ?rough MOPPs (RMOPPs)?. There is no unique method able to solve all RMOPPs. Accordingly, the decision maker (DM) should have more than one method for solving RMOPPs at his disposal so that he can select the most appropriate method. To contribute in this regard, we propose a new method for solving a specific class of RMOPPs in which all the objectives are precisely defined, but the decision set is roughly defined by its lower and upper approximations. Our proposed method is a modified version of the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS). TOPSIS was chosen as the foundation for our method because it is one of the most widely applied methods for solving MOPPs. The basic concept underlying TOPSIS is that the compromise solution is closer to the ideal solution while also being farther away from the anti-ideal solution. The conventional TOPSIS can only solve MOPPs with precise (crisp) definitions of the two main parts of the problem. We extend TOPSIS to optimize multiple precise objectives over an imprecise decision set. The proposed approach is depicted in a flowchart. A numerical example is given to demonstrate the effectiveness of our proposed method to solve RMOPPs with a rough decision set at different values of objectives? weights and using different Lp-metrics.
AbstractList Many optimization problems have competing objectives that require being optimized at the same time. These problems are called ”multiple objective programming problems (MOPPs)”. Real-world MOPPs may have some imprecision (roughness) in the decision set and/or the objective functions. These problems are known as ”rough MOPPs (RMOPPs)”. There is no unique method able to solve all RMOPPs. Accordingly, the decision maker (DM) should have more than one method for solving RMOPPs at his disposal so that he can select the most appropriate method. To contribute in this regard, we propose a new method for solving a specific class of RMOPPs in which all the objectives are precisely defined, but the decision set is roughly defined by its lower and upper approximations. Our proposed method is a modified version of the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS). TOPSIS was chosen as the foundation for our method because it is one of the most widely applied methods for solving MOPPs. The basic concept underlying TOPSIS is that the compromise solution is closer to the ideal solution while also being farther away from the anti-ideal solution. The conventional TOPSIS can only solve MOPPs with precise (crisp) definitions of the two main parts of the problem. We extend TOPSIS to optimize multiple precise objectives over an imprecise decision set. The proposed approach is depicted in a flowchart. A numerical example is given to demonstrate the effectiveness of our proposed method to solve RMOPPs with a rough decision set at different values of objectives’ weights and using different Lp-metrics.
Author Abou-El-Enien, Tarek
Mohammad, Kamilia
Abo-Elnaga, Y.
Author_xml – sequence: 1
  givenname: Tarek
  orcidid: 0000-0001-5345-8873
  surname: Abou-El-Enien
  fullname: Abou-El-Enien, Tarek
  organization: Department of O.R. & D.S., Faculty of Computers and Artificial Intelligence, Cairo University, Giza, Egypt
– sequence: 2
  givenname: Y.
  orcidid: 0000-0002-2741-9691
  surname: Abo-Elnaga
  fullname: Abo-Elnaga, Y.
  organization: Department of Basic Science, Higher Technological Institute, Tenth of Ramadan City, Egypt
– sequence: 3
  givenname: Kamilia
  orcidid: 0009-0006-1326-4509
  surname: Mohammad
  fullname: Mohammad, Kamilia
  organization: Department of Physics and Engineering Mathematics, Faculty of Engineering, Tanta University, Tanta, Egypt
BookMark eNpV0MtKAzEAheEgFay1W9d5gam5zSRZluKlUihIBV0NuU5TZiZDMlV8ey8VwdWBs_gW_yWY9LF3AFxjtCBEipvXx-0ToajCDCG6PANTLAgqOKMvEzBFtGQFIoxegHnOQSPMqRCkFFOw3MUhhwx9TLA7tmMYWgejPjgzhjcHhxSbpLou9A18D-Mepnhs9tA6E3KIPcxuvALnXrXZzX93Bp7vbnerh2KzvV-vlpvCEMxV4ZlEQjHpmRKGaKdLbEtrnedWOEdtpYmqpBVIGc6wr5Dm3guiZYWlVFbRGVifXBvVoR5S6FT6qKMK9c8RU1OrNAbTuloSU5WV81a5krGKCSy4MV7z0pRMefplLU6WSTHn5Pyfh1H93bP-35N-AkNOa6k
Cites_doi 10.1007/978-3-540-39592-8_21
10.1007/s10462-022-10177-6
10.1007/s40314-023-02400-z
10.1007/s40314-022-01830-5
10.1016/j.ejor.2004.05.019
10.1016/j.ins.2022.06.018
10.1016/j.ejor.2015.06.079
10.1287/mnsc.17.4.B141
10.1007/978-94-015-7975-9_18
10.1016/S0165-0114(97)00077-8
10.1109/GRC.2005.1547239
10.1002/1098-111X(200101)16:1<87::AID-INT7>3.0.CO;2-S
10.1080/02331930903536393
10.24425/bpasts.2022.140555
10.1007/BF01001956
10.22587/ajbas.2018.12.7.18
10.1080/23311916.2018.1502242
10.1007/978-3-642-48318-9
10.1007/978-3-642-45511-7_3
10.1007/978-1-4471-3238-7_31
10.1016/j.ijar.2021.11.012
10.1109/FUZZY.1998.687467
10.1016/0377-2217(94)90282-8
10.1007/978-3-540-27794-1_11
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.2298/YJOR230614003A
DatabaseName CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList
CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
EISSN 1820-743X
EndPage 134
ExternalDocumentID oai_doaj_org_article_92c656efdae544648187ccfb75c54af3
10_2298_YJOR230614003A
GroupedDBID AAYXX
ABJBX
CITATION
GROUPED_DOAJ
ID FETCH-LOGICAL-c217a-f4908a49f4a8c2beb51d5ddef7d8ee3d6b2a69d80ac741f60b7ff82b96199ada3
IEDL.DBID DOA
ISSN 0354-0243
IngestDate Fri Oct 03 12:43:56 EDT 2025
Sat Nov 29 08:13:40 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
License http://creativecommons.org/licenses/by-nc-sa/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c217a-f4908a49f4a8c2beb51d5ddef7d8ee3d6b2a69d80ac741f60b7ff82b96199ada3
ORCID 0000-0001-5345-8873
0009-0006-1326-4509
0000-0002-2741-9691
OpenAccessLink https://doaj.org/article/92c656efdae544648187ccfb75c54af3
PageCount 22
ParticipantIDs doaj_primary_oai_doaj_org_article_92c656efdae544648187ccfb75c54af3
crossref_primary_10_2298_YJOR230614003A
PublicationCentury 2000
PublicationDate 2025-00-00
2025-01-01
PublicationDateYYYYMMDD 2025-01-01
PublicationDate_xml – year: 2025
  text: 2025-00-00
PublicationDecade 2020
PublicationTitle Yugoslav Journal of Operations Research
PublicationYear 2025
Publisher University of Belgrade
Publisher_xml – name: University of Belgrade
References ref13
ref12
ref15
ref14
ref11
ref10
ref2
ref1
ref17
ref16
ref19
ref18
ref24
ref23
ref26
ref25
ref20
ref22
ref21
ref27
ref8
ref7
ref9
ref4
ref3
ref6
ref5
References_xml – ident: ref26
  doi: 10.1007/978-3-540-39592-8_21
– ident: ref24
  doi: 10.1007/s10462-022-10177-6
– ident: ref3
– ident: ref11
  doi: 10.1007/s40314-023-02400-z
– ident: ref10
  doi: 10.1007/s40314-022-01830-5
– ident: ref7
  doi: 10.1016/j.ejor.2004.05.019
– ident: ref16
  doi: 10.1016/j.ins.2022.06.018
– ident: ref4
  doi: 10.1016/j.ejor.2015.06.079
– ident: ref17
  doi: 10.1287/mnsc.17.4.B141
– ident: ref20
  doi: 10.1007/978-94-015-7975-9_18
– ident: ref27
– ident: ref5
  doi: 10.1016/S0165-0114(97)00077-8
– ident: ref25
  doi: 10.1109/GRC.2005.1547239
– ident: ref22
  doi: 10.1002/1098-111X(200101)16:1<87::AID-INT7>3.0.CO;2-S
– ident: ref8
  doi: 10.1080/02331930903536393
– ident: ref13
  doi: 10.24425/bpasts.2022.140555
– ident: ref6
  doi: 10.1007/BF01001956
– ident: ref9
  doi: 10.22587/ajbas.2018.12.7.18
– ident: ref12
  doi: 10.1080/23311916.2018.1502242
– ident: ref14
  doi: 10.1007/978-3-642-48318-9
– ident: ref1
  doi: 10.1007/978-3-642-45511-7_3
– ident: ref23
– ident: ref21
  doi: 10.1007/978-1-4471-3238-7_31
– ident: ref18
  doi: 10.1016/j.ijar.2021.11.012
– ident: ref2
  doi: 10.1109/FUZZY.1998.687467
– ident: ref15
  doi: 10.1016/0377-2217(94)90282-8
– ident: ref19
  doi: 10.1007/978-3-540-27794-1_11
SSID ssib017388258
ssib048656891
ssib044765231
Score 2.3105164
Snippet Many optimization problems have competing objectives that require being optimized at the same time. These problems are called ?multiple objective programming...
Many optimization problems have competing objectives that require being optimized at the same time. These problems are called ”multiple objective programming...
SourceID doaj
crossref
SourceType Open Website
Index Database
StartPage 113
SubjectTerms multiple objective programming
rough decision set
rough programming
topsis
Title Topsis for multiple objective programming with rough decision set
URI https://doaj.org/article/92c656efdae544648187ccfb75c54af3
Volume 35
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1820-743X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044765231
  issn: 0354-0243
  databaseCode: M~E
  dateStart: 0
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3PS8MwFA4yPHgRRcX5ixwET2FdmzTJccpEBKfIhHkqyUsCE9zGOj36t_vSdtqdvHgptJTQvhfyvi95fB8hl0JCrEqBSesN4xw0M-AEc6oPGeQI0C1UZhNyNFKTiX5qWX3FnrBaHrgOXE-ngJDDB2e8QOrCscBIgGClAMFNqHQ-E6lbZApnUl9miBx_z_s4l7lonXdxhWM2dnqZ4CzK8tWKjmmqVe_1_vE5QnMkH0k22KhYLWH_qgLd7pHdBjrSQf3J-2TLzw7IYDxflNOSIvak6-ZAOrdv9TpGm_ardyxQNG650sqVh7rGWYeWfnVIXm6H45s71tgiMED-YFiIZ3WG68CNgtR6K_pO4CoVpFPeZy63qcm1U4kBhAshT6wMQaVWI1fSxpnsiHRm85k_JtQZvJc59xo4d2AsaOvSfggyVEyoS67Wv14savWLAllDDFKxGaQuuY6R-XkrqlZXDzCXRZPL4q9cnvzHIKdkJ40evdU2yRnprJYf_pxsw-dqWi4vqmmC14ev4Tdvs8ER
linkProvider Directory of Open Access Journals
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=Topsis+for+multiple+objective+programming+with+rough+decision+set&rft.jtitle=Yugoslav+Journal+of+Operations+Research&rft.au=Abou-El-Enien%2C+Tarek&rft.au=Abo-Elnaga%2C+Y.&rft.au=Mohammad%2C+Kamilia&rft.date=2025&rft.issn=0354-0243&rft.eissn=1820-743X&rft.volume=35&rft.issue=1&rft.spage=113&rft.epage=134&rft_id=info:doi/10.2298%2FYJOR230614003A&rft.externalDBID=n%2Fa&rft.externalDocID=10_2298_YJOR230614003A
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0354-0243&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0354-0243&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0354-0243&client=summon