Search results

The purpose of this paper is to test the capability of a new population‐based optimization algorithm for solving an NP‐hard problem, called “Multiple Knapsack Problem”, or MKP.

Here, the intelligent water drops (IWD) algorithm, which is a population‐based optimization algorithm, is modified to include a suitable local heuristic for the MKP. Then, the proposed algorithm is used to solve the MKP.

The proposed IWD algorithm for the MKP is tested by standard problems and the results demonstrate that the proposed IWD‐MKP algorithm is trustable and promising in finding the optimal or near‐optimal solutions. It is proved that the IWD algorithm has the property of the convergence in value.

This paper introduces the new optimization algorithm, IWD, to be used for the first time for the MKP and shows that the IWD is applicable for this NP‐hard problem. This research paves the way to modify the IWD for other optimization problems. Moreover, it opens the way to get possibly better results by modifying the proposed IWD‐MKP algorithm.

The purpose of this paper is to calculate the back scattering response from single, finite and infinite arrays of nonlinear antennas like the case where the antennas are exposed to high-value signals such as lightning strokes.

In this paper, the authors have used a recently introduced optimization technique called intelligent water drop.

The results exhibit that the method used by the authors is faster and more accurate than other conventional optimization algorithms, i.e. particle swarm optimization and genetic algorithm.

A new optimization algorithm is used to solve nonlinear problem accurately and sufficiently. Although the technique is not confined to the mentioned examples in the paper, it can be applied to other nonlinear circuits.

User requests over the cloud are not achievable with one single service, multiple services need to be executed to fulfill what a user asks for. Typically, such services are composed and presented as one global service. Moreover, the same operation can be achieved by multiple services available at different clouds, which can result in different possibilities in composing them. This paper aims to decrease the number of clouds involved in the composition process, so that user requests are satisfied with minimal cost (communication costs, execution time and financial charges).

This paper investigates the use of an intelligent water drops (IWDs) optimization-based algorithm, and an integer linear programming model to optimize the number of cloud bases involved in the composition process. A comparison of the solutions found by these two techniques is presented in the paper.

The obtained results show that the number of cloud bases can be decreased without affecting user satisfaction.

The paper is a first attempt to use the IWDs algorithm for service composition, tested with big-size data.

The concept of business process (BP) as a service is a new solution in enterprises for the purpose of using specific BPs. BPs represent combinations of software services that must be properly executed by the resources provided by a company’s information technology infrastructure. As the policy requirements are different in each enterprise, processes are constantly evolving and demanding new resources in terms of computation and storage. To support more agility and flexibility, it is common today for enterprises to outsource their processes to clouds and, more recently, to cloud federation environment. Ensuring the optimal allocation of cloud resources to process service during the execution of workflows in accordance with user policy requirements is a major concern. Given the diversity of resources available in a cloud federation environment and the ongoing process changes required based on policies, reallocating cloud resources for service processing may lead to high computational costs and increased overheads in communication costs.

This paper presents a new adaptive resource allocation approach that uses a novel algorithm extending the natural-based intelligent water drops (IWD) algorithm that optimizes the resource allocation of workflows on the cloud federation which can estimate and optimize final deployment costs. The proposed algorithm is implemented and embedded within the WokflowSim simulation toolkit and tested in different simulated cloud environments with different workflow models.

The algorithm showed noticeable enhancements over the classical workflow deployment algorithms taking into account the challenges of data transfer. This paper made a comparison between the proposed IWD-based workflow deployment (IWFD) algorithm with other proposed algorithms. IWFD presented considerable improvements in the makespan, cost and data transfer in most situations in the cloud federation environment.

An extension for WorkflowSim to support the implementation of BPs in a federation cloud space regarding BP policy. Optimize workflow execution performance in Federated clouds by means of IWFD algorithm.

This paper aims to predict the traffic and helps to find a solution. Unpredictable traffic leads more vehicles on the road. The result of which is one of the factors that aggravate traffic congestion. Traffic congestion occurs when the available transport resources are less when compared to the number of vehicles that share the resource. As the number of vehicles increases the resources become scarce and congestion is more.

The population of the urban areas keeps increasing as the people move toward the cities in search of jobs and a better lifestyle. This leads to an increase in the number of vehicles on the road. However, the transport network, which is accessible to the citizens is less when compared to their demand.

The demand for resources is higher than the actual capacity of the roads and the streets. There are some circumstances, which will aggravate traffic congestion. The circumstances can be the road condition (pot holes and road repair), accidents and some natural calamities.

There is a lot of research being done to predict the traffic and model it to find a solution, which will make the condition better. However, still, it is an open issue. The accuracy of the predictions done is less.

This paper aims to incorporate a hybridized advanced sine-cosine algorithm (ASCA) and advanced ant colony optimization (AACO) technique for optimal path search with control over multiple mobile robots in static and dynamic unknown environments.

The controller for ASCA and AACO is designed and implemented through MATLAB simulation coupled with real-time experiments in various environments. Whenever the sensors detect obstacles, ASCA is applied to find their global best positions within the sensing range, following which AACO is activated to choose the next stand-point. This is how the robot travels to the specified target point.

