Search

The case studies are introduced in this study, highlighting freight transportation via road and road rail between satellite cities in Pakistan's Punjab and Sindh provinces. The case study analysis contributes to developing environmentally friendly and cost-effective transportation solutions and reducing nitrous oxide (N2O) and carbon dioxide (CO2) emissions associated with road and intermodal freight transit. We developed a mixed-integer linear programming (MILP) model to formulate the bi-objective problem, including real-life constraints, emissions at starting nodes, ending notes, and between the arc. In the mathematical model, the cost and emissions functions are developed to minimize the primary and secondary objective functions in the road and intermodal transportation. Furthermore, five distinct sets (locations, starting stations, ending stations, transport orders, and transport service) with parameters relating to container movement between the starting and ending nodes are a necessary part of the MILP formulation. The multiobjective optimization problem is solved by metaheuristic techniques such as the multiobjective genetic algorithm as the goal of applying a metaheuristic algorithm is to find the search space to search the near to optimized solutions. The Pareto front solutions are provided for balancing the costs and emissions of transporting supplies from Punjab to Sindh using the MATLAB solver toolbox. We gathered data from one of Pakistan's most well-known logistics service providers in the paper industry. According to the findings, intermodal transportation is 72% more cost-effective than road transportation. Additionally, by substituting intermodal transportation for road transportation, N2O, and CO2 emissions can be reduced by 74% and 57%, respectively. [ABSTRACT FROM AUTHOR]

Ant-inspired metaheuristic algorithms known as ant colony optimization (ACO) offer an approach that has the ability to solve complex problems in both discrete and continuous domains. ACOs have gained significant attention in the field of water resources management, since many problems in this domain are non-linear, complex, challenging and also demand reliable solutions. The aim of this study is to critically review the applications of ACO algorithms specifically in the field of hydrology and hydrogeology, which include areas such as reservoir operations, water distribution systems, coastal aquifer management, long-term groundwater monitoring, hydraulic parameter estimation, and urban drainage and storm network design. Research articles, peer-reviewed journal papers and conference papers on ACO were critically analyzed to identify the arguments and research findings to delineate the scope for future research and to identify the drawbacks of ACO. Implementation of ACO variants is also discussed, as hybrid and modified ACO techniques prove to be more efficient over traditional ACO algorithms. These algorithms facilitate formulation of near-optimal solutions, and they also help improve cost efficiency. Although many studies are attempting to overcome the difficulties faced in the application of ACO, some parts of the mathematical analysis remain unsolved. It is also observed that despite its popularity, studies have not been successful in incorporating the uncertainty in ACOs and the problems of dimensionality, convergence and stability are yet to be resolved. Nevertheless, ACO is a potential area for further research as the studies on the applications of these techniques are few. [ABSTRACT FROM AUTHOR]

Due to the complexity and the magnitude of optimisation models that appeared in sustainable supply chain management (SSCM), the use of meta-heuristic algorithms as competent solution approaches is being increased in recent years. Although a massive number of publications exist around SSCM, no extant paper explicitly investigates the role of meta-heuristics in the sustainable (forward) supply chain. To fill this gap, a literature review is provided on meta-heuristic algorithms applied in SSCM by analyzing 160 rigorously selected papers published by the end of 2020. Our statistical analysis ascertains a considerable growth in the number of papers in recent years and reveals the contribution of 50 journals in forming the extant literature. The results also show that in the current literature the use of hybrid meta-heuristics is overtaking pure meta-heuristics, the genetic algorithm (GA) and the non-dominated sorting GA (NSGA-II) are the most-used single- and multi-objective algorithms, the aspects of sustainability are mostly addressed in connection with product distribution and routing of vehicles as pivotal operations in supply chain management, and last but not least, the economic-environmental category of sustainability has been further noticed by the scholars. Finally, a detailed discussion of findings and recommendations for future research are provided. [ABSTRACT FROM AUTHOR]

