Search results

Optimization algorithms can differ in performance for a specific problem. Hybrid approaches, using this difference, might give a higher performance in many cases. This paper presents a hybrid approach of Genetic Algorithm (GA) and Ant Colony Optimization (ACO) specifically for the Integrated Process Planning and Scheduling (IPPS) problems. GA and ACO have given different performances in different cases of IPPS problems. In some cases, GA has outperformed, and so do ACO in other cases. This hybrid method can be constructed as (I) GA to improve ACO results or (II) ACO to improve GA results. Based on the performances of the algorithm pairs on the given problem scale. This proposed hybrid GA-ACO approach (hAG) runs both GA and ACO simultaneously, and the better performing one is selected as the primary algorithm in the hybrid approach. hAG also avoids convergence by resetting parameters which cause algorithms to converge local optimum points. Moreover, the algorithm can obtain more accurate solutions with avoidance strategy. The new hybrid optimization technique (hAG) merges a GA with a local search strategy based on the interior point method. The efficiency of hAG is demonstrated by solving a constrained multi-objective mathematical test-case. The benchmarking results of the experimental studies with AIS (Artificial Immune System), GA, and ACO indicate that the proposed model has outperformed other non-hybrid algorithms in different scenarios.

This study aims to determine whether, by means of the application of genetic algorithms (GA) through the traditional technical analysis (TA) using moving average convergence/divergence (MACD), is possible to achieve higher yields than those that would be obtained using technical analysis investment strategies following a traditional approach (TA) and the buy and hold (B&H) strategy.

The study was carried out based on the daily price records of the NASDAQ financial asset during 2013–2017. TA approach was carried out under graphical analysis applying the standard MACD. GA approach took place by chromosome encoding, fitness evaluation and genetic operators. Traditional genetic operators (i.e. crossover and mutation) were adopted as based on the chromosome customization and fitness evaluation. The chromosome encoding stage used MACD to represent the genes of each chromosome to encode the parameters of MACD in a chromosome. For each chromosome, buy and sell indexes of the strategy were considered. Fitness evaluation served to defining the evaluation strategy of the chromosomes in the population according to the fitness function using the returns gained in each chromosome.

The paper provides empirical-theoretical insights about the effectiveness of GA to overcome the investment strategies based on MACD and B&H by achieving 5 and 11% higher returns per year, respectively. GA-based approach was additionally capable of improving the return-to-risk ratio of the investment.

Limitations deal with the fact that the study was carried out on US markets conditions and data which hamper its application in some extend to markets with not as much development.

The findings suggest that not only skilled but also amateur investors may opt for investment strategies based on GA aiming at refining profitable financial signals to their advantage.

This paper looks at machine learning as an up-to-date tool with great potential for increasing effectiveness in profits when applied into TA investment approaches using MACD in well-developed stock markets.

Due to its boundless potential applications, Wireless Sensor Networks have been subject to much research in the last two decades. WSNs are often deployed in remote environments making replacement of batteries not feasible. Low energy consumption being of prime requisite led to the development of energy-efficient routing protocols. The proposed routing algorithms seek to prolong the lifetime of sensor nodes in the relatively unexplored area of 3D WSNs. The schemes use chain-based routing technique PEGASIS as basis and employ genetic algorithm to build the chain instead of the greedy algorithm. Proposed schemes will incorporate an energy and distance aware CH selection technique to improve load balancing. Clustering of the network is also implemented to reduce number of nodes in a chain and hence reduce delay. Simulation of our proposed protocols is carried out for homogeneous networks considering separately cases for a static base-station inside and outside the network. Results indicate considerable improvement in lifetime over PEGASIS of 817% and 420% for base station inside and outside the network respectively. Residual energy and delay performance are also considered.

The purpose of this paper is to implement a genetic algorithmic geared toward building an optimized investment portfolio exploring data set from stocks of firms listed on the Nigerian exchange market. To provide a research-driven guide toward portfolio business assessment and implementation for optimal risk-return.

The approach was to formulate the portfolio selection problem as a mathematical programming problem to optimize returns of portfolio; calculated by a Sharpe ratio. A genetic algorithm (GA) is then applied to solve the formulated model. The GA lead to an optimized portfolio, suggesting an effective asset allocation to achieve the optimized returns.

The approach enables an investor to take a calculated risk in selecting and investing in an investment portfolio best minimizes the risks and maximizes returns. The investor can make a sound investment decision based on expected returns suggested from the optimal portfolio.

The data used for the GA model building and implementation GA was limited to stock market prices. Thus, portfolio investment that which to combines another capital market instrument was used.

Investment managers can implement this GA method to solve the usual bottleneck in selecting or determining which stock to advise potential investors to invest in, and also advise on which capital sharing ratio to reduce risk and attain optimal portfolio-mix targeted at achieving an optimal return on investment.

The value proposition of this paper is due to its exhaustiveness in considering the very important measures in the selection of an optimal portfolio such as risk, liquidity ratio, returns, diversification and asset allocation.

Due to unceasing declination in environment, sustainable agro-food supply chains have become a topic of concern to business, government organizations and customers. The purpose of this study is to examine a problem associated with sustainable network design in context of Indian agro-food grain supply chain.

A mixed integer nonlinear programming (MINLP) model is suggested to apprehend the major complications related with two-echelon food grain supply chain along with sustainability aspects (carbon emissions). Genetic algorithm (GA) and quantum-based genetic algorithm (Q-GA), two meta-heuristic algorithms and LINGO 18 (traditional approach) are employed to establish the vehicle allocation and selection of orders set.

