Change search
ReferencesLink to record
Permanent link

Direct link
Time-dependent optimization of a multi-item uncertain supply chain network: a hybrid approximation algorithm
Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.
2015 (English)In: Discrete Optimization, ISSN 1572-5286, E-ISSN 1873-636X, Vol. 18, 150-167 p.Article in journal (Refereed) Published
Abstract [en]

We consider the uncertain least cost shipping problem. The input is a multi-item supply chain network with time-evolving uncertain costs and capacities. Exploiting the operational law of uncertainty theory, a mathematical model of the problem is established and the indeterminacy factors are tackled. We use the scaling idea together with transformation approach and uncertainty programming to develop a hybrid algorithm to optimize and obtain the uncertainty distribution of the total shipping cost. We analyze the practical performance of the algorithm and present an illustrative example.

Place, publisher, year, edition, pages
Elsevier, 2015. Vol. 18, 150-167 p.
Keyword [en]
Supply chain management, Mathematical programming, Distribution, Approximation, Uncertainty
National Category
Engineering and Technology Mathematics Computer and Information Science
URN: urn:nbn:se:umu:diva-115932DOI: 10.1016/j.disopt.2015.09.002ISI: 000367484200008OAI: diva2:901352
Available from: 2016-02-08 Created: 2016-02-08 Last updated: 2016-02-12Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Hosseini, S. Ahmad
By organisation
Department of Mathematics and Mathematical Statistics
In the same journal
Discrete Optimization
Engineering and TechnologyMathematicsComputer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 45 hits
ReferencesLink to record
Permanent link

Direct link