This document is an editorial for a special issue of the journal AIMS Mathematics on the topic of discrete optimization. The issue includes 21 papers covering a range of subjects, including molecular trees, network systems, variational inequality problems, scheduling, image restoration, spectral clustering, integral equations, convex functions, graph products, optimization algorithms, air quality prediction, humanitarian planning, inertial methods, neural networks, transportation problems, emotion identification, fixed-point problems, structural engineering design, single machine scheduling, and ensemble learning. The papers present new theoretical results, algorithms, and applications in these areas. The guest editor expresses gratitude to the journal staff and reviewers and hopes that readers will find inspiration for their own research. [Extracted from the article]

Particle swarm optimization algorithms (PSOA) is a metaheuristic algorithm used to optimize computational problems using candidate solutions or particles based on selected quality measures. Despite the extensive research published, studies that critically examine its recent scientific developments and research impact are lacking. Therefore, the publication trends and research landscape on PSOA research were examined. The Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) and bibliometric analysis techniques were applied to identify and analyze the published documents indexed in Scopus from 2001 to 2021. The published documents on PSOA increased from 8 to 1,717 (21,362.50%) due to the growing applications of PSOA in solving computational problems. "Conference papers" is the most common document type, whereas the most prolific researcher on PSOA is Andries P. Engelbrecht (South Africa). The most active affiliation (Ministry of Education) and funding organization (National Natural Science Foundation) are based in China. The research landscape on PSOA revealed high levels of publications, citations, and collaborations among the top authors, institutions, and countries worldwide. Keywords co-occurrence analysis revealed that "particle swarm optimization (PSO)" occurred more frequently than others. The findings of the study could provide researchers and policymakers with insights into the prospects and challenges of PSOA research relative to similar algorithms in the literature. [ABSTRACT FROM AUTHOR]

Nature-Inspired Metaheuristics (NIM) have emerged as a potent tool for solving complex and difficult optimization problems, arising in various industries, which otherwise become quite difficult (if not impossible) to solve by the classical methods based on gradient search. Further, NIM techniques are more likely to obtain a global optimal solution, often desired and sometimes a necessity in several real life situations. In this study we employ SABC, a variant of Artificial Bee Colony (ABC), a relatively newer NIM algorithm, for solving four typical processes of a paper mill where optimization can be applied. We have also considered two chemical process problems that can be related to paper industry. Numerical results show that the proposed SABC scheme is efficient in dealing with these problems. [ABSTRACT FROM AUTHOR]

The second paper, authored by M. Kara, A. Laouid, M. AlShaikh, M. Hammoudeh, A. Bounceur, R. Euler, A. Amamra, and B. Laouid proposed a multi-round Proof of Work (PoW) consensus algorithm for preserving energy consumption and resisting attacks [[9]]. Special Features on AMC The most commonly seen AMC algorithms include genetic algorithm (GA), genetic programming (GP), evolutionary strategy (ES), evolutionary programming (EP), memetic algorithm (MA), particle swarm optimization (PSO), ant colony optimization (ACO), artificial bee colony (ABC), differential evolution (DE), firefly algorithm (FA), simulated annealing (SA), tabu search (TS), scatter search (SS), variable neighborhood search (VNS), and GRASP, to name a few. The first paper, authored by J. Chou, T. Pham, and C. Ho, developed a metaheuristic-optimized machine-learning algorithm for multi-level classification in civil and construction engineering [[1]]. The adaptive shrinking grid search chaos wolf optimization algorithm was proposed to optimize the parameters of the neural network to enhance the image recognition accuracy. [Extracted from the article]

Experimental results on five public gene expression profile datasets verify that the proposed algorithm outperforms other methods in terms of diversity, distribution stability, and quality of generated samples. The fifth paper by I Tingyu Ye i et al. on "Artificial bee colony algorithm with an adaptive search manner and dimension perturbation" proposes a modified artificial bee colony (ABC) algorithm with an adaptive search manner and dimension perturbation (ASDABC). The tenth paper by I Fei Han i et al. on "Gene-CWGAN: A Data Enhancement Method for Gene Expression Profile Based on Improved CWGAN-GP" tackles the problem of high dimension and small sample size of gene expression profile data classification. [Extracted from the article]

