Search published articles


Showing 3 results for Differential Evolution

Hadi Mokhtari , Ashkan Mozdgir,
Volume 26, Issue 2 (7-2015)
Abstract

Assembly lines are special kinds of production systems which are of great importance in the industrial production of high quantity commodities. In many practical manufacturing systems, configuration of assembly lines is fixed and designing a new line may be incurred huge amount of costs and thereby it is not desirable for practitioners. When some changes related to market demand occur, it is worthwhile to re-balance an existing line rather than balancing a new one. Hence, in this paper we suggest a re-balancing model of an existing assembly line in which a new demand related cycle time (CT) is embedded to the traditional assembly line balancing problem (ALBP) as a new parameter. It does not focus on balancing a new line instead it considers a more realistic problem which is re-balancing an existing line. The objective is to re-schedule the tasks in order to reduce the current CT to the new required one such that two criteria are optimized: (i) minimization of the incurred costs and (ii) minimization of non-smoothing of reconfigured line. To solve the considered problem, an effective differential evolution algorithm is developed. Furthermore, to enhance the performance of algorithm, its parameters are optimized by the use of Taguchi method which is a conventional statistical technique for parameter design. The obtained results from computational experiments on benchmark instances show the effectiveness of suggested algorithm against other methods.

\"AWT


Mostafa Soltani, R. Azizmohammadi, Seyed Mohammad Hassan Hosseini, Mahdi Mohammadi Zanjani,
Volume 32, Issue 2 (6-2021)
Abstract

The blood supply chain network is an especial case of the general supply chain network, which starts with the blood donating and ends with patients. Disasters such as earthquakes, floods, storms, and accidents usually event suddenly. Therefore, designing an efficient network for the blood supply chain network at emergencies is one of the most important challenging decisions for related managers. This paper aims to introduce a new blood supply chain network in disasters using the hub location approach. After introducing the last studies in blood supply chain and hub location separately, a new mixed-integer linear programming model based on hub location is presented for intercity transportation. Due to the complexity of this problem, two new methods are developed based on Particle Swarm Optimization and Differential Evolution algorithms to solve practical-sized problems. Real data related to a case study is used to test the developed mathematical model and to investigate the performance of the proposed algorithms. The result approves the accuracy of the new mathematical model and also the good performance of the proposed algorithms in solving the considered problem in real-sized dimensions. The proposed model is applicable considering new variables and operational constraints to more compatibility with reality. However, we considered the maximum possible demand for blood products in the proposed approach and so, lack of investigation of uncertainty conditions in key parameters is one of the most important limitations of this research.

Ali Fallahi, Mehdi Mahnam, Seyed Taghi Akhavan Niaki,
Volume 33, Issue 2 (6-2022)
Abstract

Integrated treatment planning for cancer patients has high importance in intensity modulated radiation therapy (IMRT). Direct aperture optimization (DAO) is one of the prominent approaches used in recent years to attain this goal. Considering a set of beam directions, DAO is an integrated approach to optimize the intensity and leaf position of apertures in each direction. In this paper, first, a mixed integer-nonlinear mathematical formulation for the DAO problem in IMRT treatment planning is presented. Regarding the complexity of the problem, two well-known metaheuristic algorithms, particle swarm optimization (PSO) and differential evolution (DE), are utilized to solve the model. The parameters of both algorithms are calibrated using the Taguchi method. The performance of two proposed algorithms is evaluated by 10 real patients with liver cancer disease. The statistical analysis of results using paired samples t-test demonstrates the outperformance of the PSO algorithm compared to differential evolution, in terms of both the treatment plan quality and the computational time. Finally, a sensitivity analysis is performed to provide more insights about the performance of algorithms and the results revealed that increasing the number of beam angles and allowable apertures improve the treatment quality with a computational cost.
 

Page 1 from 1