A bi-objective model to optimize reliability and cost of system with a choice of redundancy strategies

Chambari, Amirhossain; Rahmati, Seyed Habib A.; Najafi, Amir Abbas; Aida, Kô

doi:10.1016/j.cie.2012.02.004

Cited by 113 publications

(61 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They proposed non-dominated sorting genetic algorithms (NSGA-II) and multi-objective particle swarm optimization (MOPSO) to solve the problem. The proposed problem of this paper is similar with the model originally developed by Chambari et al (2012), except that we use different techniques to compare the results.…”

Section: Literature Reviewmentioning

confidence: 86%

“…As stated in the introduction section, there are two objective functions similar to Chambari et al (2012) where the first one is associated with reliability and the second one is related to the cost. There are also two types of constrains including weight and volume.…”

Section: The Proposed Model and Its Assumptions Principlesmentioning

confidence: 99%

“…Chambari et al (2012) studied a specific type of redundancy allocation problem (RAP) and developed a bi-objective RAP (BORAP). The model includes non-repairable series-parallel systems in which the redundancy strategy was taken into account as a decision variable for individual subsystems.…”

Section: Literature Reviewmentioning

confidence: 99%

See 2 more Smart Citations

Efficient optimization of multi-objective redundancy allocation problems in series-parallel systems

Arjestan¹

2017

10.5267/j.dsl

View full text Add to dashboard Cite

Section: Literature Reviewmentioning

confidence: 86%

Section: The Proposed Model and Its Assumptions Principlesmentioning

confidence: 99%

See 1 more Smart Citation

Efficient optimization of multi-objective redundancy allocation problems in series-parallel systems

Arjestan¹

2017

10.5267/j.dsl

View full text Add to dashboard Cite

“…In the cases where the number of agents and their levels is high, Taguchi method is more e cient than complete factorial method. For orthogonal array, L27 equaling 27 is much less than the number required for complete factorial method [33,29]. In order to tune the parameters, the Mean Ideal Distance (MID) is selected as the main response in Taguchi analysis.…”

Section: Parameter Tuningmentioning

confidence: 99%

Optimizing Reliability and Cost of system for Aggregate Production Planning in Supply Chain

2017

View full text Add to dashboard Cite

Abstract. In this paper, the researchers present a multi-objective model for multiproduct, multi-site aggregate production planning model in a supply chain. The goals are to minimize the total cost of the supply chain, including inventory costs, manufacturing costs, work force costs, hiring and ring costs, and also to maximize the minimum of suppliers' reliability by considering probabilistic lead times to simultaneously improve the system performance. Since the problem is NP-Hard, a Pareto-based multi-objective harmony search algorithm is proposed. To demonstrate the performance of the presented algorithm, a Non-dominated Sorting Genetic Algorithm (NSGA-II) and a Non-dominated Ranking Genetic Algorithm (NRGA) are applied. The results demonstrate the robustness of the proposed algorithm to probe the Pareto solutions.

show abstract

“…Chambari et al [11] solved an M/M/1/k queue model by using both NSGA-II and nondominated ranking genetic algorithms (NRGA). Chambari et al [12] implemented NSGA-II to optimize cost and reliability of the whole system in a redundancy allocation problem. Mehdizadeh and Tavakkoli-Moghaddam [32] proposed a new meta-heuristic optimization algorithm, namely vibration damping optimization (VDO) to solve the parallel machine scheduling problem; VDO is based on the concept of vibration damping in mechanical vibration.…”

Section: Introductionmentioning

confidence: 99%

Bi-objective vibration damping optimization for congested location–pricing problem

Hajipour

Farahani

2016

Computers & Operations Research

View full text Add to dashboard Cite

This paper presents a bi-objective mathematical programming model for the restricted facility location problem, under a congestion and pricing policy. Motivated by various applications such as locating server on internet mirror sites and communication networks, this research investigates congested systems with immobile servers and stochastic demand as M/M/m/k queues. For this problem, we consider two simultaneous perspectives; (1) customers who desire to limit waiting time for service and (2) service providers who intend to increase profits. We formulate a bi-objective facility location problem with two objective functions: (i) maximizing total profit of the whole system and (ii) minimizing the sum of waiting time in queues; the model type is mixed-integer nonlinear. Then, a multi-objective optimization algorithm based on vibration theory (so-called multi-objective vibration damping optimization (MOVDO)), is developed to solve the model. Moreover, the Taguchi method is also implemented, using a response metric to tune the parameters.The results are analyzed and compared with a non-dominated sorting genetic algorithm (NSGA-II) as a well-developed multi-objective evolutionary optimization algorithm. Computational results demonstrate the efficiency of the proposed MOVDO to solve large-scale problems.

show abstract

A bi-objective model to optimize reliability and cost of system with a choice of redundancy strategies

Cited by 113 publications

References 30 publications

Efficient optimization of multi-objective redundancy allocation problems in series-parallel systems

Efficient optimization of multi-objective redundancy allocation problems in series-parallel systems

Optimizing Reliability and Cost of system for Aggregate Production Planning in Supply Chain

Bi-objective vibration damping optimization for congested location–pricing problem

Contact Info

Product

Resources

About