Advanced Search

Show simple item record

dc.contributor.authorDalman, Hasan
dc.date.accessioned2023-11-29T14:40:06Z
dc.date.available2023-11-29T14:40:06Z
dc.date.issued2019en_US
dc.identifier.issn1432-7643
dc.identifier.issn1433-7479
dc.identifier.urihttps://hdl.handle.net/11363/6569
dc.description.abstractThis paper focuses on modeling and optimization of entropy-based uncertain multi-item solid transportation problems (MISTPs), in which direct costs, supplies, demands, conveyance capacities are uncertain nature. The purpose is to minimize the total uncertain cost via maximum entropy which ensures uniform delivery of products from sources to destinations through conveyances. The expected value programming and expected constrained programming models for optimizing the entropy-based uncertain MISTPs are constructed. These models are based on uncertainty theory. Subsequently, the constructed models are converted into their deterministic equivalences which are solved using two known mathematical programming methods. Finally, a numerical example is given to illustrate the models.en_US
dc.language.isoengen_US
dc.publisherSPRINGER, ONE NEW YORK PLAZA, SUITE 4600 , NEW YORK, NY 10004, UNITED STATESen_US
dc.relation.isversionof10.1007/s00500-018-3255-1en_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectUncertain entropy functionen_US
dc.subjectMulti-item transportation problemen_US
dc.subjectUncertain multi-objective optimizationen_US
dc.subjectUncertainty theoryen_US
dc.titleEntropy-based multi-item solid transportation problems with uncertain variablesen_US
dc.typearticleen_US
dc.relation.ispartofSoft Computingen_US
dc.departmentMühendislik ve Mimarlık Fakültesien_US
dc.authoridhttps://orcid.org/0000-0001-8925-3941en_US
dc.identifier.volume23en_US
dc.identifier.issue14en_US
dc.identifier.startpage5931en_US
dc.identifier.endpage5943en_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.contributor.institutionauthorDalman, Hasan


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record