Search results
1 – 10 of 332Vaishali Rajput, Preeti Mulay and Chandrashekhar Madhavrao Mahajan
Nature’s evolution has shaped intelligent behaviors in creatures like insects and birds, inspiring the field of Swarm Intelligence. Researchers have developed bio-inspired…
Abstract
Purpose
Nature’s evolution has shaped intelligent behaviors in creatures like insects and birds, inspiring the field of Swarm Intelligence. Researchers have developed bio-inspired algorithms to address complex optimization problems efficiently. These algorithms strike a balance between computational efficiency and solution optimality, attracting significant attention across domains.
Design/methodology/approach
Bio-inspired optimization techniques for feature engineering and its applications are systematically reviewed with chief objective of assessing statistical influence and significance of “Bio-inspired optimization”-based computational models by referring to vast research literature published between year 2015 and 2022.
Findings
The Scopus and Web of Science databases were explored for review with focus on parameters such as country-wise publications, keyword occurrences and citations per year. Springer and IEEE emerge as the most creative publishers, with indicative prominent and superior journals, namely, PLoS ONE, Neural Computing and Applications, Lecture Notes in Computer Science and IEEE Transactions. The “National Natural Science Foundation” of China and the “Ministry of Electronics and Information Technology” of India lead in funding projects in this area. China, India and Germany stand out as leaders in publications related to bio-inspired algorithms for feature engineering research.
Originality/value
The review findings integrate various bio-inspired algorithm selection techniques over a diverse spectrum of optimization techniques. Anti colony optimization contributes to decentralized and cooperative search strategies, bee colony optimization (BCO) improves collaborative decision-making, particle swarm optimization leads to exploration-exploitation balance and bio-inspired algorithms offer a range of nature-inspired heuristics.
Details
Keywords
Pinar Kocabey Ciftci and Zeynep Didem Unutmaz Durmusoglu
This article proposes a novel hybrid simulation model for understanding the complex tobacco use behavior.
Abstract
Purpose
This article proposes a novel hybrid simulation model for understanding the complex tobacco use behavior.
Design/methodology/approach
The model is developed by embedding the concept of the multistage learning-based fuzzy cognitive map (FCM) into the agent-based model (ABM) in order to benefit from advantageous of each methodology. The ABM is used to represent individual level behaviors while the FCM is used as a decision support mechanism for individuals. In this study, socio-demographic characteristics of individuals, tobacco control policies, and social network effect are taken into account to reflect the current tobacco use system of Turkey. The effects of plain package and COVID-19 on tobacco use behaviors of individuals are also searched under different scenarios.
Findings
The findings indicate that the proposed model provides promising results for representing the mental models of agents. Besides, the scenario analyses help to observe the possible reactions of people to new conditions according to characteristics.
Originality/value
The proposed method combined ABM and FCM with a multi-stage learning phases for modeling a complex and dynamic social problem as close as real life. It is expected to contribute for both ABM and tobacco use literature.
Details
Keywords
Wenqi Mao, Kexin Ran, Ting-Kwei Wang, Anyuan Yu, Hongyue Lv and Jieh-Haur Chen
Although extensive research has been conducted on precast production, irregular component loading constraints have received little attention, resulting in limitations for…
Abstract
Purpose
Although extensive research has been conducted on precast production, irregular component loading constraints have received little attention, resulting in limitations for transportation cost optimization. Traditional irregular component loading methods are based on past performance, which frequently wastes vehicle space. Additionally, real-time road conditions, precast component assembly times, and delivery vehicle waiting times due to equipment constraints at the construction site affect transportation time and overall transportation costs. Therefore, this paper aims to provide an optimization model for Just-In-Time (JIT) delivery of precast components considering 3D loading constraints, real-time road conditions and assembly time.
Design/methodology/approach
In order to propose a JIT (just-in-time) delivery optimization model, the effects of the sizes of irregular precast components, the assembly time, and the loading methods are considered in the 3D loading constraint model. In addition, for JIT delivery, incorporating real-time road conditions in the transportation process is essential to mitigate delays in the delivery of precast components. The 3D precast component loading problem is solved by using a hybrid genetic algorithm which mixes the genetic algorithm and the simulated annealing algorithm.
Findings
A real case study was used to validate the JIT delivery optimization model. The results indicated this study contributes to the optimization of strategies for loading irregular precast components and the reduction of transportation costs by 5.38%.
Originality/value
This study establishes a JIT delivery optimization model with the aim of reducing transportation costs by considering 3D loading constraints, real-time road conditions and assembly time. The irregular precast component is simplified into 3D bounding box and loaded with three-space division heuristic packing algorithm. In addition, the hybrid algorithm mixing the genetic algorithm and the simulated annealing algorithm is to solve the 3D container loading problem, which provides both global search capability and the ability to perform local searching. The JIT delivery optimization model can provide decision-makers with a more comprehensive and economical strategy for loading and transporting irregular precast components.
Details
Keywords
Vu Hong Son Pham, Nguyen Thi Nha Trang and Chau Quang Dat
The paper aims to provide an efficient dispatching schedule for ready-mix concrete (RMC) trucks and create a balance between batch plants and construction sites.
Abstract
Purpose
The paper aims to provide an efficient dispatching schedule for ready-mix concrete (RMC) trucks and create a balance between batch plants and construction sites.
Design/methodology/approach
The paper focused on developing a new metaheuristic swarm intelligence algorithm using Java code. The paper used statistical criterion: mean, standard deviation, running time to verify the effectiveness of the proposed optimization method and compared its derivatives with other algorithms, such as genetic algorithm (GA), Tabu search (TS), bee colony optimization (BCO), ant lion optimizer (ALO), grey wolf optimizer (GWO), dragonfly algorithm (DA) and particle swarm optimization (PSO).
Findings
The paper proved that integrating GWO and DA yields better results than independent algorithms and some selected algorithms in the literature. It also suggests that multi-independent batch plants could effectively cooperate in a system to deliver RMC to various construction sites.
Originality/value
The paper provides a compelling new hybrid swarm intelligence algorithm and a model allowing multi-independent batch plants to work in a system to deliver RMC. It fulfills an identified need to study how batch plant managers can expand their dispatching network, increase their competitiveness and improve their supply chain operations.
Details
Keywords
Subhrapratim Nath, Jamuna Kanta Sing and Subir Kumar Sarkar
Advancement in optimization of VLSI circuits involves reduction in chip size from micrometer to nanometer level as well as fabrication of a billions of transistors in a single die…
Abstract
Purpose
Advancement in optimization of VLSI circuits involves reduction in chip size from micrometer to nanometer level as well as fabrication of a billions of transistors in a single die where global routing problem remains significant with a trade-off of power dissipation and interconnect delay. This paper aims to solve the increased complexity in VLSI chip by minimization of the wire length in VLSI circuits using a new approach based on nature-inspired meta-heuristic, invasive weed optimization (IWO). Further, this paper aims to achieve maximum circuit optimization using IWO hybridized with particle swarm optimization (PSO).
Design/methodology/approach
This paper projects the complexities of global routing process of VLSI circuit design in mapping it with a well-known NP-complete problem, the minimum rectilinear Steiner tree (MRST) problem. IWO meta-heuristic algorithm is proposed to meet the MRST problem more efficiently and thereby reducing the overall wire-length of interconnected nodes. Further, the proposed approach is hybridized with PSO, and a comparative analysis is performed with geosteiner 5.0.1 and existing PSO technique over minimization, consistency and convergence against available benchmark.
Findings
This paper provides high performance–enhanced IWO algorithm, which keeps in generating low MRST value, thereby successful wire length reduction of VLSI circuits is significantly achieved as evident from the experimental results as compared to PSO algorithm and also generates value nearer to geosteiner 5.0.1 benchmark. Even with big VLSI instances, hybrid IWO with PSO establishes its robustness over achieving improved optimization of overall wire length of VLSI circuits.
Practical implications
This paper includes implications in the areas of optimization of VLSI circuit design specifically in the arena of VLSI routing and the recent developments in routing optimization using meta-heuristic algorithms.
Originality/value
This paper fulfills an identified need to study optimization of VLSI circuits where minimization of overall interconnected wire length in global routing plays a significant role. Use of nature-based meta-heuristics in solving the global routing problem is projected to be an alternative approach other than conventional method.
Details
Keywords
Miao Ye, Lin Qiang Huang, Xiao Li Wang, Yong Wang, Qiu Xiang Jiang and Hong Bing Qiu
A cross-domain intelligent software-defined network (SDN) routing method based on a proposed multiagent deep reinforcement learning (MDRL) method is developed.
Abstract
Purpose
A cross-domain intelligent software-defined network (SDN) routing method based on a proposed multiagent deep reinforcement learning (MDRL) method is developed.
Design/methodology/approach
First, the network is divided into multiple subdomains managed by multiple local controllers, and the state information of each subdomain is flexibly obtained by the designed SDN multithreaded network measurement mechanism. Then, a cooperative communication module is designed to realize message transmission and message synchronization between the root and local controllers, and socket technology is used to ensure the reliability and stability of message transmission between multiple controllers to acquire global network state information in real time. Finally, after the optimal intradomain and interdomain routing paths are adaptively generated by the agents in the root and local controllers, a network traffic state prediction mechanism is designed to improve awareness of the cross-domain intelligent routing method and enable the generation of the optimal routing paths in the global network in real time.
Findings
Experimental results show that the proposed cross-domain intelligent routing method can significantly improve the network throughput and reduce the network delay and packet loss rate compared to those of the Dijkstra and open shortest path first (OSPF) routing methods.
Originality/value
Message transmission and message synchronization for multicontroller interdomain routing in SDN have long adaptation times and slow convergence speeds, coupled with the shortcomings of traditional interdomain routing methods, such as cumbersome configuration and inflexible acquisition of network state information. These drawbacks make it difficult to obtain global state information about the network, and the optimal routing decision cannot be made in real time, affecting network performance. This paper proposes a cross-domain intelligent SDN routing method based on a proposed MDRL method. First, the network is divided into multiple subdomains managed by multiple local controllers, and the state information of each subdomain is flexibly obtained by the designed SDN multithreaded network measurement mechanism. Then, a cooperative communication module is designed to realize message transmission and message synchronization between root and local controllers, and socket technology is used to ensure the reliability and stability of message transmission between multiple controllers to realize the real-time acquisition of global network state information. Finally, after the optimal intradomain and interdomain routing paths are adaptively generated by the agents in the root and local controllers, a prediction mechanism for the network traffic state is designed to improve awareness of the cross-domain intelligent routing method and enable the generation of the optimal routing paths in the global network in real time. Experimental results show that the proposed cross-domain intelligent routing method can significantly improve the network throughput and reduce the network delay and packet loss rate compared to those of the Dijkstra and OSPF routing methods.
Details
Keywords
Lin-Lin Xie, Yajiao Chen, Sisi Wu, Rui-Dong Chang and Yilong Han
Project scheduling plays an essential role in the implementation of a project due to the limitation of resources in practical projects. However, the existing research tend to…
Abstract
Purpose
Project scheduling plays an essential role in the implementation of a project due to the limitation of resources in practical projects. However, the existing research tend to focus on finding suitable algorithms to solve various scheduling problems and fail to find the potential scheduling rules in these optimal or near-optimal solutions, that is, the possible intrinsic relationships between attributes related to the scheduling of activity sequences. Data mining (DM) is used to analyze and interpret data to obtain valuable information stored in large-scale data. The goal of this paper is to use DM to discover scheduling concepts and obtain a set of rules that approximate effective solutions to resource-constrained project scheduling problems. These rules do not require any search and simulation, which have extremely low time complexity and support real-time decision-making to improve planning/scheduling.
Design/methodology/approach
The resource-constrained project scheduling problem can be described as scheduling a group of interrelated activities to optimize the project completion time and other objectives while satisfying the activity priority relationship and resource constraints. This paper proposes a new approach to solve the resource-constrained project scheduling problem by combining DM technology and the genetic algorithm (GA). More specifically, the GA is used to generate various optimal project scheduling schemes, after that C4.5 decision tree (DT) is adopted to obtain valuable knowledge from these schemes for further predicting and solving new scheduling problems.
Findings
In this study, the authors use GA and DM technology to analyze and extract knowledge from a large number of scheduling schemes, and determine the scheduling rule set to minimize the completion time. In order to verify the application effect of the proposed DT classification model, the J30, J60 and J120 datasets in PSPLIB are used to test the validity of the scheduling rules. The results show that DT can readily duplicate the excellent performance of GA for scheduling problems of different scales. In addition, the DT prediction model developed in this study is applied to a high-rise residential project consisting of 117 activities. The results show that compared with the completion time obtained by GA, the DT model can realize rapid adjustment of project scheduling problem to deal with the dynamic environment interference. In a word, the data-based approach is feasible, practical and effective. It not only captures the knowledge contained in the known optimal scheduling schemes, but also helps to provide a flexible scheduling decision-making approach for project implementation.
Originality/value
This paper proposes a novel knowledge-based project scheduling approach. In previous studies, intelligent optimization algorithm is often used to solve the project scheduling problem. However, although these intelligent optimization algorithms can generate a set of effective solutions for problem instances, they are unable to explain the process of decision-making, nor can they identify the characteristics of good scheduling decisions generated by the optimization process. Moreover, their calculation is slow and complex, which is not suitable for planning and scheduling complex projects. In this study, the set of effective solutions of problem instances is taken as the training dataset of DM algorithm, and the extracted scheduling rules can provide the prediction and solution of new scheduling problems. The proposed method focuses on identifying the key parameters of a specific dynamic scheduling environment, which can not only reproduces the scheduling performance of the original algorithm well, but also has the ability to make decisions quickly under the dynamic interference construction scenario. It is helpful for project managers to implement quick decisions in response to construction emergencies, which is of great practical significance for improving the flexibility and efficiency of construction projects.
Details
Keywords
Armin Mahmoodi, Leila Hashemi and Milad Jasemi
In this study, the central objective is to foresee stock market signals with the use of a proper structure to achieve the highest accuracy possible. For this purpose, three hybrid…
Abstract
Purpose
In this study, the central objective is to foresee stock market signals with the use of a proper structure to achieve the highest accuracy possible. For this purpose, three hybrid models have been developed for the stock markets which are a combination of support vector machine (SVM) with meta-heuristic algorithms of particle swarm optimization (PSO), imperialist competition algorithm (ICA) and genetic algorithm (GA).All the analyses are technical and are based on the Japanese candlestick model.
Design/methodology/approach
Further as per the results achieved, the most suitable algorithm is chosen to anticipate sell and buy signals. Moreover, the authors have compared the results of the designed model validations in this study with basic models in three articles conducted in the past years. Therefore, SVM is examined by PSO. It is used as a classification agent to search the problem-solving space precisely and at a faster pace. With regards to the second model, SVM and ICA are tested to stock market timing, in a way that ICA is used as an optimization agent for the SVM parameters. At last, in the third model, SVM and GA are studied, where GA acts as an optimizer and feature selection agent.
Findings
As per the results, it is observed that all new models can predict accurately for only 6 days; however, in comparison with the confusion matrix results, it is observed 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 data for stock market of the years 2013–2021 were analyzed; the long length of timeframe makes the input data analysis challenging as they must be moderated with respect to the conditions where they have been changed.
Originality/value
In this study, two methods have been developed in a candlestick model; they are raw-based and signal-based approaches in which the hit rate is determined by the percentage of correct evaluations of the stock market for a 16-day period.
Details
Keywords
Indranil Banik, Arup Kumar Nandi and Bittagopal Mondal
The paper aims to identify a suitable generic brake force distribution ratio (β) corresponding to optimal brake design attributes in a diminutive driving range, where road…
Abstract
Purpose
The paper aims to identify a suitable generic brake force distribution ratio (β) corresponding to optimal brake design attributes in a diminutive driving range, where road conditions do not exhibit excessive variations. This will intend for an appropriate allocation of brake force distribution (BFD) to provide dynamic stability to the vehicle during braking.
Design/methodology/approach
Two techniques are presented (with and without wheel slip) to satisfy both brake stability and performance while accommodating variations in load sharing and road friction coefficient. Based on parametric optimization of the design variables of hydraulic brake using evolutionary algorithm, taking into account both the laden and unladen circumstances simultaneously, this research develops an improved model for computing and simulating the BFD applied to commercial and passenger vehicles.
Findings
The optimal parameter values defining the braking system have been identified, resulting in effective β = 0.695 which enhances the brake forces at respective axles. Nominal slip of 3.42% is achieved with maximum deceleration of 5.72 m/s2 maintaining directional stability during braking. The results obtained from both the methodologies are juxtaposed and assessed governing the vehicle stability in straight line motion to prevent wheel lock.
Originality/value
Optimization results establish the practicality, efficacy and applicability of the proposed approaches. The findings provide valuable insights for the design and optimization of hydraulic drum brake systems in modern automobiles, which can lead to safer and more efficient braking systems.
Details
Keywords
Ö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