Search results
1 – 10 of 809Önder Halis Bettemir and M. Talat Birgonul
Exact solution of time–cost trade-off problem (TCTP) by the state-of-the-art meta-heuristic algorithms can be obtained for small- and medium-scale problems, while satisfactory…
Abstract
Purpose
Exact solution of time–cost trade-off problem (TCTP) by the state-of-the-art meta-heuristic algorithms can be obtained for small- and medium-scale problems, while satisfactory results cannot be obtained for large construction projects. In this study, a hybrid heuristic meta-heuristic algorithm that adapts the search domain is developed to solve the large-scale discrete TCTP more efficiently.
Design/methodology/approach
Minimum cost slope–based heuristic network analysis algorithm (NAA), which eliminates the unfeasible search domain, is embedded into differential evolution meta-heuristic algorithm. Heuristic NAA narrows the search domain at the initial phase of the optimization. Moreover, activities with float durations higher than the predetermined threshold value are eliminated and then the meta-heuristic algorithm starts and searches the global optimum through the narrowed search space. However, narrowing the search space may increase the probability of obtaining a local optimum. Therefore, adaptive search domain approach is employed to make reintroduction of the eliminated activities to the design variable set possible, which reduces the possibility of converging into local minima.
Findings
The developed algorithm is compared with plain meta-heuristic algorithm with two separate analyses. In the first analysis, both algorithms have the same computational demand, and in the latter analysis, the meta-heuristic algorithm has fivefold computational demand. The tests on case study problems reveal that the developed algorithm presents lower total project costs according to the dependent t-test for paired samples with α = 0.0005.
Research limitations/implications
In this study, TCTP is solved without considering quality or restrictions on the resources.
Originality/value
The proposed method enables to adapt the number of parameters, that is, the search domain and provides the opportunity of obtaining significant improvements on the meta-heuristic algorithms for other engineering optimization problems, which is the theoretical contribution of this study. The proposed approach reduces the total construction cost of the large-scale projects, which can be the practical benefit of this study.
Details
Keywords
Iman Mohammadi, Hamzeh Mohammadi Khoshouei and Arezoo Aghaei Chadegani
In this study, to maximize returns and minimize investment risk, an attempt was made to form an optimal portfolio under conditions where the capital market has a price bubble…
Abstract
Purpose
In this study, to maximize returns and minimize investment risk, an attempt was made to form an optimal portfolio under conditions where the capital market has a price bubble. According to the purpose, the research was of the applied type, in terms of data, quantitative and postevent, and in terms of the type of analysis, it was of the descriptive-correlation type. Sequence, skewness and kurtosis tests were used to identify the months with bubbles from 2015 to 2021 in the Tehran Stock Exchange. After identifying the bubble courses, artificial bee colony meta-heuristic and invasive weed algorithms were used to optimize the portfolio. The purpose of this paper is to address these issues.
Design/methodology/approach
The existence of bubbles in the market, especially in the capital market, can prevent the participation of investors in the capital market process and the correct allocation of financial resources for the economic development of the country. However, due to the goal of investors to achieve a portfolio of high returns with the least amount of risk, there is need to pay attention to these markets increases.
Findings
The results identify 14 periods of price bubbles during the study period. Additionally, stock portfolios with maximum returns and minimum risk were selected for portfolio optimization. According to the results of using meta-heuristic algorithms to optimize the portfolio, in relation to the obtained returns and risk, no significant difference was observed between the returns and risk of periods with price bubbles in each of the two meta-heuristic algorithms. This study can guide investors in identifying bubble courses and forming an optimal portfolio under these conditions.
Research limitations/implications
One of the limitations of this research is the non-generalizability of the findings to stock exchanges of other countries and other time periods due to the condition of the price bubble, as well as other companies in the stock market due to the restrictions considered for selecting the statistical sample.
Originality/value
This study intends to form an optimal stock portfolio in a situation where the capital market suffers from a price bubble. This study provides an effective and practical solution for investors in the field of stock portfolio optimization.
Details
Keywords
Umamaheswari Elango, Ganesan Sivarajan, Abirami Manoharan and Subramanian Srikrishna
Generator maintenance scheduling (GMS) is an essential task for electric power utilities as the periodical maintenance activity enhances the lifetime and also ensures the reliable…
Abstract
Purpose
Generator maintenance scheduling (GMS) is an essential task for electric power utilities as the periodical maintenance activity enhances the lifetime and also ensures the reliable and continuous operation of generating units. Though numerous meta-heuristic algorithms have been reported for the GMS solution, enhancing the existing techniques or developing new optimization procedure is still an interesting research task. The meta-heuristic algorithms are population based and the selection of their algorithmic parameters influences the quality of the solution. This paper aims to propose statistical tests guided meta-heuristic algorithm for solving the GMS problems.
Design/methodology/approach
The intricacy characteristics of the GMS problem in power systems necessitate an efficient and robust optimization tool. Though several meta-heuristic algorithms have been applied to solve the chosen power system operational problem, tuning of their control parameters is a protracting process. To prevail over the previously mentioned drawback, the modern meta-heuristic algorithm, namely, ant lion optimizer (ALO), is chosen as the optimization tool for solving the GMS problem.
Findings
The meta-heuristic algorithms are population based and require proper selection of algorithmic parameters. In this work, the ANOVA (analysis of variance) tool is proposed for selecting the most feasible decisive parameters in algorithm domain, and the statistical tests-based validation of solution quality is described. The parametric and non-parametric statistical tests are also performed to validate the selection of ALO against the various competing algorithms. The numerical and statistical results confirm that ALO is a promising tool for solving the GMS problems.
Originality/value
As a first attempt, ALO is applied to solve the GMS problem. Moreover, the ANOVA-based parameter selection is proposed and the statistical tests such as Wilcoxon signed rank and one-way ANOVA are conducted to validate the applicability of the intended optimization tool. The contribution of the paper can be summarized in two folds: the ANOVA-based ALO for GMS applications and statistical tests-based performance evaluation of intended algorithm.
Details
Keywords
Reza Noorian Talouki, Mirsaeid Hosseini Shirvani and Homayun Motameni
Improvement of workflow scheduling in distributed engineering systems
Abstract
Purpose
Improvement of workflow scheduling in distributed engineering systems
Design/methodology/approach
The authors proposed a hybrid meta heuristic optimization algorithm.
Findings
The authors have made improvement in hybrid approach by exploiting of genetic algorithm and simulated annealing plus points.
Originality/value
To the best of the authors’ knowledge, this paper presents a novel theorem and novel hybrid approach.
Details
Keywords
Syed Asif Raza and Umar Mustafa Al‐Turki
The purpose of this paper is to compare the effectiveness of two meta‐heuristics in solving the problem of scheduling maintenance operations and jobs processing on a single…
Abstract
Purpose
The purpose of this paper is to compare the effectiveness of two meta‐heuristics in solving the problem of scheduling maintenance operations and jobs processing on a single machine.
Design/methodology/approach
The two meta‐heuristic algorithms, tabu search and simulated annealing are hybridized using the properties of an optimal schedule identified in the existing literature to the problem. A lower bound is also suggested utilizing these properties.
Finding
In a numerical experimentation with large size problems, the best‐known heuristic algorithm to the problem is compared with the tabu search and simulated annealing algorithms. The study shows that the meta‐heuristic algorithms outperform the heuristic algorithm. In addition, the developed meta‐heuristics tend to be more robust against the problem‐related parameters than the existing algorithm.
Research limitations/implications
A future work may consider the possibility of machine failure along with the preventive maintenance. This relaxes the assumption that the machine cannot fail but it is rather maintained preventively. The multi‐criteria scheduling can also be considered as an avenue of future work. The problem can also be considered with stochastic parameters such that the processing times of the jobs and the maintenance related parameters are random and follow a known probability distribution function.
Practical implications
The usefulness of meta‐heuristic algorithms is demonstrated for solving a large scale NP‐hard combinatorial optimization problem. The paper also shows that the utilization of the directed search methods such as hybridization could substantially improve the performance of a meta‐heuristic.
Originality/value
This research highlights the impact of utilizing the directed search methods to cause hybridization in meta‐heuristic and the resulting improvement in their performance for large‐scale optimization.
Details
Keywords
Mingzhe Tao, Jinghua Xu, Shuyou Zhang and Jianrong Tan
This work aims to provide a rapid robust optimization design solution for parallel robots or mechanisms, thereby circumventing inefficiencies and wastage caused by empirical…
Abstract
Purpose
This work aims to provide a rapid robust optimization design solution for parallel robots or mechanisms, thereby circumventing inefficiencies and wastage caused by empirical design, as well as numerous physical verifications, which can be employed for creating high-quality prototypes of parallel robots in a variety of applications.
Design/methodology/approach
A novel subregional meta-heuristic iteration (SMI) method is proposed for the optimization of parallel robots. Multiple subregional optimization objectives are established and optimization is achieved through the utilisation of an enhanced meta-heuristic optimization algorithm, which roughly employs chaotic mapping in the initialization strategy to augment the diversity of the initial solution. The non-dominated sorting method is utilised for updating strategies, thereby achieving multi-objective optimization.
Findings
The actuator error under the same trajectory is visibly reduced after SMI, with a maximum reduction of 6.81% and an average reduction of 1.46%. Meanwhile, the response speed, maximum bearing capacity and stiffness of the mechanism are enhanced by 63.83, 43.98 and 97.51%, respectively. The optimized mechanism is more robust and the optimization process is efficient.
Originality/value
The proposed robustness multi-objective optimization via SMI is more effective in improving the performance and precision of the parallel mechanisms in various applications. Furthermore, it provides a solution for the rapid and high-quality optimization design of parallel robots.
Details
Keywords
Armin Mahmoodi, Leila Hashemi, Amin Mahmoodi, Benyamin Mahmoodi and Milad Jasemi
The proposed model has been aimed to predict stock market signals by designing an accurate model. In this sense, the stock market is analysed by the technical analysis of Japanese…
Abstract
Purpose
The proposed model has been aimed to predict stock market signals by designing an accurate model. In this sense, the stock market is analysed by the technical analysis of Japanese Candlestick, which is combined by the following meta heuristic algorithms: support vector machine (SVM), meta-heuristic algorithms, particle swarm optimization (PSO), imperialist competition algorithm (ICA) and genetic algorithm (GA).
Design/methodology/approach
In addition, among the developed algorithms, the most effective one is chosen to determine probable sell and buy signals. Moreover, the authors have proposed comparative results to validate the designed model in this study with the same basic models of three articles in the past. Hence, PSO is used as a classification method to search the solution space absolutelyand with the high speed of running. In terms of the second model, SVM and ICA are examined by the time. Where the ICA is an improver for the SVM parameters. Finally, in the third model, SVM and GA are studied, where GA acts as optimizer and feature selection agent.
Findings
Results have been indicated that, the prediction accuracy of all new models are high for only six days, however, with respect to the confusion matrixes results, it is understood that the SVM-GA and SVM-ICA models have correctly predicted more sell signals, and the SCM-PSO model has correctly predicted more buy signals. However, SVM-ICA has shown better performance than other models considering executing the implemented models.
Research limitations/implications
In this study, the authors to analyze the data the long length of time between the years 2013–2021, makes the input data analysis challenging. They must be changed with respect to the conditions.
Originality/value
In this study, two methods have been developed in a candlestick model, they are raw based and signal-based approaches which the hit rate is determined by the percentage of correct evaluations of the stock market for a 16-day period.
Details
Keywords
Mohammad Shahid, Zubair Ashraf, Mohd Shamim and Mohd Shamim Ansari
Optimum utilization of investments has always been considered one of the most crucial aspects of capital markets. Investment into various securities is the subject of portfolio…
Abstract
Purpose
Optimum utilization of investments has always been considered one of the most crucial aspects of capital markets. Investment into various securities is the subject of portfolio optimization intent to maximize return at minimum risk. In this series, a population-based evolutionary approach, stochastic fractal search (SFS), is derived from the natural growth phenomenon. This study aims to develop portfolio selection model using SFS approach to construct an efficient portfolio by optimizing the Sharpe ratio with risk budgeting constraints.
Design/methodology/approach
This paper proposes a constrained portfolio optimization model using the SFS approach with risk-budgeting constraints. SFS is an evolutionary method inspired by the natural growth process which has been modeled using the fractal theory. Experimental analysis has been conducted to determine the effectiveness of the proposed model by making comparisons with state-of-the-art from domain such as genetic algorithm, particle swarm optimization, simulated annealing and differential evolution. The real datasets of the Indian stock exchanges and datasets of global stock exchanges such as Nikkei 225, DAX 100, FTSE 100, Hang Seng31 and S&P 100 have been taken in the study.
Findings
The study confirms the better performance of the SFS model among its peers. Also, statistical analysis has been done using SPSS 20 to confirm the hypothesis developed in the experimental analysis.
Originality/value
In the recent past, researchers have already proposed a significant number of models to solve portfolio selection problems using the meta-heuristic approach. However, this is the first attempt to apply the SFS optimization approach to the problem.
Details
Keywords
Ali Kaveh and Ataollah Zaerreza
This paper aims to present a new multi-community meta-heuristic optimization algorithm, which is called shuffled shepherd optimization algorithm (SSOA). In this algorithm.
Abstract
Purpose
This paper aims to present a new multi-community meta-heuristic optimization algorithm, which is called shuffled shepherd optimization algorithm (SSOA). In this algorithm.
Design/methodology/approach
The agents are first separated into multi-communities and the optimization process is then performed mimicking the behavior of a shepherd in nature operating on each community.
Findings
A new multi-community meta-heuristic optimization algorithm called a shuffled shepherd optimization algorithm is developed in this paper and applied to some attractive examples.
Originality/value
A new metaheuristic is presented and tested with some classic benchmark problems and some attractive structures are optimized.
Details
Keywords
The purpose of this paper is to develop an effective and efficient approach to exploit meta‐heuristic in particle swarm optimization (PSO) for the job shop scheduling problem…
Abstract
Purpose
The purpose of this paper is to develop an effective and efficient approach to exploit meta‐heuristic in particle swarm optimization (PSO) for the job shop scheduling problem (JSP), a class of NP‐hard optimization problems. The approach is to be built on a PSO with multiple independent swarms. PSO was inspired by bird flocking and animal social behaviors. The particles operate collectively like a swarm that flies through the hyperdimensional space to search for possible optimal solutions. The behavior of the particles is influenced by their tendency to learn from their personal past experience and from the success of their peers to adjust their flying speed and direction. Research in fusing the multiple‐swarm concept into PSO is well‐established in solving single objective optimization problems and multimodal problems.
Design/methodology/approach
This study examines the optimization of the JSP via a search space division scheme and use of the meta‐heuristic method of PSO by assigning each machine in a JSP an independent swarm of particles. The use of multiple swarms in PSO is motivated by the idea of “divide and conquer” to reduce the computational complexity incurred through solving a NP‐hard combinatorial optimization problem. The resulted design, JSP/PSO algorithm, fully exploits the computing power presented by the multiple‐swarm PSO.
Findings
Simulation experiments show that the proposed JSP/PSO algorithm can effectively solve the JSP problems from small to median size. If certain mechanism of information sharing between swarms can be incorporated, it is believed that the new design could offer even more computing power to tackle the large‐sized problems.
Originality/value
The proposed JSP/PSO algorithm is effective in solving JSPs. The proposed algorithm shows considerable promise when searching the space of non‐delay schedules. It demands relatively lower number of function evaluations compared to other state‐of‐the‐art. The drawback to the JSP/PSO is that the GT scheduling adopted is too computationally expensive. Future works will address this concern.
Details