Stope layout optimisation is an important sub-problem of the generic underground mining optimisation problem that contributes towards optimal ore extraction. It is a growing research area as some surface mines transition from open-pit to underground mining. Several researchers acknowledge the complexity of optimising underground mine layouts because exact methods are limited in generating three-dimensional optimal solutions, hence the growing use of metaheuristic approaches to solve the problem in three dimensions. This paper presents a PRISMA-based bibliometric mapping of stope layout optimisation approaches using R-Biblioshiny and VOSviewer software, their concomitant limitations, and suggests potential future research directions in stope layout optimisation. [ABSTRACT FROM AUTHOR]

The paper [[10]] considers an assignment problem and some modifications which can be converted to routing, distribution, or scheduling problems. This special issue of I Algorithms i is dedicated to recent developments of scheduling algorithms and new applications. References 1 Werner F., Burtseva L., Sotskov Y. Special Issue on Algorithms for Scheduling Problems. For this problem, a hybrid metaheuristic algorithm is presented which combines a genetic algorithm with a so-called spotted hyena optimization algorithm. [Extracted from the article]

During the optimization process, a large number of data are generated through the search. Machine learning techniques and algorithms can be used to handle the generated data to contribute to the optimization process. The use of machine learning enhancing metaheuristics applied to optimization problems has been drawing attention due to their capacity to add domain knowledge during the search process. This knowledge can accelerate metaheuristics and lead to better and promising solutions. This work provides a systematic literature review of machine learning enhancing metaheuristics and summarizes the current state of the classification of the research field, main techniques and machine learning models, validations strategies, and real-world optimization problems that the approach was applied. Our keyword search found 1.960 papers, published in the last 10 years. After considering the inclusion and exclusion criteria and performing backward snowballing procedure, we have analyzed 111 primary studies. The results show the predominance of the use of surrogate-assisted evolutionary algorithms (SAEAs) for improving the efficiency of the optimization, and the use of estimation of distribution algorithms (EDAs) to increase the effectiveness of the optimization. The objective function value is the mostly applied evaluating criteria to validate the algorithm with other methods. The developed techniques of the studies found are applied in diverse real-world applications such as developing machine learning models, physics simulations with expensive function evaluation, and the variants of the classical job shop scheduling problem. We also discuss trends and opportunities of the research field. [ABSTRACT FROM AUTHOR]

Advent of distributed generation and progression towards an intelligent grid infrastructure within the domain of contemporary electrical power systems have created dynamic load profiles. Accompanying these developments, protective relays are faced with an evolving electrical load landscape and variable fault current conditions, resulting in disparate operational timings throughout the diurnal cycle. In light of these challenges, this paper delineates the formulation and simulation of a novel adaptive protection strategy for overcurrent relays, meticulously tailored to accommodate the fluctuations in electrical load. To construct a robust framework for this adaptive mechanism, a series of hypothetical fault current scenarios are meticulously crafted to activate the relays within the briefest time interval feasible. Further innovating within this sphere, this paper introduces a new hybrid algorithm, deftly amalgamating the strengths of three preeminent metaheuristic models: Improved Harmony Search, Particle Swarm Optimization, and Differential Evolution. Simulations and analyses substantiate the efficacy of the algorithm in optimizing the coordination among overcurrent relays aiming to uphold the overarching protective imperatives of the grid. For the IEEE 6‐bus system, the mean value of the objective function during 24 h in Monte Carlo is 292.6607 and very close to 272.0758 in the simulation of eight stochastic scenarios, which contributes to the validity of the approach in practical settings. Also, in the IEEE 30‐bus system, the results of the mean relay operation time set for the hours with the lowest and highest consumption load are 17.1297 and 14.8049 s, which reveals the increase in the operation speed of the relays. [ABSTRACT FROM AUTHOR]

