Zobrazit minimální záznam

dc.contributor.authorZapletal, František
dc.contributor.authorTrumic, Rijad
dc.contributor.authorLenort, Radim
dc.date.accessioned2023-02-28T07:46:36Z
dc.date.available2023-02-28T07:46:36Z
dc.date.issued2022
dc.identifier.citationActa Logistica. 2022, vol. 9, issue 3, p. 291-301.cs
dc.identifier.issn1339-5629
dc.identifier.urihttp://hdl.handle.net/10084/149157
dc.description.abstractThis paper focuses on the problem of supplier portfolio selection where a company has to choose the best possible set of suppliers with respect to various constraints. An intuitive heuristic can suggest to use any of the methods for suppliers ranking and then to put the first one into the portfolio. If some required constraint is not met, then the second supplier according to the ranking is added, and so on, until all the constraints are satisfied. However, such approach can result in a non-optimal decision. The constraints can cause that a combination of the alternatives with lower rankings can be better, than some higher-ranked alternative from the perspective of feasibility. To build the optimization model, the authors of this paper use the PROMETHEE V method: a popular combination of multi-criteria decision making method PROMETHEE and mixed integer programming. However, it is shown that the original PROMETHEE V method, namely the logic under which an objective function is set, is not suitable here and leads to discrimination of suppliers with worse ranking. Therefore, a modification, which brings more reasonable results, is proposed in this paper. A numerical example is used to show the suitability of the proposed approach and compare the results with the original algorithm and also with one prior modification introduced by by other authors in the past. The analysis is further supported by a thorough sensitivity analysis using flexible and parametric programming.cs
dc.language.isoencs
dc.publisher4S go, s.r.o.cs
dc.relation.ispartofseriesActa Logisticacs
dc.relation.urihttps://doi.org/10.22306/al.v9i3.310cs
dc.rightsCopyright © Acta Logisticacs
dc.rights.urihttp://creativecommons.org/licenses/by-nc/4.0/cs
dc.subjectPROMETHEE Vcs
dc.subjectmixed integer programmingcs
dc.subjectsupplier portfoliocs
dc.subjectflexible constraintcs
dc.titleModified PROMETHEE V method for supplier portfolio selectioncs
dc.typearticlecs
dc.identifier.doi10.22306/al.v9i3.310
dc.rights.accessopenAccesscs
dc.type.versionpublishedVersioncs
dc.type.statusPeer-reviewedcs
dc.description.sourceWeb of Sciencecs
dc.description.volume9cs
dc.description.issue3cs
dc.description.lastpage301cs
dc.description.firstpage291cs
dc.identifier.wos000910882700005


Soubory tohoto záznamu

Tento záznam se objevuje v následujících kolekcích

Zobrazit minimální záznam

Copyright © Acta Logistica
Kromě případů, kde je uvedeno jinak, licence tohoto záznamu je Copyright © Acta Logistica