Papers by Hadi Basirzadeh
Application of project scheduling in agriculture (case study: mechanized greenhouses construction project)
Research Journal of Applied Sciences, Engineering and Technology, 2012
راهبرد مدیریت مالی, 2014
Due to the advantages of mutual funds and their role in the capital markets, particularly in deve... more Due to the advantages of mutual funds and their role in the capital markets, particularly in developing countries, financial performance evaluation of them is so important. Accordingly, this study uses cluster analysis (k-mean method) by means of SPSS19 software program, and TOPSIS method using Excel 2010 software program to present the performance evaluation and ranking of mutual funds operating in Tehran Stock Exchange for the period 2011- 2012. In this regard, four criteria have been considered for evaluating the performance of mutual funds, such as return, standard deviation, turnover rate, the Treynor ratio. Moreover, 15 funds were chosen in the form of two clusters and were divided into funds with good performance and aggressive funds as superior funds. Accordingly, Saderat Bank Brokrage has the highest rank, while Atieh Novin mutual fund has the lowest rank.
In this study, the application of project scheduling for analysis and evaluation of mechanized gr... more In this study, the application of project scheduling for analysis and evaluation of mechanized greenhouse construction project was studied using Critical Path Method (CPM) with WinQsb software. This study was conducted in Khuzestan province of Iran. The results showed that the minimum completion time of this project, based on using CPM method, normal time and crash time is 201 and 137 days, respectively. Normal cost and crash cost are 3102665000 and 3187740000 Rials, respectively. Also cost slope in CPM method is 1329300 Rials that it means cost of reducing one day of the project completion time is 1329300 Rials. So results of CPM method showed that the cost of reducing the project completion time, to 180 days is 1600000 Rials.
We consider a mathematical model in the form of a system of ordinary differential equations (ODE)... more We consider a mathematical model in the form of a system of ordinary differential equations (ODE) for optimally administrating cancer treatments. The ODE system dynamics characterized by locating equilibrium points and stability properties are determined by linearization and using appropriate Lyapunov functions. By applying optimal control theory, we seek to minimize the cost function associated with the vaccine therapy looking for minimization of the tumor cells. Global existence of a solution is shown for this model and existence of an optimal control is proven. The optimality conditions and characterization of the control are discussed.
In this paper a method to obtain a non-dominated point for the multi-objective transportation pro... more In this paper a method to obtain a non-dominated point for the multi-objective transportation problem is presented. The superiority of this method over the other existing methods is that the presented non-dominated point is the closest solution to the ideal solution of that problem. The presented method does not need to have the ideal point and other parameters to find this solution. Also, the calculative load of this method is less than other methods in the literature.
Comparison between two or more fuzzy numbers, along with their ranking, is an important subject d... more Comparison between two or more fuzzy numbers, along with their ranking, is an important subject discussed in scholarly articles. We endeavor in this paper to present a simple yet effective parametric method for comparing fuzzy numbers. This method offer significant advantages over similar methods, in comparing intersected fuzzy numbers, rendering the comparison between fuzzy numbers possible in different decision levels. In the process, each fuzzy number will be given a parametric value in terms of , which is dependent on the related -cuts. We have compared this method to Cheng's centroid point method [5] (The relation of calculating centroid point of a fuzzy number was corrected later on by Wang [12]). The proposed method can be utilized for all types of fuzzy numbers whether normal, abnormal or negative.
Comparison between two or more fuzzy numbers, along with their ranking, is an important subject d... more Comparison between two or more fuzzy numbers, along with their ranking, is an important subject discussed in scholarly articles. We endeavor in this paper to present a simple yet effective parametric method for comparing fuzzy numbers. This method offer significant advantages over similar methods, in comparing intersected fuzzy numbers, rendering the comparison between fuzzy numbers possible in different decision levels. In the process, each fuzzy number will be given a parametric value in terms of α, which is dependent on the related α−cuts. We have compared this method to Cheng’s centroid point method [5] (The relation of calculating centroid point of a fuzzy number was corrected later on by Wang [12]). The proposed method can be utilized for all types of fuzzy numbers whether normal, abnormal or negative. AMS Mathematics Subject Classification : O3B52, O3E72, 62FO7
4OR
This work is an attempt to develop multiobjective versions of some wellknown single objective qua... more This work is an attempt to develop multiobjective versions of some wellknown single objective quasi-Newton methods, including BFGS, self-scaling BFGS (SS-BFGS), and the Huang BFGS (H-BFGS). A comprehensive and comparative study of these methods is presented in this paper. The Armijo line search is used for the implementation of these methods. The numerical results show that the Armijo rule does not work the same way for the multiobjective case as for the single objective case, because, in this case, it imposes a large computational effort and significantly decreases the speed of convergence in contrast to the single objective case. Hence, we consider two cases of all multi-objective versions of quasi-Newton methods: in the presence of the Armijo line search and in the absence of any line search. Moreover, the convergence of these methods without using any line search under some mild conditions is shown. Also, by introducing a multiobjective subproblem for finding the quasi-Newton multiobjective search direction, a simple representation of the Karush-Kuhn-Tucker conditions is derived. The H-BFGS quasi-Newton multiobjective optimization method provides a higher-order accuracy in approximating the second order curvature of the problem functions than the BFGS and SS-BFGS methods. Thus, this method has some benefits compared to the other methods as shown in the numerical results. All mentioned methods proposed in this paper are evaluated and compared with each other in different aspects. To do so, some well-known test problems and performance assessment criteria are employed. Moreover, these methods are compared with each other B Vahid Morovati
Journal of Mathematics and Computer Science
The present study has presented a method to obtain the best non-dominated point (the point having... more The present study has presented a method to obtain the best non-dominated point (the point having the least distance to the ideal point) for the multi-objective assignment problems which is more efficient and is so quick while simple, compared with other similar methods in other studies. This method does not need any parameters or point (even the ideal point) to solve the problem and effectively turns solving a multi-objective assignment problem into solving the single-objective assignment problem. Moreover, it gives the best non-dominated point as the solution. Finally, a numeral example has been brought to compare this method with proposed methods in other studies.
Bulletin of the Iranian Mathematical Society
In this paper, to introduce approximate efficiency notions in variable ordering structures, some ... more In this paper, to introduce approximate efficiency notions in variable ordering structures, some coradiant-valued maps are dealt with. Approximate nondominated and minimal elements are defined and some of their properties are studied. Corresponding to these concepts, necessary and sufficient conditions are provided. To obtain such conditions, some scalarization methods are investigated. The paper also investigates possible relationships between the Pascoletti-Serafini radial scalarization, approximate efficiency, approximate nondominance, and minimality utilizing some coradiant-valued maps.
Journal of Mathematics and Computer Science
This paper presents an approach namely, ones assignment method, for solving the traveling salesma... more This paper presents an approach namely, ones assignment method, for solving the traveling salesman problem. We have previously used this method for the assignment problem. We have slightly modified the procedure to get a tour of the traveling salesman problem. First we define the distance matrix, then by using determinant representation we obtain a reduced matrix which has at least one 1 in each row and each column. Then by using the new method, we obtain an optimal solution for traveling salesman problem by assigning ones to each row and each column. The new method is based on creating some ones in the distance matrix and then try to find a complete solution to their ones. At the end, this method is illustrated with some numerical examples.
Optimal control homotopy perturbation method for cancer model
International Journal of Biomathematics
In this paper, we introduced the optimal control homotopy perturbation method (OCHPM) by using th... more In this paper, we introduced the optimal control homotopy perturbation method (OCHPM) by using the homotopy perturbation method (HPM). Every one, by using of the proposed method, can obtain numerical solutions of mathematical modeling for cancer-immunotherapy. In this paper, in order to prove the preciseness and efficiency of the OCHPM method, we compared the obtained numerical solutions with HPM. The results obtained showed that the OCHPM method is powerful to generate the numerical solutions for some therapeutic models.
Coradiant sets and $$\varepsilon $$ ε -efficiency in multiobjective optimization
Journal of Global Optimization, 2017
This paper studies $$\varepsilon $$ε-efficiency in multiobjective optimization by using the so-ca... more This paper studies $$\varepsilon $$ε-efficiency in multiobjective optimization by using the so-called coradiant sets. Motivated by the nonlinear separation property for cones, a similar separation property for coradiant sets is investigated. A new notion, called Bishop–Phelps coradiant set is introduced and some appropriate properties of this set are studied. This paper also introduces the notions of $$\varepsilon $$ε-dual and augmented $$\varepsilon $$ε-dual for Bishop and Phelps coradiant sets. Using these notions, some scalarization and characterization properties for $$\varepsilon $$ε-efficient and proper $$\varepsilon $$ε-efficient points are proposed.
Barzilai and Borwein’s method for multiobjective optimization problems
Numerical Algorithms, 2015
The present study is an attempt to extend Barzilai and Borwein’s method for dealing with unconstr... more The present study is an attempt to extend Barzilai and Borwein’s method for dealing with unconstrained single objective optimization problems to multiobjective ones. As compared with Newton, Quasi-Newton and steepest descent multi-objective optimization methods, Barzilai and Borwein multiobjective optimization (BBMO) method requires simple and quick calculations in that it makes no use of the line search methods like the Armijo rule that necessitates function evaluations at each iteration. It goes without saying that the innovative aspect of the current study is due to the use of no function evaluations in comparison with other multi-objective optimization non-parametric methods (e.g. Newton, Quasi-Newton and steepest descent methods, to name a few) that have been investigated so far. Also, the convergence of the BBMO method for the objective functions assumed to be twice continuously differentiable has been proved. MATLAB software was utilized to implement the BBMO method, and the results were compared with the other methods mentioned earlier. Using some performance assessment, the quality of nondominated frontier of BBMO was analogized to above mentioned methods. In addition, the approximate nondominated frontiers gained from the methods were compared with the exact nondominated frontier for some problems. Also, performance profiles are considered to visualize numerical results presented in tables.
In this paper we present a new method for ranking discrete fuzzy sets. Comparing between two or m... more In this paper we present a new method for ranking discrete fuzzy sets. Comparing between two or more fuzzy numbers and ranking them is an important subject in fuzzy theory. Our method is a simple and effective parametric method to compare fuzzy numbers and discrete fuzzy sets. The proposed method can be utilized for all types of fuzzy sets whether normal or abnormal. In the end we present an example to illustrate the method.
Finding non-dominated solutions for bi-objective integer transportation problem
Proceedings of the Jangjeon Mathematical Society
A bi-objective programming problem for a transportation model is proposed. The objectives are to ... more A bi-objective programming problem for a transportation model is proposed. The objectives are to minimize the total transportation cost and the other functions. This paper deals with an algorithm for finding all the non-dominated solutions and corresponding efficient solutions for bi-objective integer transportation problems and giving the best efficient solution for problem too.
Assignment problem is an important subject discussed in real physical world. We endeavor in this ... more Assignment problem is an important subject discussed in real physical world. We endeavor in this paper to introduce a new approach to assignment problem namely, ones assignment method, for solving a wide rang of such problems. This method offers significant advantages over similar methods, in the process, first we define the assignment matrix, then by using determinant representation we obtain a reduced matrix which has at least one 1 in each row and columns. Then by using the new method, we obtain an optimal solution for assignment problem by assigning ones to each row and each column. The new method is based on creating some ones in the assignment matrix and then try to find a complete assignment to there ones. The proposed method is a systematic procedure, easy to apply and can be utilized for all types of assignment problem with maximize or minimize objective functions. At the end, this method is illustrated with some numerical examples.
Shortest path problem in a fuzzy network
Proceedings of the Jangjeon Mathematical Society
This paper deals with a shortest path problem on a network in which a fuzzy number, instead of a ... more This paper deals with a shortest path problem on a network in which a fuzzy number, instead of a real number, is assigned to each arc length. First, we propose a parametric method for ranking fuzzy numbers based on α-cuts [H. Basirzadeh and R. Abbasi, J. Appl. Math. Inf. 26, 767–778 (2008)]. Second, by this method and Floyd’s algorithm, we introduce a new algorithm to find the shortest path in a fuzzy network, an illustrative example is given to demonstrate our proposed approach.
We study a fuzzy transportation problem, and we introduce an approach for solving a wide range of... more We study a fuzzy transportation problem, and we introduce an approach for solving a wide range of such problem by using a method which apply it for ranking of the fuzzy numbers. Some of the quantities in a fuzzy transportation problem may be fuzzy or crisp quantities. In many fuzzy decision problems, the quantities are represented in terms of fuzzy numbers. Fuzzy numbers may be normal or abnormal, triangular or trapezoidal or any LR fuzzy number. Thus, some fuzzy numbers are not directly comparable. First, we transform the fuzzy quantities as the cost, coefficients, supply and demands, in to crisp quantities by using our method and then by using the classical algorithms we solve and obtain the solution of the problem. The new method is a systematic procedure, easy to apply and can be utilized for all types of transportation problem whether maximize or minimize objective function. Finally, this method is illustrated with a numerical example.
International Journal of Control, Automation and Systems, 2014
Therapeutic vaccines are being developed as a promising new approach to treatment for cancer pati... more Therapeutic vaccines are being developed as a promising new approach to treatment for cancer patients. There are still many unanswered questions about which kind of therapeutic vaccines are the best for the cancer treatments? In this paper we consider a mathematical model, in the form of a system of ordinary differential equations (ODE), this system is an example from a class of mathematical models for immunotherapy of the tumor that were derived from a biologically validated model by Lisette G. de Pillis. The problem how to schedule a variable amount of which vaccines to achieve a maximum reduction in the primary cancer volume is consider as an optimal control problem and it is shown that optimal control is quadratic with 0 denoting a trajectory corresponding to no treatment and 1 a trajectory with treatment at maximum dose along that all therapeutics are being exhausted. The ODE system dynamics characterized by locating equilibrium points and stability properties are determined by using appropriate Lyapunov functions. Especially we attend a parametric sensitivity analysis, which indicates the dependency of the optimal solution with respect to disturbances in model parameters.
Uploads
Papers by Hadi Basirzadeh