The first goal of this paper is to obtain the optimal models of nonlinear processes represented by vertical three)tank systems. This paper also presents the design of optimal sliding mode and super-twisting sliding mode controllers employed for controlling the liquid level in the first tank of the vertical three-tank systems. An optimization problem is defined in order to ideally minimize and practically reduce the differences between the outputs of the laboratory equipment for real-time experiments and the outputs of the nonlinear models. Therefore, the parameters of the nonlinear models and of the proposed controllers are optimally tuned using a recent metaheuristic optimization algorithm, namely the Grey Wolf Optimizer (GWO), which solves six optimization problems. The objective functions are defined as the sums of the squared control errors, and they are solved in the iteration domain by also using a GWO algorithm. Comparative analyses of the responses of the laboratory equipment for real-time experiments and of the derived optimal nonlinear models are carried out in various simulation scenarios. The control structures are also validated through simulations and real-time experiments. The simulation and the experimental results prove that the performance of the control systems improves after ten iterations of the GWO algorithms. [ABSTRACT FROM AUTHOR]

This paper provides a recent overview of the exact, approximate, and hybrid optimization methods that handle Multi-Objective Mixed-Integer Non-Linear Programming (MO-MINLP) problems. Both the domains of exact and approximate research have experienced significant growth, driven by their shared goal of addressing a wide range of real-world problems. This work presents a comprehensive literature review that highlights the significant theoretical contributions in the field of hybrid approaches between these research areas. We also point out possible research gaps in the literature. Hence, the main research questions to be answered in this paper involve the following: (1) how to exactly or approximately solve a MO-MINLP problem? (2) What are the drawbacks of exact methods as well as approximate methods? (3) What are the research lines that are currently underway to enhance the performances of these methods? and (4) Where are the research gaps in this field? This work aims to provide enough descriptive information for newcomers in this area about the research that has been carried out and that is currently underway concerning exact, approximate, and hybrid methods used to solve MO-MINLP problems. [ABSTRACT FROM AUTHOR]

The real world data are complex in nature and addition to that a large number of features add more value to the complexity. However, the features associated with the data may be redundant and erroneous in nature. To deal with such type of features, feature selection plays a vital role in computational learning. The reduction in the dimensionality of the dataset not only reduces the computational time required for classification but also enhances the classification accuracy by removing the misleading features. This paper presents a Filter Approach using Elitism based Multi-objective Differential Evolution algorithm for feature selection (FAEMODE) and the novelty lies in the objective formulation, where both linear and nonlinear dependency among features have been considered to handle the redundant and unwanted features of a dataset. Finally, the selected feature subsets of 23 benchmark datasets are tested using 10-fold cross validation with four well-known classifiers to endorse the result. A comparative analysis of the proposed approach with seven filter approaches and two conventional as well as three metaheuristic based wrapper approaches have been carried out for validation. The result reveals that the proposed approach can be considered as a powerful filter method for feature selection in various fields. [ABSTRACT FROM AUTHOR]

Ship maintenance service optimisation is of great significance for improving the competitiveness of shipbuilding enterprises. In this paper, we investigate a ship maintenance service scheduling problem considering the deteriorating maintenance time, distributed maintenance tasks, and limited maintenance teams. The objective is to minimise the service span. First, we construct an initial mixed-integer programming model for the studied problem. Then, through the property analysis of the problem with a single maintenance team, an exact scheduling algorithm is proposed. In addition, the lower bound of the problem with multiple maintenance teams is derived. A scheduled rule is developed to obtain the lower bound for the problem. Based on the property analysis, the original mixed-integer programming model is simplified to an improved mathematical programming model. Since the studied problem is NP-hard, this paper proposes two heuristic algorithms and an integrated metaheuristic algorithm based on the variable neighbourhood search to obtain approximate optimal solutions in a reasonable time. In computational experiments, the two models can solve problems on small scale, while metaheuristics can find approximately optimal solutions in each problem category. Moreover, the computational results validate the performance of the proposed integrated metaheuristic in terms of convergence and stability. [ABSTRACT FROM AUTHOR]

A multi-modal search space can be defined as having multiple attraction basins - each basin has a single local optimum which is reached from all points in that basin when greedy local search is used. Optimization in multi-modal search spaces can then be viewed as a two-phase process. The first phase is exploration in which the most promising attraction basin is identified. The second phase is exploitation in which the best solution (i.e. the local optimum) within the previously identified attraction basin is attained. The goal of thresheld convergence is to improve the performance of search techniques during the first phase of exploration. The effectiveness of thresheld convergence has been demonstrated through applications to existing metaheuristics such as particle swarm optimization and differential evolution, and through the development of novel metaheuristics such as minimum population search and leaders and followers. [ABSTRACT FROM AUTHOR]

