Multi-objective multi-item fixed-charge solid transportation problem under twofold uncertainty

Date

2019-12-01

Author

Roy, Sankar Kumar
Midya, Sudipta
Weber, Gerhard Wilhelm

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

244
views

0
downloads

In this paper, we investigate a multi-objective multi-item fixed-charge solid transportation problem (MOMIFCSTP) with fuzzy-rough variables as coefficients of the objective functions and of the constraints. The main focus of the paper is to analyze MOMIFCSTP under a fuzzy-rough environment for a transporting system. In practical situations, the parameters of a MOMIFCSTP are imprecise in nature, due to several uncontrollable factors. For these reasons, we introduce the fuzzy-rough variables in MOMIFCSTP to tackle vague data which are different from fuzziness and roughness. Fuzzy-rough expected-value operator is employed to convert fuzzy-rough MOMIFCSTP into deterministic MOMIFCSTP. Thereafter, we develop a methodology to solve the deterministic MOMIFCSTP by technique for order preference by similarity to ideal solution (TOPSIS). Three distinct approaches, namely extended TOPSIS, weighted goal programming (WGP) and fuzzy programming, are used to derive Pareto-optimal solution from the suggested model. A comparison is drawn among the optimal solutions which are derived from different approaches. It is observed from the extracted results that TOPSIS provides a better optimal solution than WGP and fuzzy programming. TOPSIS also overcomes some difficulties which arise in WGP. Finally, a real-world (industrial) problem is incorporated to show the applicability and feasibility of the proposed problem.

Subject Keywords

Software, Artificial Intelligence

URI

https://hdl.handle.net/11511/51313

Journal

NEURAL COMPUTING & APPLICATIONS

DOI

https://doi.org/10.1007/s00521-019-04431-2

Collections

Graduate School of Applied Mathematics, Article

Suggestions

OpenMETU
Core

Improving reinforcement learning by using sequence trees Girgin, Sertan; Polat, Faruk; Alhajj, Reda (Springer Science and Business Media LLC, 2010-12-01) This paper proposes a novel approach to discover options in the form of stochastic conditionally terminating sequences; it shows how such sequences can be integrated into the reinforcement learning framework to improve the learning performance. The method utilizes stored histories of possible optimal policies and constructs a specialized tree structure during the learning process. The constructed tree facilitates the process of identifying frequently used action sequences together with states that are visit...
LinGraph: a graph-based automated planner for concurrent task planning based on linear logic Kortik, Sitar; Saranlı, Uluç (Springer Science and Business Media LLC, 2017-10-01) In this paper, we introduce an automated planner for deterministic, concurrent domains, formulated as a graph-based theorem prover for a propositional fragment of intuitionistic linear logic, relying on the previously established connection between intuitionistic linear logic and planning problems. The new graph-based theorem prover we introduce improves planning performance by reducing proof permutations that are irrelevant to planning problems particularly in the presence of large numbers of objects and a...
Nuclear Fission-Nuclear Fusion algorithm for global optimization: a modified Big Bang-Big Crunch algorithm YALÇIN, YAĞIZER; Pekcan, Onur (Springer Science and Business Media LLC, 2020-04-01) This study introduces a derivative of the well-known optimization algorithm, Big Bang-Big Crunch (BB-BC), named Nuclear Fission-Nuclear Fusion-based BB-BC, simply referred to as N2F. Broadly preferred in the engineering optimization community, BB-BC provides accurate solutions with reasonably fast convergence rates for many engineering problems. Regardless, the algorithm often suffers from stagnation issues. More specifically, for some problems, BB-BC either converges prematurely or exploits the promising r...
Stable controller design for T-S fuzzy systems based on Lie algebras Banks, SP; Gurkan, E; Erkmen, İsmet (Elsevier BV, 2005-12-01) In this paper, we study the stability of fuzzy control systems of Takagi-Sugeno-(T-S) type based on the classical theory of Lie algebras. T-S fuzzy systems are used to model nonlinear systems as a set of rules with consequents of the type x(t) = A(l)x (t) + B(l)u (t). We conduct the stability analysis of such T-S fuzzy models using the Lie algebra LA generated by the A(l) matrices of these subsystems for each rule in the rule base. We first develop our approach of stability analysis for a commuting algebra ...
Verification and transformation of complex and uncertain conceptual schemas Yazıcı, Adnan (World Scientific Pub Co Pte Lt, 1997-12-01) In database environment it is necessary to represent complex and uncertain information at conceptual level and then transform the conceptual schema into the logical one for ultimate implementation. It is also important to verify the conceptual schema with respect to the constraints imposed on the schema definition. In this paper we primarily focus on the verification and transformation of the conceptual schema For the purpose of verification of the conceptual schema represented by the ExIFO data model (the ...

Citation Formats

S. K. Roy, S. Midya, and G. W. Weber, “Multi-objective multi-item fixed-charge solid transportation problem under twofold uncertainty,” NEURAL COMPUTING & APPLICATIONS, pp. 8593–8613, 2019, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/51313.