IEEE Transactions on Evolutionary Computation, 2000
This paper presents a search method that combines elements from evolutionary and local search par... more This paper presents a search method that combines elements from evolutionary and local search paradigms by the systematic use of crossover operations, generally used as structured exchange of genes between a series of solutions in genetic algorithms. Crossover operations here are particularly utilized as a systematic means to generate several possible solutions from two superior solutions. To test the effectiveness of the method, it has been applied to the resource-constrained project scheduling problem. The computational experiments show that the application of the method to this problem is promising.
Analysis of droughts from both the regional and probabilistic points of view is crucial in drough... more Analysis of droughts from both the regional and probabilistic points of view is crucial in drought-prone arid and semiarid lands. In this work, the probabilistic behavior and spatial pattern of extreme hydrological droughts based on the minimum streamflow drought index values at 3-, 6-, 9-and 12-month time scales were analyzed by using L-moments in the Karkheh river basin in the southwest of Iran. The results indicated that for the 3-month time scale, the region was homogenous, while for larger time scales the region was divided into two subregions. For all time scales and subregions, the Pearson Type III and Generalized Pareto distributions provided a better fit to the data than the generalized logistic, generalized extreme value and log-normal distributions. The simulation results of the estimated regional quantiles showed that the accuracy of the quantile estimates decreased as return period increased. Furthermore, higher probability of severe droughts is expected at regional scale compared with site scale.
A simple and efficient procedure for reductive methylation of primary and secondary amines using ... more A simple and efficient procedure for reductive methylation of primary and secondary amines using N‐methylpiperidine zinc borohydride (ZBNMPP), giving tertiary amines, is described. The reaction is carried out in methanol at room temperature under neutral conditions.
One-Pot Reductive Amination of Aldehydes and Ketones Using N-Methylpiperidine Zinc Borohydride (Z... more One-Pot Reductive Amination of Aldehydes and Ketones Using N-Methylpiperidine Zinc Borohydride (ZBNMPP) as a New Reducing Agent. -The novel and stable reducing agent allows the preparation of a broad spectrum of amines from aldehydes and ketones in excellent yields. Various functional groups are not affected. -(ALINEZHAD*, H.; TAJBAKHSH, M.; ZAMANI, R.; Synlett 2006, 3, 431-434; Dep. Chem., Mazandaran Univ., Babolsar, Iran; Eng.) -Mais 25-054
This paper presents a hybrid decomposition procedure for solving the resource-constrained project... more This paper presents a hybrid decomposition procedure for solving the resource-constrained project scheduling problem. The procedure finds an initial schedule for the project, and refines it through a decomposition process. This is performed through a refinement process which consists of (i) analyzing the initial schedule to find appropriate decomposition point(s), (ii) decomposing the associated project into appropriate subprojects, (iii) optimizing the subprojects by an efficient implicit enumeration technique, and subsequently (iv) integrating optimal subschedules to create a feasible schedule. This refinement process is aimed at reducing the makespan of the initial schedule. To achieve further reduction, the refined schedule is overrefined by a genetic algorithm. The results of computational experiments performed on 2,040 benchmark instances indicate that in a reasonable time the procedure can obtain solutions whose average percentage deviation from their associated best solutions in the litrature is 0.41.
Ieee Transactions on Evolutionary Computation, Dec 1, 2010
This paper presents a search method that combines elements from evolutionary and local search par... more This paper presents a search method that combines elements from evolutionary and local search paradigms by the systematic use of crossover operations, generally used as structured exchange of genes between a series of solutions in genetic algorithms. Crossover operations here are particularly utilized as a systematic means to generate several possible solutions from two superior solutions. To test the effectiveness of the method, it has been applied to the resource-constrained project scheduling problem. The computational experiments show that the application of the method to this problem is promising.
Proceedings of the International Symposium for Next Generation Infrastructure, 2014
Modelling and systems simulation for improving city planning, and traffic equilibrium are involve... more Modelling and systems simulation for improving city planning, and traffic equilibrium are involved with the development of adaptive systems that can learn and respond to the environment intelligently. By employing sophisticated techniques which highly support infrastructure planning and design, evolutionary computation can play a key role in the development of such systems. The key to presenting solution strategies for these systems is fitness landscape which makes some problems hard and some problems easy to tackle. Moreover, constructive methods and local searches can assist evolutionary searches to improve their performance. In this paper, in the context of infrastructure, in general, and city planning, and traffic equilibrium, in particular, the integration of these four concepts is briefly discussed.
This paper presents a hybrid schedule generation scheme for solving the resource-constrained proj... more This paper presents a hybrid schedule generation scheme for solving the resource-constrained project scheduling problem. The scheme, which is called the Polarized Adaptive Scheduling Scheme (PASS), can operate in a spectrum between two poles, namely the parallel and serial schedule generation schemes. A polarizer parameter in the range between zero and one indicates how similarly the PASS behaves like each of its two poles. The presented hybrid is incorporated into a novel genetic algorithm that never degenerates, resulting in an effective self-adaptive procedure. The key point of this genetic algorithm is the embedding of the polarizer parameter as a gene in the genomes used. Through this embedding, the procedure learns via monitoring its own performance and incorporates this knowledge in conducting the search process. The computational experiments indicate that the procedure can produce optimal solutions for a large percentage of benchmark instances.
Abstract. This paper describes an efficient procedure for resource-constrained project scheduling... more Abstract. This paper describes an efficient procedure for resource-constrained project scheduling problems. It starts with a simulated annealing technique to find a base schedule, and then improves the result by a time-windowing process. Every time-window, which is part of the base ...
This paper presents an effective procedure for solving the job shop problem. Synergistically comb... more This paper presents an effective procedure for solving the job shop problem. Synergistically combining small and large neighborhood schemes, the procedure consists of four components, namely (i) a construction method for generating semi-active schedules by a forward-backward mechanism, (ii) a local search for manipulating a small neighborhood structure guided by a tabu list, (iii) a feedback-based mechanism for perturbing the solutions generated, and (iv) a very large-neighborhood local search guided by a forward-backward shifting bottleneck method. The combination of shifting bottleneck mechanism and tabu list is used as a means of the manipulation of neighborhood structures, and the perturbation mechanism employed diversifies the search. A feedback mechanism, called repeat-check, detects consequent repeats and ignites a perturbation when the total number of consecutive repeats for two identical makespan values reaches a given threshold. The results of extensive computational exper...
Ionic polymer conductive network composite (IPCNC) actuators are a class of electroactive polymer... more Ionic polymer conductive network composite (IPCNC) actuators are a class of electroactive polymer composites that exhibit some interesting electromechanical characteristics such as low voltage actuation, large displacements, and benefit from low density and elastic modulus. Thus, these emerging materials have potential applications in biomimetic and biomedical devices. Whereas significant efforts have been directed toward the development of IPMC actuators, the establishment of a proper mathematical model that could effectively predict the actuators' dynamic behavior is still a key challenge. This paper presents development of an effective modeling strategy for dynamic analysis of IPCNC actuators undergoing large bending deformations. The proposed model is composed of two parts, namely electrical and mechanical dynamic models. The electrical model describes the actuator as a resistive-capacitive (RC) transmission line, whereas the mechanical model describes the actuator as a system of rigid links connected by spring-damping elements. The proposed modeling approach is validated by experimental data, and the results are discussed.
This paper presents a hybrid decomposition procedure for solving the resource-constrained project... more This paper presents a hybrid decomposition procedure for solving the resource-constrained project scheduling problem. The procedure finds an initial schedule for the project, and refines it through a decomposition process. This is performed through a refinement process which consists of (i) analyzing the initial schedule to find appropriate decomposition point(s), (ii) decomposing the associated project into appropriate subprojects, (iii) optimizing the subprojects by an efficient implicit enumeration technique, and subsequently (iv) integrating optimal subschedules to create a feasible schedule. This refinement process is aimed at reducing the makespan of the initial schedule. To achieve further reduction, the refined schedule is overrefined by a genetic algorithm. The results of computational experiments performed on 2,040 benchmark instances indicate that in a reasonable time the procedure can obtain solutions whose average percentage deviation from their associated best solutions in the litrature is 0.41.
From an object-oriented perspective, this paper investigates the interdisciplinary aspects of pro... more From an object-oriented perspective, this paper investigates the interdisciplinary aspects of problem representation as well the differences between representation of problems in the mind and that in the machine. By defining an object as a combination of a symbol-structure and its associated operations, it shows how the representation of problems can become related to control, which conducts the search in finding a solution. Different types of representation of problems in the machine are classified into four categories, and in a similar way four distinct models are distinguished for the representation of problems in the mind. The concept of layered hierarchies, as the main theme of the object-oriented paradigm, is used to examine the implications of problem representation in the mind for improving the representation of problems in the machine.
This paper presents a low power 60 GHz transceiver that includes RF, LO, PLL and BB signal paths ... more This paper presents a low power 60 GHz transceiver that includes RF, LO, PLL and BB signal paths integrated into a single chip. The transceiver has been fabricated in a standard 90 nm CMOS process and includes specially designed ESD protection on all mm-wave pads. With a 1.2 V supply the chip consumes 170 mW while transmitting 10 dBm and 138 mW while receiving. Data transmission up to 5 Gb/s on each of I and Q channels has been measured, as has data reception over a 1m wireless link at 4 Gb/s QPSK with less than 10 11 BER.
An effective hybrid evolutionary search method is presented which integrates a genetic algorithm ... more An effective hybrid evolutionary search method is presented which integrates a genetic algorithm with a local search. Whereas its genetic algorithm improves the solutions obtained by its local search, its local search component utilizes a synergy between two neighborhood schemes in diversifying the pool used by the genetic algorithm. Through the integration of these two searches, the crossover operators further enhance the solutions that are initially local optimal for both neighborhood schemes; and the employed local search provides fresh solutions for the pool whenever needed. The joint endeavor of its local search mechanism and its genetic algorithm component has made the method both robust and effective. The local search component examines unvisited regions of search space and consequently diversifies the search; and the genetic algorithm component recombines essential pieces of information existing in several high-quality solutions and intensifies the search. It is through striking such a balance between diversification and intensification that the method exploits the structure of search space and produces superb solutions. The method has been implemented as a procedure for the resource-constrained project scheduling problem. The computational experiments on 2,040 benchmark instances indicate that the procedure is very effective.
This article examines the effect of cultural differences on translation accuracy outcomes for the... more This article examines the effect of cultural differences on translation accuracy outcomes for the translation of the Minnesota Multiphasic Personality Inventory-2 (S. R. Hathaway & J. C. McKinley, 1940) into Farsi for use in Iran.
IEEE Transactions on Evolutionary Computation, 2000
This paper presents a search method that combines elements from evolutionary and local search par... more This paper presents a search method that combines elements from evolutionary and local search paradigms by the systematic use of crossover operations, generally used as structured exchange of genes between a series of solutions in genetic algorithms. Crossover operations here are particularly utilized as a systematic means to generate several possible solutions from two superior solutions. To test the effectiveness of the method, it has been applied to the resource-constrained project scheduling problem. The computational experiments show that the application of the method to this problem is promising.
Analysis of droughts from both the regional and probabilistic points of view is crucial in drough... more Analysis of droughts from both the regional and probabilistic points of view is crucial in drought-prone arid and semiarid lands. In this work, the probabilistic behavior and spatial pattern of extreme hydrological droughts based on the minimum streamflow drought index values at 3-, 6-, 9-and 12-month time scales were analyzed by using L-moments in the Karkheh river basin in the southwest of Iran. The results indicated that for the 3-month time scale, the region was homogenous, while for larger time scales the region was divided into two subregions. For all time scales and subregions, the Pearson Type III and Generalized Pareto distributions provided a better fit to the data than the generalized logistic, generalized extreme value and log-normal distributions. The simulation results of the estimated regional quantiles showed that the accuracy of the quantile estimates decreased as return period increased. Furthermore, higher probability of severe droughts is expected at regional scale compared with site scale.
A simple and efficient procedure for reductive methylation of primary and secondary amines using ... more A simple and efficient procedure for reductive methylation of primary and secondary amines using N‐methylpiperidine zinc borohydride (ZBNMPP), giving tertiary amines, is described. The reaction is carried out in methanol at room temperature under neutral conditions.
One-Pot Reductive Amination of Aldehydes and Ketones Using N-Methylpiperidine Zinc Borohydride (Z... more One-Pot Reductive Amination of Aldehydes and Ketones Using N-Methylpiperidine Zinc Borohydride (ZBNMPP) as a New Reducing Agent. -The novel and stable reducing agent allows the preparation of a broad spectrum of amines from aldehydes and ketones in excellent yields. Various functional groups are not affected. -(ALINEZHAD*, H.; TAJBAKHSH, M.; ZAMANI, R.; Synlett 2006, 3, 431-434; Dep. Chem., Mazandaran Univ., Babolsar, Iran; Eng.) -Mais 25-054
This paper presents a hybrid decomposition procedure for solving the resource-constrained project... more This paper presents a hybrid decomposition procedure for solving the resource-constrained project scheduling problem. The procedure finds an initial schedule for the project, and refines it through a decomposition process. This is performed through a refinement process which consists of (i) analyzing the initial schedule to find appropriate decomposition point(s), (ii) decomposing the associated project into appropriate subprojects, (iii) optimizing the subprojects by an efficient implicit enumeration technique, and subsequently (iv) integrating optimal subschedules to create a feasible schedule. This refinement process is aimed at reducing the makespan of the initial schedule. To achieve further reduction, the refined schedule is overrefined by a genetic algorithm. The results of computational experiments performed on 2,040 benchmark instances indicate that in a reasonable time the procedure can obtain solutions whose average percentage deviation from their associated best solutions in the litrature is 0.41.
Ieee Transactions on Evolutionary Computation, Dec 1, 2010
This paper presents a search method that combines elements from evolutionary and local search par... more This paper presents a search method that combines elements from evolutionary and local search paradigms by the systematic use of crossover operations, generally used as structured exchange of genes between a series of solutions in genetic algorithms. Crossover operations here are particularly utilized as a systematic means to generate several possible solutions from two superior solutions. To test the effectiveness of the method, it has been applied to the resource-constrained project scheduling problem. The computational experiments show that the application of the method to this problem is promising.
Proceedings of the International Symposium for Next Generation Infrastructure, 2014
Modelling and systems simulation for improving city planning, and traffic equilibrium are involve... more Modelling and systems simulation for improving city planning, and traffic equilibrium are involved with the development of adaptive systems that can learn and respond to the environment intelligently. By employing sophisticated techniques which highly support infrastructure planning and design, evolutionary computation can play a key role in the development of such systems. The key to presenting solution strategies for these systems is fitness landscape which makes some problems hard and some problems easy to tackle. Moreover, constructive methods and local searches can assist evolutionary searches to improve their performance. In this paper, in the context of infrastructure, in general, and city planning, and traffic equilibrium, in particular, the integration of these four concepts is briefly discussed.
This paper presents a hybrid schedule generation scheme for solving the resource-constrained proj... more This paper presents a hybrid schedule generation scheme for solving the resource-constrained project scheduling problem. The scheme, which is called the Polarized Adaptive Scheduling Scheme (PASS), can operate in a spectrum between two poles, namely the parallel and serial schedule generation schemes. A polarizer parameter in the range between zero and one indicates how similarly the PASS behaves like each of its two poles. The presented hybrid is incorporated into a novel genetic algorithm that never degenerates, resulting in an effective self-adaptive procedure. The key point of this genetic algorithm is the embedding of the polarizer parameter as a gene in the genomes used. Through this embedding, the procedure learns via monitoring its own performance and incorporates this knowledge in conducting the search process. The computational experiments indicate that the procedure can produce optimal solutions for a large percentage of benchmark instances.
Abstract. This paper describes an efficient procedure for resource-constrained project scheduling... more Abstract. This paper describes an efficient procedure for resource-constrained project scheduling problems. It starts with a simulated annealing technique to find a base schedule, and then improves the result by a time-windowing process. Every time-window, which is part of the base ...
This paper presents an effective procedure for solving the job shop problem. Synergistically comb... more This paper presents an effective procedure for solving the job shop problem. Synergistically combining small and large neighborhood schemes, the procedure consists of four components, namely (i) a construction method for generating semi-active schedules by a forward-backward mechanism, (ii) a local search for manipulating a small neighborhood structure guided by a tabu list, (iii) a feedback-based mechanism for perturbing the solutions generated, and (iv) a very large-neighborhood local search guided by a forward-backward shifting bottleneck method. The combination of shifting bottleneck mechanism and tabu list is used as a means of the manipulation of neighborhood structures, and the perturbation mechanism employed diversifies the search. A feedback mechanism, called repeat-check, detects consequent repeats and ignites a perturbation when the total number of consecutive repeats for two identical makespan values reaches a given threshold. The results of extensive computational exper...
Ionic polymer conductive network composite (IPCNC) actuators are a class of electroactive polymer... more Ionic polymer conductive network composite (IPCNC) actuators are a class of electroactive polymer composites that exhibit some interesting electromechanical characteristics such as low voltage actuation, large displacements, and benefit from low density and elastic modulus. Thus, these emerging materials have potential applications in biomimetic and biomedical devices. Whereas significant efforts have been directed toward the development of IPMC actuators, the establishment of a proper mathematical model that could effectively predict the actuators' dynamic behavior is still a key challenge. This paper presents development of an effective modeling strategy for dynamic analysis of IPCNC actuators undergoing large bending deformations. The proposed model is composed of two parts, namely electrical and mechanical dynamic models. The electrical model describes the actuator as a resistive-capacitive (RC) transmission line, whereas the mechanical model describes the actuator as a system of rigid links connected by spring-damping elements. The proposed modeling approach is validated by experimental data, and the results are discussed.
This paper presents a hybrid decomposition procedure for solving the resource-constrained project... more This paper presents a hybrid decomposition procedure for solving the resource-constrained project scheduling problem. The procedure finds an initial schedule for the project, and refines it through a decomposition process. This is performed through a refinement process which consists of (i) analyzing the initial schedule to find appropriate decomposition point(s), (ii) decomposing the associated project into appropriate subprojects, (iii) optimizing the subprojects by an efficient implicit enumeration technique, and subsequently (iv) integrating optimal subschedules to create a feasible schedule. This refinement process is aimed at reducing the makespan of the initial schedule. To achieve further reduction, the refined schedule is overrefined by a genetic algorithm. The results of computational experiments performed on 2,040 benchmark instances indicate that in a reasonable time the procedure can obtain solutions whose average percentage deviation from their associated best solutions in the litrature is 0.41.
From an object-oriented perspective, this paper investigates the interdisciplinary aspects of pro... more From an object-oriented perspective, this paper investigates the interdisciplinary aspects of problem representation as well the differences between representation of problems in the mind and that in the machine. By defining an object as a combination of a symbol-structure and its associated operations, it shows how the representation of problems can become related to control, which conducts the search in finding a solution. Different types of representation of problems in the machine are classified into four categories, and in a similar way four distinct models are distinguished for the representation of problems in the mind. The concept of layered hierarchies, as the main theme of the object-oriented paradigm, is used to examine the implications of problem representation in the mind for improving the representation of problems in the machine.
This paper presents a low power 60 GHz transceiver that includes RF, LO, PLL and BB signal paths ... more This paper presents a low power 60 GHz transceiver that includes RF, LO, PLL and BB signal paths integrated into a single chip. The transceiver has been fabricated in a standard 90 nm CMOS process and includes specially designed ESD protection on all mm-wave pads. With a 1.2 V supply the chip consumes 170 mW while transmitting 10 dBm and 138 mW while receiving. Data transmission up to 5 Gb/s on each of I and Q channels has been measured, as has data reception over a 1m wireless link at 4 Gb/s QPSK with less than 10 11 BER.
An effective hybrid evolutionary search method is presented which integrates a genetic algorithm ... more An effective hybrid evolutionary search method is presented which integrates a genetic algorithm with a local search. Whereas its genetic algorithm improves the solutions obtained by its local search, its local search component utilizes a synergy between two neighborhood schemes in diversifying the pool used by the genetic algorithm. Through the integration of these two searches, the crossover operators further enhance the solutions that are initially local optimal for both neighborhood schemes; and the employed local search provides fresh solutions for the pool whenever needed. The joint endeavor of its local search mechanism and its genetic algorithm component has made the method both robust and effective. The local search component examines unvisited regions of search space and consequently diversifies the search; and the genetic algorithm component recombines essential pieces of information existing in several high-quality solutions and intensifies the search. It is through striking such a balance between diversification and intensification that the method exploits the structure of search space and produces superb solutions. The method has been implemented as a procedure for the resource-constrained project scheduling problem. The computational experiments on 2,040 benchmark instances indicate that the procedure is very effective.
This article examines the effect of cultural differences on translation accuracy outcomes for the... more This article examines the effect of cultural differences on translation accuracy outcomes for the translation of the Minnesota Multiphasic Personality Inventory-2 (S. R. Hathaway & J. C. McKinley, 1940) into Farsi for use in Iran.
Uploads
Papers by Reza Zamani