Yayın:
Uncertain programming model for multi-item solid transportation problem

dc.contributor.authorDalman, Hasan
dc.date.accessioned2026-06-27T14:10:07Z
dc.date.issued2018
dc.description.abstractIn this paper, an uncertain Multi-objective Multi-item Solid Transportation Problem (MMSTP) based on uncertainty theory is presented. In the model, transportation costs, supplies, demands and conveyances parameters are taken to be uncertain parameters. There are restrictions on some items and conveyances of the model. Therefore, some particular items cannot be transported by some exceptional conveyances. Using the advantage of uncertainty theory, the MMSTP is first converted into an equivalent deterministic MMSTP. By applying convex combination method and minimizing distance function method, the deterministic MMSTP is reduced into single objective programming problems. Thus, both single objective programming problems are solved using Maple 18.02 optimization toolbox. Finally, a numerical example is given to illustrate the performance of the models.en
dc.description.urihttps://doi.org/10.1007/s13042-016-0538-7
dc.identifier.doi10.1007/s13042-016-0538-7
dc.identifier.eissn1868-808X
dc.identifier.endpage567
dc.identifier.issn1868-8071
dc.identifier.issue4
dc.identifier.startpage559
dc.identifier.urihttps://hdl.handle.net/20.500.14981/57474
dc.identifier.volume9
dc.identifier.wos000427433600001
dc.language.isoeng
dc.publisherSPRINGER HEIDELBERG
dc.relation.ispartofINTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS
dc.rightsopenAccess
dc.subjectMulti-objective programming
dc.subjectSolid transportation problem
dc.subjectMulti-item transportation problem
dc.subjectUncertain programming
dc.subjectUncertainty theory
dc.subjectComputer Science
dc.titleUncertain programming model for multi-item solid transportation problem
dc.typeArticle
dspace.entity.typePublication
local.import.sourceWOS

Dosyalar

Koleksiyonlar