Selective maintenance problem plays an essential role in reliability optimization decision-making problems. Systems are a configuration of several components, and there are situations the system needs small intervals or break for maintenance actions, during the intervals expert carried out the maintenance actions to replace or repair the deteriorated components of the systems. Because of the uncertainty associated with the component’s operational time, failure, and next mission duration create a new challenge in determining optimal components allocation and evaluating future missions successfully. In this paper, a multi-objective selective maintenance allocation problem is formulated with fuzzy parameters under neutrosophic environment. A new defuzzification technique is introduced based on beta distribution to convert fuzzy parameters into crisp values. The neutrosophic goal programming technique is used to determine the compromise allocation of replaceable and repairable components based on the system reliability optimization. A numerical illustration is used to validate the model and ascertain its effectiveness. The result is compared with two other approaches and found to be better. The method is flexible and straightforward and can be solved using any available commercial packages. The extension of the concept can be useful to other complex system reliability optimization.

A new model for the weighted method of goal programming is proposed based on minimizing the distances between ideal objectives to feasible objective space. It provides the best compromised solution for Multi Objective Linear Programming Problems (MOLPP). The proposed model tackles MOLPP by solving a series of single objective subproblems, where the objectives are transformed into constraints. The compromise solution so obtained may be improved by defining priorities in terms of the weight. A criterion is also proposed for deciding the best compromise solution. Applications of the algorithm are discussed for transportation and assignment problems involving multiple and conflicting objectives. Numerical illustrations are given for the proposed model.

No abstract

This paper deals with the modeling and optimization of a bi-level multi-objective production planning problem, where some of the coefficients of objective functions and parameters of constraints are multi-choice. A general transformation technique based on a binary variable has been used to transform the multi-choices parameters of the problem into their equivalent deterministic form. Finally, two different types of secularization technique have been used to achieve the maximum degree of individually membership goals by minimizing their deviational variables and obtained the most satisfactory solution of the formulated problem. An illustrative real case study of production planning has been discussed and, also compared to validate the efficiency and usefulness of the proposed work.

The problem of transportation in real-life is an uncertain multi-objective decision-making problem. In particular, by taking into account the conflicting objectives, Decision-Makers (DMs) are looking for the best transport set up to determine the optimum shipping quantity subject to certain capacity constraints on each route. This paper presented a Multi-Objective Transportation Problem (MOTP) where the objective functions are considered as Type-2 trapezoidal fuzzy numbers (T2TpFN), respectively. Demand and supply in constraints are in multi-choice and probabilistic random variables, respectively. Also considered the “rate of increment in Transportation Cost (TC) and rate of decrement in profit on transporting the products from ith sources to jth destinations due to” (or additional cost) of each product due to the damage, late deliveries, weather conditions, and any other issues. Due to the presence of all these uncertainties, it is not possible to obtain the optimum solution directly, so first, we need to convert all these uncertainties from the model into a crisp equivalent form. The two-phase defuzzification technique is used to transform T2TpFN into a crisp equivalent form. Multi-choice and probabilistic random variables are transformed into an equivalent value using Stochastic Programming (SP) approach and the binary variable, respectively. It is assumed that the supply and demand parameter follows various types of probabilistic distributions like Weibull, Extreme value, Cauchy and Pareto, Normal distribution, respectively. The unknown parameters of probabilistic distributions estimated using the maximum likelihood estimation method at the defined probability level. The best fit of the probability distributions is determined using the Akaike Information Criterion (AIC) and the Bayesian Information Criterion (BIC), respectively. Using the Fuzzy Goal Programming (FGP) method, the final problem is solved for the optimal decision. A case study is intended to provide the effectiveness of the proposed work.