Navigational analysis is carried out by implementing the technique developed here using single and multiple mobile robots. Its efficiency is authenticated through the comparison between simulation and experimental results. Further, the proposed technique is found to be more efficient when compared with existing methodologies. Significant improvements of about 10.21 per cent in path length are achieved along with better control over these.

Systematic presentation of the proposed technique attracts a wide readership among researchers where AI technique is the application criteria.

The purpose of this paper is to provide a better understanding of the development of intelligent agriculture (IA) in China, which is an important tendency in advancing the agricultural productivity in the coming era.

Considering publications as featured evidence of an emerging phenomenon, the authors review publications of IA. Specifically, the use of term, definition and examples of IA, both English and Chinese literature, and government policies of China are all reviewed. Additionally, the authors use basic statistical and thematic analysis to help synthesizing the literature and drawing conclusions. Findings from various sources of publications supplement with each other.

IA in China has shown three main characteristics: unbalanced geographic distribution, an early stage of the trend and attention mainly focused on a limited range of technologies. Compared with the development of IA in other countries, such as Japan, India and the USA, featured with diversified properties, similarities and differences of IA development in China and in other countries are also discussed.

This general review contributes by uncovering the emergence of IA, identifying its general definition with a comprehensive set of practical examples and pointing out the present characteristics and problems of IA development in China. The general review provides a necessary summary for the policy makers and researchers to have a systematic understanding of IA and better promote its future development. At last, the paper calls for a process-based strategy with different goals at different stages, a sustainable mechanism coordinated by multiple participants, and a localized consideration for relevant policy making.

This research study proposes a feature-centric spam email detection model (FSEDM) based on content, sentiment, semantic, user and spam-lexicon features set. The purpose of this study is to exploit the role of sentiment features along with other proposed features to evaluate the classification accuracy of machine learning algorithms for spam email detection.

Existing studies primarily exploits content-based feature engineering approach; however, a limited number of features is considered. In this regard, this research study proposed a feature-centric framework (FSEDM) based on existing and novel features of email data set, which are extracted after pre-processing. Afterwards, diverse supervised learning techniques are applied on the proposed features in conjunction with feature selection techniques such as information gain, gain ratio and Relief-F to rank most prominent features and classify the emails into spam or ham (not spam).

Analysis and experimental results indicated that the proposed model with sentiment analysis is competitive approach for spam email detection. Using the proposed model, deep neural network applied with sentiment features outperformed other classifiers in terms of classification accuracy up to 97.2%.

This research is novel in this regard that no previous research focuses on sentiment analysis in conjunction with other email features for detection of spam emails.

The purpose of the study is distributed generation planning in a radial delivery framework to identify an appropriate location with a suitable rating of DG units energized by renewable energy resources to scale back the power loss and to recover the voltage levels. Though several algorithms have already been proposed through the target of power loss reduction and voltage stability enhancement, further optimization of the objectives is improved by using a combination of heuristic algorithms like DE and particle swarm optimization (PSO).

The identification of the candidate buses for the location of DG units and optimal rating of DG units is found by a combined differential evolution (DE) and PSO algorithm. In the combined strategy of DE and PSO, the key merits of both algorithms are combined. The DE algorithm prevents the individuals from getting trapped into the local optimum, thereby providing efficient global optimization. At the same time, PSO provides a fast convergence rate by providing the best particle among the entire iteration to obtain the best fitness value.

The proposed DE-PSO takes advantage of the global optimization of DE and the convergence rate of PSO. The different case studies of multiple DG types are carried out for the suggested procedure for the 33- and 69-bus radial delivery frameworks and a real 16-bus distribution substation in Tamil Nadu to show the effectiveness of the proposed methodology and distribution system performance. From the obtained results, there is a substantial decrease in the power loss and an improvement of voltage levels across all the buses of the system, thereby maintaining the distribution system within the framework of system operation and safety constraints.

A comparison of an equivalent system with the DE, PSO algorithm when used separately and other algorithms available in literature shows that the proposed method results in an improved performance in terms of the convergence rate and objective function values. Finally, an economic benefit analysis is performed if a photo-voltaic based DG unit is allocated in the considered test systems.

Metaheuristic algorithms are classified into two categories namely: single-solution and population-based algorithms. Single-solution algorithms perform local search process by employing a single candidate solution trying to improve this solution in its neighborhood. In contrast, population-based algorithms guide the search process by maintaining multiple solutions located in different points of search space. However, the main drawback of single-solution algorithms is that the global optimum may not reach and it may get stuck in local optimum. On the other hand, population-based algorithms with several starting points that maintain the diversity of the solutions globally in the search space and results are of better exploration during the search process. In this paper more chance of finding global optimum is provided for single-solution-based algorithms by searching different regions of the search space.

In this method, different starting points in initial step, searching locally in neighborhood of each solution, construct a global search in search space for the single-solution algorithm.

The proposed method was tested based on three single-solution algorithms involving hill-climbing (HC), simulated annealing (SA) and tabu search (TS) algorithms when they were applied on 25 benchmark test functions. The results of the basic version of these algorithms were then compared with the same algorithms integrated with the global search proposed in this paper. The statistical analysis of the results proves outperforming of the proposed method. Finally, 18 benchmark feature selection problems were used to test the algorithms and were compared with recent methods proposed in the literature.

In this paper more chance of finding global optimum is provided for single-solution-based algorithms by searching different regions of the search space.