Lightning strikes can cause equipment damage and power outages, so the distribution system's reliability in withstanding lightning strikes is crucial. This research paper presents a model that aims to optimise the configuration of a lightning protection system (LPS) in the power distribution system and minimise the System Average Interruption Frequency Index (SAIFI), a measure of reliability, and the associated cost investment. The proposed lightning electromagnetic transient model considers LPS factors such as feeder shielding, grounding design, and soil types, which affect critical current, flashover rates, SAIFI, and cost. A metaheuristic algorithm, PSOGSA, is used to obtain the optimal solution. The paper's main contribution is exploring grounding schemes and soil resistivity's impact on SAIFI. Using 4 grounding rods arranged in a straight line under the soil with 10 Ωm resistivity reduces grounding resistance and decreases SAIFI from 3.783 int./yr (no LPS) to 0.146 int./yr. Unshielded LPS has no significant effect on critical current for soil resistivity. Four test cases with different cost investments are considered, and numerical simulations are conducted. Shielded LPSs are more sensitive to grounding topologies and soil resistivities, wherein higher investment, with 10 Ωm soil resistivity, SAIFI decreases the most by 73.34%. In contrast, SAIFIs for 1 kΩm and 10 kΩm soil resistivities show minor decreases compared to SAIFIs with no LPS. The study emphasises the importance of considering soil resistivity and investment cost when selecting the optimal LPS configuration for distribution systems, as well as the significance of LPS selection in reducing interruptions to customers. [ABSTRACT FROM AUTHOR]

There are many issues and problems in cloud computing that researchers try to solve by using different techniques. Most of the cloud challenges are NP-hard problems; therefore, many meta-heuristic techniques have been used for solving these challenges. As a famous and powerful meta-heuristic algorithm, the Ant Colony Optimisation (ACO) algorithm has been recently used for solving many challenges in the cloud. However, in spite of the ACO potency for solving optimisation problems, its application in solving cloud issues in the form of a review article has not been studied so far. Therefore, this paper provides a complete and detailed study of the different types of ACO algorithms for solving the important problems and issues in cloud computing. Also, the number of published papers for various publishers and different years is shown. In this paper, available challenges are classified into different groups, including scheduling, resource allocation, load balancing, consolidation, virtual machine placement, service composition, energy consumption, and replication. Then, some of the selected important techniques from each category by applying the selection process are presented. Besides, this study shows the comparison of the reviewed approaches and also it highlights their principal elements. Finally, it highlights the relevant open issues and some clues to explain the difficulties. The results revealed that there are still some challenges in the cloud environments that the ACO is not applied to solve. [ABSTRACT FROM AUTHOR]

The article focuses on the fourth issue of the Publisher in 2023, featuring 10 papers from various countries. Topics include enhanced ultrasound classification of microemboli using convolutional neural networks, a hybrid metaheuristic optimization algorithm for global optimization and data classification, and a novel tolerance-based moderator-guided heterogeneous group decision-making involving experts and end-users.

Over the past decade, solving complex optimization problems with metaheuristic algorithms has attracted many experts and researchers. Nature has always been a model for humans to draw the best mechanisms and the best engineering out of it and use it to solve their problems. The concept of optimization is evident in several natural processes, such as the evolution of species, the behavior of social groups, the immune system, and the search strategies of various animal populations. For this purpose, the use of nature-inspired optimization algorithms is increasingly being developed to solve various scientific and engineering problems due to their simplicity and flexibility. Anything in a particular situation can solve a significant problem for human society. This paper presents a comprehensive overview of the metaheuristic algorithms and classifications in this field and offers a novel classification based on the features of these algorithms. [ABSTRACT FROM AUTHOR]

