فهرست مقالات Initial solution

• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  1 - A Heuristic Algorithm for Nonlinear Lexicography Goal Programming with an Efficient Initial Solution
  Mahdi Bashiri Amir Hossein Parsa Manesh Hamid Hasanzadeh
  In this paper, a heuristic algorithm is proposed in order to solve a nonlinear lexicography goal programming (NLGP) by using an efficient initial point. Some numerical experiments showed that the search quality by the proposed heuristic in a multiple objectives problem چکیده کامل

  In this paper, a heuristic algorithm is proposed in order to solve a nonlinear lexicography goal programming (NLGP) by using an efficient initial point. Some numerical experiments showed that the search quality by the proposed heuristic in a multiple objectives problem depends on the initial point features, so in the proposed approach the initial point is retrieved by Data Envelopment Analysis to be selected as an efficient solution. There are some weaknesses in classic NLGP algorithm that lead to trapping into the local optimum, so a simulated annealing concept is implemented during the searching stage to increase the diversity of search in the solution space. Some numerical examples with different sizes were generated and comparison of results confirms that the proposed solution heuristic is more efficient than the classic approach. Moreover the proposed approach was extended for cases with ordinal weights of inputs or outputs. The computational experiments for 5 numerical instances and the statistical analysis indicate that the proposed heuristic algorithm is a robust procedure to find better preferred solution comparing to the classic NLGP. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  2 - Facilitating Placement of the Reactive Compensators Using a Revised Impedance Matrix
  Babak Rashidi علی اخوین
  Determining placement and capacity of reactive-power compensators in distribution networks is an optimization problem with various objectives and technical constraints. The large number of variables and constraints in this problem can be an obstacle for the success of c چکیده کامل

  Determining placement and capacity of reactive-power compensators in distribution networks is an optimization problem with various objectives and technical constraints. The large number of variables and constraints in this problem can be an obstacle for the success of classical and meta-heuristic optimization methods. Therefore, having a guess of the suitable buses for installing compensators as an initial solution, improves performance of the mentioned methods. Using the network impedance matrix, an initial guess is obtained in this paper in the form of suitable or higher-priority buses. The applied matrix is a revised version in which loads connected to the buses are taken into account. The reasons for considering the loads are that, firstly, the list of bus-priorities becomes more consistent with network load pattern, and secondly, difficulties in forming the impedance matrix in radial distribution networks are obviated. Comparison of the list of suitable buses for installing the compensator obtained by the proposed method with the list of buses extracted from the sensitivity analysis indicates the effectiveness of the former method. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  3 - A new approach Spider's web initial solution and data envelopment analysis for solving an $X$-bar control chart
  K. Ranjbar H. Khaloozadeh A. Heydari
  10.30495/jlta.2023.1998822.1592
  $X$-bar control charts are widely used to monitor and control business and manufacturing processes. Design of control charts refers to the selection of parameters, including sample size, control-limit width, and sampling frequency. Many researchers have worked on this i چکیده کامل

  $X$-bar control charts are widely used to monitor and control business and manufacturing processes. Design of control charts refers to the selection of parameters, including sample size, control-limit width, and sampling frequency. Many researchers have worked on this issue and have also proposed various solutions. However, despite the numerous advantages, the proposed methods also have their own set of problems. The biggest challenge is the complexity of solving these issues. Due to the fact that optimal design of control charts can be formulated as a multi objective optimization problem, in this paper to solve this problem, we used initial solution Spider's web data envelopment analysis method. In previous methods used multiple algorithms to resolve the issue. But in the proposed method once using Data Envelopment Analysis method and without any other algorithm can solve multi objective problem and this method can yield desirable efficient. Lastly, we compare our method with others and demonstrate its application in a real industrial context. پرونده مقاله