umu.sePublications
Change search
Link to record
Permanent link

Direct link
BETA
Hosseini, Ahmad
Alternative names
Publications (3 of 3) Show all publications
Hosseini, A. & Wadbro, E. (2016). A feasibility evaluation approach for time-evolving multi-item production-distribution networks. Paper presented at Conference: International Conference on Computational and Experimental Science and Engineering (ICCESEN)Location: TURKEYDate: OCT 25-29, 2014. Optimization Methods and Software, 31(3), 562-576
Open this publication in new window or tab >>A feasibility evaluation approach for time-evolving multi-item production-distribution networks
2016 (English)In: Optimization Methods and Software, ISSN 1055-6788, E-ISSN 1029-4937, Vol. 31, no 3, p. 562-576Article in journal (Refereed) Published
Abstract [en]

Time-dependent multi-item problems arise frequently in management applications, communication systems, and production–distribution systems. Our problem belongs to the last category, where we wish to address the feasibility of such systems when all network parameters change over time and product. The objective is to determine whether it is possible to have a dynamic production–shipment circuit within a finite planning horizon. And, if there is no such a flow, the goal is to determine where and when the infeasibility occurs and the approximate magnitude of the infeasibility. This information may help the decision maker in their efforts to resolve the infeasibility of the system. The problem in the discrete-time settings is investigated and a hybrid of scaling approach and penalty function method together with network optimality condition is utilized to develop a network-based algorithm. This algorithm is analysed from theoretical and practical perspectives by means of instances corresponding to some electricity transmission-distribution networks and many random instances. Computational results illustrate the performance of the algorithm.

Place, publisher, year, edition, pages
Taylor & Francis, 2016
Keywords
mathematical programming, nonlinear optimization, network programming, approximation algorithm
National Category
Mathematics Computer and Information Sciences Communication Systems
Research subject
marketing
Identifiers
urn:nbn:se:umu:diva-115933 (URN)10.1080/10556788.2015.1121484 (DOI)000374781100008 ()
Conference
Conference: International Conference on Computational and Experimental Science and Engineering (ICCESEN)Location: TURKEYDate: OCT 25-29, 2014
Available from: 2016-02-08 Created: 2016-02-08 Last updated: 2018-06-07Bibliographically approved
Hosseini, A. & Wadbro, E. (2016). Connectivity reliability in uncertain networks with stability analysis. Expert systems with applications, 57, 337-344
Open this publication in new window or tab >>Connectivity reliability in uncertain networks with stability analysis
2016 (English)In: Expert systems with applications, ISSN 0957-4174, E-ISSN 1873-6793, Vol. 57, p. 337-344Article in journal (Refereed) Published
Abstract [en]

This paper treats the fundamental problems of reliability and stability analysis in uncertain networks. Here, we consider a collapsed, post-disaster, traffic network that is composed of nodes (centers) and arcs (links), where the uncertain operationality or reliability of links is evaluated by domain experts. To ensure the arrival of relief materials and rescue vehicles to the disaster areas in time, uncertainty theory, which neither requires any probability distribution nor fuzzy membership function, is employed to originally propose the problem of choosing the most reliable path (MRP). We then introduce the new problems of α-most reliable path (α-MRP), which aims to minimize the pessimistic risk value of a path under a given confidence level α, and very most reliable path (VMRP), where the objective is to maximize the confidence level of a path under a given threshold of pessimistic risk. Then, exploiting these concepts, we give the uncertainty distribution of the MRP in an uncertain traffic network. The objective of bothα-MRP and VMRP is to determine a path that comprises the least risky route for transportation from a designated source node to a designated sink node, but with different decision criteria. Furthermore, a methodology is proposed to tackle the stability analysis issue in the framework of uncertainty programming; specifically, we show how to compute the arcs’ tolerances. Finally, we provide illustrative examples that show how our approaches work in realistic situation.

Keywords
Traffic network, Uncertainty theory, Reliability, Chance-constrained, Stability analysis
National Category
Information Systems Probability Theory and Statistics
Research subject
Mathematics
Identifiers
urn:nbn:se:umu:diva-120209 (URN)10.1016/j.eswa.2016.03.040 (DOI)000376052200025 ()
Available from: 2016-05-11 Created: 2016-05-11 Last updated: 2018-06-07Bibliographically approved
Hosseini, S. A. (2015). Time-dependent optimization of a multi-item uncertain supply chain network: a hybrid approximation algorithm. Discrete Optimization, 18, 150-167
Open this publication in new window or tab >>Time-dependent optimization of a multi-item uncertain supply chain network: a hybrid approximation algorithm
2015 (English)In: Discrete Optimization, ISSN 1572-5286, E-ISSN 1873-636X, Vol. 18, p. 150-167Article 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
Keywords
Supply chain management, Mathematical programming, Distribution, Approximation, Uncertainty
National Category
Engineering and Technology Mathematics Computer and Information Sciences
Identifiers
urn:nbn:se:umu:diva-115932 (URN)10.1016/j.disopt.2015.09.002 (DOI)000367484200008 ()
Available from: 2016-02-08 Created: 2016-02-08 Last updated: 2018-06-07Bibliographically approved
Organisations

Search in DiVA

Show all publications