Ant Colony Optimization (ACO) is a powerful metaheuristic algorithm widely used to solve complex optimization problems in production and logistics. This paper presents a methodology for enhancing the ACO performance when applied to Traveling Salesman Problems (TSP). By reducing the number of ants in the colony, the algorithm's computational speed improves but solution quality is sacrificed. An optimal number of ants to produce the best results in the shortest time is specific to the problem at hand and can't be defined generally. This paper investigates the effect of ant population reduction relative to the problem size by measuring its impact on solution quality and execution time. Results show that for certain problem sizes ant population and execution time can be halved with practically no reduction in solution quality, or they can be reduced 5 times at the price of slightly worse solution quality. Reduction of ant population is much more impactful on reduction of execution time than it is on solution quality. [ABSTRACT FROM AUTHOR]

This paper carries out the performance analysis of three control system structures and approaches, which combine Reinforcement Learning (RL) and Metaheuristic Algorithms (MAs) as representative optimization algorithms. In the first approach, the Gravitational Search Algorithm (GSA) is employed to initialize the parameters (weights and biases) of the Neural Networks (NNs) involved in Deep QLearning by replacing the traditional way of initializing the NNs based on random generated values. In the second approach, the Grey Wolf Optimizer (GWO) algorithm is employed to train the policy NN in Policy Iteration RL-based control. In the third approach, the GWO algorithm is employed as a critic in an Actor-Critic framework, and used to evaluate the performance of the actor NN. The goal of this paper is to analyze all three RL-based control approaches, aiming to determine which one represents the best fit for solving the proposed control optimization problem. The performance analysis is based on non-parametric statistical tests conducted on the data obtained from real-time experimental results specific to nonlinear servo system position control. [ABSTRACT FROM AUTHOR]

As the number and cleverness of cyber-attacks keep increasing rapidly, it's more important than ever to have good ways to detect and prevent them. Recognizing cyber threats quickly and accurately is crucial because they can cause severe damage to individuals and businesses. This paper takes a close look at how we can use artificial intelligence (AI), including machine learning (ML) and deep learning (DL), alongside metaheuristic algorithms to detect cyber-attacks better. We've thoroughly examined over sixty recent studies to measure how effective these AI tools are at identifying and fighting a wide range of cyber threats. Our research includes a diverse array of cyberattacks such as malware attacks, network intrusions, spam, and others, showing that ML and DL methods, together with metaheuristic algorithms, significantly improve how well we can find and respond to cyber threats. We compare these AI methods to find out what they're good at and where they could improve, especially as we face new and changing cyber-attacks. This paper presents a straightforward framework for assessing AI Methods in cyber threat detection. Given the increasing complexity of cyber threats, enhancing AI methods and regularly ensuring strong protection is critical. We evaluate the effectiveness and the limitations of current ML and DL proposed models, in addition to the metaheuristic algorithms. Recognizing these limitations is vital for guiding future enhancements. We're pushing for smart and flexible solutions that can adapt to new challenges. The findings from our research suggest that the future of protecting against cyber-attacks will rely on continuously updating AI methods to stay ahead of hackers' latest tricks. [ABSTRACT FROM AUTHOR]

Intelligent scheduling of knitting workshops is the key to realizing knitting intelligent manufacturing. In view of the uncertainty of the workshop environment, it is difficult for existing scheduling algorithms to flexibly adjust scheduling strategies. This paper proposes a scheduling algorithm architecture based on deep reinforcement learning (DRL). First, the scheduling problem of knitting intelligent workshops is represented by a disjunctive graph, and a mathematical model is established. Then, a multi-proximal strategy (multi-PPO) optimization training algorithm is designed to obtain the optimal strategy, and the job selection strategy and machine selection strategy are trained at the same time. Finally, a knitting intelligent workshop scheduling experimental platform is built, and the algorithm proposed in this paper is compared with common heuristic rules and metaheuristic algorithms for experimental testing. The results show that the algorithm proposed in this paper is superior to heuristic rules in solving the knitting workshop scheduling problem, and can achieve the accuracy of the metaheuristic algorithm. In addition, the response speed of the algorithm in this paper is excellent, which meets the production scheduling needs of knitting intelligent workshops and has a good guiding significance for promoting knitting intelligent manufacturing. [ABSTRACT FROM AUTHOR]