The model minimizes the total transportation cost and carbon emission tax in gathering food grains from farmers to the hubs and later to the selected demand points (warehouses). The simulated data are adopted to test and validate the suggested model. The computational experiments concede that the performance of LINGO is superior than meta-heuristic algorithms (GA and Q-GA) in terms of solution obtained, but there is trade-off with respect to computational time.

In literature, inadequate study has been perceived on defining environmental sustainable issues connected with agro-food supply chain from farmer to final distribution centers. A MINLP model has been formulated as practical scenario for central part of India that captures all the major complexities to make the system more efficient. This study is regulated to agro-food Indian industries.

The suggested network design problem is an innovative approach to design distribution systems from farmers to the hubs and later to the selected warehouses. This study considerably assists the organizations to design their distribution network more efficiently.

The purpose of this paper is to execute the efficiency analysis of the selected metaheuristic algorithms (MAs) based on the investigation of analytical functions and investigation optimization processes for permanent magnet motor.

A comparative performance analysis was conducted for selected MAs. Optimization calculations were performed for as follows: genetic algorithm (GA), particle swarm optimization algorithm (PSO), bat algorithm, cuckoo search algorithm (CS) and only best individual algorithm (OBI). All of the optimization algorithms were developed as computer scripts. Next, all optimization procedures were applied to search the optimal of the line-start permanent magnet synchronous by the use of the multi-objective objective function.

The research results show, that the best statistical efficiency (mean objective function and standard deviation [SD]) is obtained for PSO and CS algorithms. While the best results for several runs are obtained for PSO and GA. The type of the optimization algorithm should be selected taking into account the duration of the single optimization process. In the case of time-consuming processes, algorithms with low SD should be used.

The new proposed simple nondeterministic algorithm can be also applied for simple optimization calculations. On the basis of the presented simulation results, it is possible to determine the quality of the compared MAs.

The purpose of this paper is to maximize the total demand covered by the established additive manufacturing and distribution centers and maximize the total literal weight assigned to the drones.

Disaster management or humanitarian supply chains (HSCs) differ from commercial supply chains in the fact that the aim of HSCs is to minimize the response time to a disaster as compared to the profit maximization goal of commercial supply chains. In this paper, the authors develop a relief chain structure that accommodates emerging technologies in humanitarian logistics into the two phases of disaster management – the preparedness stage and the response stage.

Solving the model by the genetic and the cuckoo optimization algorithm (COA) and comparing the results with the ones obtained by The General Algebraic Modeling System (GAMS) clear that genetic algorithm overcomes other options as it has led to objective functions that are 1.6% and 24.1% better comparing to GAMS and COA, respectively.

Finally, the presented model has been solved with three methods including one exact method and two metaheuristic methods. Results of implementation show that Non-dominated sorting genetic algorithm II (NSGA-II) has better performance in finding the optimal solutions.

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).

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.

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.

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.

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.

More and more work zone projects come with the needs of new construction and regular maintenance-related investments in transportation. Work zone projects can have many significant impacts socially, economically and environmentally. Minimizing the total impacts of work zone projects by optimizing relevant schedules is extremely important. This study aims to analyze the impacts of scheduling long-term work zone activities.

Optimal scheduling of the starting dates of each work zone project is determined by developing and solving using a bi-level genetic algorithm (GA)–based optimization model. The upper level sub-model is to minimize the total travel delay caused by work zone projects over the entire planning horizon, whereas the lower level sub-model is a traffic assignment problem under user equilibrium condition with elastic demand.

Sioux Falls network is used to develop and test the proposed GA-based model. The average and minimum total travel delays (TTDs) over generations of the proposed GA algorithm decrease very rapidly during the first 20 generations of the GA algorithm; after the 20th generations, the solutions gradually level off with a certain level of variations in the average TTD, showing the capability of the proposed method of solving the multiple work zone starting date optimization problem.

The proposed model can effectively identify the near-optimal solution to the long-term work zone scheduling problem with elastic demand. Sensitivity analysis of the impact of the elastic demand parameter is also conducted to show the importance of considering the impact of elastic demand parameter.

It would take billions of miles’ field road testing to demonstrate that the safety of automated vehicle is statistically significantly higher than the safety of human driving because that the accident of vehicle is rare event.

This paper proposes an accelerated testing method for automated vehicles safety evaluation based on improved importance sampling (IS) techniques. Taking the typical cut-in scenario as example, the proposed method extracts the critical variables of the scenario. Then, the distributions of critical variables are statistically fitted. The genetic algorithm is used to calculate the optimal IS parameters by solving an optimization problem. Considering the error of distribution fitting, the result is modified so that it can accurately reveal the safety benefits of automated vehicles in the real world.

Based on the naturalistic driving data in Shanghai, the proposed method is validated by simulation. The result shows that compared with the existing methods, the proposed method improves the test efficiency by 35 per cent, and the accuracy of accelerated test result is increased by 23 per cent.

This paper has three contributions. First, the genetic algorithm is used to calculate IS parameters, which improves the efficiency of test. Second, the result of test is modified by the error correction parameter, which improves the accuracy of test result. Third, typical high-risk cut-in scenarios in China are analyzed, and the proposed method is validated by simulation.