Showing 5 results for Meta-Heuristic Algorithm
R. Ramezanian, M.b. Aryanezhad , M. Heydari,
Volume 21, Issue 2 (5-2010)
Abstract
In this paper, we consider a flow shop scheduling problem with bypass consideration for minimizing the sum of earliness and tardiness costs. We propose a new mathematical modeling to formulate this problem. There are several constraints which are involved in our modeling such as the due date of jobs, the job ready times, the earliness and the tardiness cost of jobs, and so on. We apply adapted genetic algorithm based on bypass consideration to solve the problem. The basic parameters of this meta-heuristic are briefly discussed in this paper. Also a computational experiment is conducted to evaluate the performance of the implemented methods. The implemented algorithm can be used to solve large scale flow shop scheduling problem with bypass effectively .
Amir-Mohammad Golmohammadi, Mahboobeh Honarvar, Hasan Hosseini-Nasab, Reza Tavakkoli-Moghaddam,
Volume 29, Issue 2 (6-2018)
Abstract
The fundamental function of a cellular manufacturing system (CMS) is based on definition and recognition of a type of similarity among parts that should be produced in a planning period. Cell formation (CF) and cell layout design are two important steps in implementation of the CMS. This paper represents a new nonlinear mathematical programming model for dynamic cell formation that employs the rectilinear distance notion to determine the layout in the continuous space. In the proposed model, machines are considered unreliable with a stochastic time between failures. The objective function calculates the costs of inter and intra-cell movements of parts and the cost due to the existence of exceptional elements (EEs), cell reconfigurations and machine breakdowns. Due to the problem complexity, the presented mathematical model is categorized in NP-hardness; thus, a genetic algorithm (GA) is used for solving this problem. Several crossover and mutation strategies are adjusted for GA and parameters are calibrated based on Taguchi experimental design method. The great efficiency of the proposed GA is then demonstrated via comparing with particle swarm optimization (PSO) and the optimum solution via GAMS considering several small/medium and large-sized problems.
Amir-Mohammad Golmohammadi, Mahboobeh Honarvar, Guangdong Guangdong, Hasan Hosseini-Nasab,
Volume 30, Issue 4 (12-2019)
Abstract
There is still a great deal of attention in cellular manufacturing systems and proposing capable metaheuristics to better solve these complicated optimization models. In this study, machines are considered unreliable that life span of them follows a Weibull distribution. The intra and inter-cell movements for both parts and machines are determined using batch sizes for transferring parts are related to the distance traveled through a rectilinear distance. The objectives minimize the total cost of parts relocations and maximize the processing routes reliability due to alternative process routing. To solve the proposed problem, Genetic Algorithm (GA) and two recent nature-inspired algorithms including Keshtel Algorithm (KA) and Red Deer Algorithm (RDA) are employed. In addition, the main innovation of this paper is to propose a novel hybrid metaheuristic algorithm based on the benefits of aforementioned algorithms. Some numerical instances are defined and solved by the proposed algorithms and also validated by the outputs of exact solver. A real case study is also utilized to validate the proposed solution and modeling algorithms. The results indicate that the proposed hybrid algorithm is more appropriate than the exact solver and outperforms the performance of individual ones.
Samrad Jafarian-Namin, Mohammad Saber Fallahnezhad, Reza Tavakkoli-Moghaddam, Ali Salmasnia, Mohammad Hossein Abooei,
Volume 32, Issue 4 (12-2021)
Abstract
In recent years, it has been proven that integrating statistical process control, maintenance policy, and production can bring more benefits for the entire production systems. In the literature of triple-concept integrated models, it has generally been assumed that the observations are independent. However, the existence of correlated structures in some practical applications put the traditional control charts in trouble. The mixed EWMA-CUSUM (MEC) control chart and the ARMA control chart are effective tools to monitor the mean of autocorrelated processes. This paper proposes an integrated model subject to some constraints for determining the decision variables of triple concepts in the presence of autocorrelated data. Three types of autocorrelated processes are investigated to study their effects on the results. Moreover, the results of the MEC and ARMA charts are compared. Due to the complexity of the model, a particle swarm optimization (PSO) algorithm is applied to select optimal decision variables. An industrial example and extensive comparisons are provided
Hamed Nozari, Maryam Rahmaty,
Volume 34, Issue 4 (12-2023)
Abstract
In this paper, the modeling of a make-to-order problem considering the order queue system under the robust fuzzy programming method is discussed. Considering the importance of timely delivery of ideal demand, a four-level model of suppliers, production centers, distribution centers, and customers has been designed to reduce total costs. Due to the uncertainty of transportation costs and ideal demand, the robust fuzzy programming method is used to control the model. The analysis of different sample problems with the League Championship Algorithm (LCA), Particle Swarm Optimization (PSO), and Salp Swarm Algorithm (SSA) methods shows that with the increase in the uncertainty rate, the amount of ideal demand has increased, and this has led to an increase in total costs. On the other hand, with the increase of the stability coefficients of the model, contrary to the reduction of the shortage costs, the total costs of the model have increased due to transportation. Also, the analysis showed that with the increase in the number of servers in the production and distribution centers, the average waiting time for customers' order queues has decreased. By reducing the waiting time, the total delivery time of customer demand decreases, and the amount of actual demand increases. On the other hand, due to the lack of significant difference between the Objective Function Value (OBF) averages among the solution methods, they were prioritized, and SSA was recognized as an efficient algorithm. By implementing the model in a real case study in Iran for electronic components, it was observed that 4 areas of the Tehran metropolis (8-18-16-22) were selected as actual distribution centers. Also, the costs of the whole model were investigated in the case study and the results show the high efficiency of the solution methods in solving the make-to-order supply chain problem.