In this paper, we present an improved imperialist competitive algorithm for solving an inverse form of the Huxley equation, which is a nonlinear partial differential equation. To show the effectiveness of our proposed algorithm, we conduct a comparative analysis with the original imperialist competitive algorithm and a genetic algorithm. The improvement suggested in this study makes the original imperialist competitive algorithm a more powerful method for function approximation. The numerical results show that the improved imperialist competitive algorithm is an efficient algorithm for determining the unknown boundary conditions of the Huxley equation and solving the inverse form of nonlinear partial differential equations. [ABSTRACT FROM AUTHOR]

Vehicle-to-grid (V2G) systems play a key role in the integration of electric vehicles (EVs) into smart grids by enabling bidirectional energy flows between EVs and the grid. Optimizing V2G operations poses significant challenges due to the dynamic nature of energy demand, grid constraints, and user preferences. This paper addresses the optimization challenges in V2G systems and explores the use of artificial intelligence (AI) methods to tackle these challenges. The paper provides a comprehensive analysis of existing work on optimization in V2G systems and identifies gaps where AI-driven algorithms, machine learning, metaheuristic extensions, and agile optimization concepts can be applied. Case studies and examples demonstrate the efficacy of AI-driven algorithms in optimizing V2G operations, leading to improved grid stability, cost optimization, and user satisfaction. Furthermore, agile optimization concepts are introduced to enhance flexibility and responsiveness in V2G optimization. The paper concludes with a discussion on the challenges and future directions for integrating AI-driven methods into V2G systems, highlighting the potential for these intelligent algorithms and methods. [ABSTRACT FROM AUTHOR]

The flying foxes optimization (FFO) algorithm, as a newly introduced metaheuristic algorithm, is inspired by the survival tactics of flying foxes in heat wave environments. FFO preferentially selects the best-performing individuals. This tendency will cause the newly generated solution to remain closely tied to the candidate optimal in the search area. To address this issue, the paper introduces an opposition-based learning-based search mechanism for FFO algorithm (IFFO). Firstly, this paper introduces niching techniques to improve the survival list method, which not only focuses on the adaptability of individuals but also considers the population's crowding degree to enhance the global search capability. Secondly, an initialization strategy of opposition-based learning is used to perturb the initial population and elevate its quality. Finally, to verify the superiority of the improved search mechanism, IFFO, FFO and the cutting-edge metaheuristic algorithms are compared and analyzed using a set of test functions. The results prove that compared with other algorithms, IFFO is characterized by its rapid convergence, precise results and robust stability. [ABSTRACT FROM AUTHOR]

The prediction of the ultimate bearing capacity (UBC) of composite foundations represents a critical application of test monitoring data within the field of intelligent geotechnical engineering. This paper introduces an effective combinational prediction algorithm, namely SA-IRMO-BP. By integrating the Improved Radial Movement Optimization (IRMO) algorithm with the simulated annealing (SA) algorithm, we develop a meta-heuristic optimization algorithm (SA-IRMO) to optimize the built-in weights and thresholds of backpropagation neural networks (BPNN). Leveraging this integrated prediction algorithm, we forecast the UBC of soil–cement mixed (SCM) pile composite foundations, yielding the following performance metrics: RMSE = 3.4626, MAE = 2.2712, R = 0.9978, VAF = 99.4339. These metrics substantiate the superior predictive performance of the proposed model. Furthermore, we utilize two distinct datasets to validate the generalizability of the prediction model presented herein, which carries significant implications for the safety and stability of civil engineering projects. [ABSTRACT FROM AUTHOR]

Many companies prefer to use third party logistics firms to deliver their goods and as such planning the return of the vehicles to the depot is not required. This is called open vehicle routing problem (OVRP). In literature, the OVRP is handled with minimum distance as objective function like vehicle routing problem. But in the real world, the objective function achieves minimum many costs like standard routing cost, stopping by cost and the deviation cost. The standard routes are previously defined under free market conditions by third party logistic firms. The deviation from the standard route is required to arrive cities which are not on the standard route. The stop by cost occurs on the delivery points. In this paper mentioned three costs are considered in the objective function while many papers consider only distance related costs in the literature. This paper proposes a new mathematical model for the OVRP. In the constraints, the last points of the routes are researched in detail. The standard route costs are determined by considering the last point of the route. Because of the NP-hard structure of the OVRP, the proposed mathematical model is solved with a hybrid metaheuristic called Civilized Genetic Algorithm (CGA). CGA is developed by hybridizing a modified genetic algorithm and a local search algorithm. The application of this study is implemented for the delivery routing of a combi boiler producer in Turkey. The third party logistic firms may use this proposed model and the solution approach for the real life applications. [ABSTRACT FROM AUTHOR]

For managing data redundancy, the proposed Intelligent Data Fusion Technique (IDFT) decreases the quantity of transmitting data, broadens the network life cycle, enhances bandwidth utilization, and therefore resolves the energy and bandwidth usage bottleneck. Over the last five decades, fuzzy optimization has found numerous successful applications in diverse fields including operations research, manufacturing, information technology, energy optimization, data science and smart cities, big data analytics, etc. Fuzzy optimization is one kind of approximation of nonlinear optimization techniques, which has formed some systematic but not unified theories of fuzzy systems and other fuzzy-set-based methodologies. [Extracted from the article]

Cloud computing delivers computing resources like software and hardware as a service to the users through a network. Due to the scale of the modern datacentres and their dynamic resources provisioning nature, we need efficient scheduling techniques to manage these resources. The main objective of scheduling is to assign tasks to adequate resources in order to achieve one or more optimization criteria. Scheduling is a challenging issue in the cloud environment, therefore many researchers have attempted to explore an optimal solution for task scheduling in the cloud environment. They have shown that traditional scheduling is not efficient in solving this problem and produce an optimal solution with polynomial time in the cloud environment. However, they introduced sub-optimal solutions within a short period of time. Meta-heuristic techniques have provided near-optimal or optimal solutions within an acceptable time for such problems. In this work, we have introduced the major concepts of resource scheduling and provided a comparative analysis of many task scheduling techniques based on different optimization criteria. [ABSTRACT FROM AUTHOR]

In the paper, I Traffic flow guidance algorithm in intelligent transportation systems considering the effect of non i - I floating vehicle i , Chen et al. ([4]) present the method of estimating non-floating vehicles' driving information according to floating vehicles' information. The authors presented the estimation method, a new traffic flow guidance algorithm, Estimated Weighted Vehicle Density Feedback Strategy (EWVDFS) based on Weighted Vehicle Density Feedback Strategy (WVDFS). In the paper, A I robust lane detection method based on hyperbolic model i , Li et al. ([9]) investigated a robust lane detection method under structured roads. The paper I Road network i - I based region of interest mining and social relationship recommendation i by Tan and Zhang ([17]) proposed road context-based active region extraction algorithm (RAREA) which explores the method to extract the specific regions within the road network. [Extracted from the article]

Flexible job shop scheduling problem (FJSP) is the core decision-making problem of intelligent manufacturing production management. The Harris hawk optimization (HHO) algorithm, as a typical metaheuristic algorithm, has been widely employed to solve scheduling problems. However, HHO suffers from premature convergence when solving NP-hard problems. Therefore, this paper proposes an improved HHO algorithm (GNHHO) to solve the FJSP. GNHHO introduces an elitism strategy, a chaotic mechanism, a nonlinear escaping energy update strategy, and a Gaussian random walk strategy to prevent premature convergence. A flexible job shop scheduling model is constructed, and the static and dynamic FJSP is investigated to minimize the makespan. This paper chooses a twosegment encoding mode based on the job and the machine of the FJSP. To verify the effectiveness of GNHHO, this study tests it in 23 benchmark functions, 10 standard job shop scheduling problems (JSPs), and 5 standard FJSPs. Besides, this study collects data from an agricultural company and uses the GNHHO algorithm to optimize the company's FJSP. The optimized scheduling scheme demonstrates significant improvements in makespan, with an advancement of 28.16% for static scheduling and 35.63% for dynamic scheduling. Moreover, it achieves an average increase of 21.50% in the on-time order delivery rate. The results demonstrate that the performance of theGNHHO algorithm in solving FJSP is superior to some existing algorithms. [ABSTRACT FROM AUTHOR]