Flyrock is an undesirable phenomenon in blasting operations. Due to high potential to cause damage to machinery and nearby structures and to cause injuries, even fatal, to personnel, flyrock is the most dangerous adve...
详细信息
Flyrock is an undesirable phenomenon in blasting operations. Due to high potential to cause damage to machinery and nearby structures and to cause injuries, even fatal, to personnel, flyrock is the most dangerous adverse effect of blasting. For controlling and decreasing the effect of this phenomenon, it is necessary to predict it. Because of multiplicity of effective parameters and complexity of interactions among these parameters, empirical methods may not be fully appropriate for flyrock estimation. The scope of this study is to predict flyrock induced by blasting through a novel approach based on the combination of differential evaluation algorithm (DE) and dimensional analysis algorithm (DA). For this purpose, the parameters of 300 blasting operations were accurately recorded and flyrock distances were measured for each operation. In the next stage, two new empirical predictors were developed to predict flyrock distance. The results clearly showed the superiority of the proposed DE-DA model in comparison with the empirical approaches.
In this work, a time-varying external archive differential evolution algorithm is proposed, which can obtain the multiple roots for system of nonlinear equations for the forward dis-placement of parallel mechanisms. I...
详细信息
In this work, a time-varying external archive differential evolution algorithm is proposed, which can obtain the multiple roots for system of nonlinear equations for the forward dis-placement of parallel mechanisms. In time-varying external archive differentialevolution three improvements are presented. At first, a time-varying subpopulation strategy is pro-posed to consider both global and local searching capabilities. Then, an individual judg-ment criterion is proposed, which employs the weighted basis vector mutation strategy for ordinary individuals and a hybrid mutation operator for locally optimal individuals. Fi-nally, the external archive strategy of neighborhood-based crowding differentialevolution is improved to enhance the domain searching ability of the algorithm. To evaluate the per-formance of time-varying external archive differentialevolution, twenty benchmark func-tions are selected as the test suite. Moreover, the solutions for forward displacements of four strongly coupled parallel mechanisms with different degrees of freedom are derived to test the generality of this method. From the acquired experimental results, it is demon-strated that fairly-competitive results can be provided compared to other methods, in both benchmark functions and forward displacement solutions of parallel mechanisms. (C) 2022 Elsevier Inc. All rights reserved.
Delivering relief supplies to victims of natural disasters is a very complicated process faced with many challenges: damaged road network, high demand for various materials, scarcity of resources, multi-supply and mul...
详细信息
Delivering relief supplies to victims of natural disasters is a very complicated process faced with many challenges: damaged road network, high demand for various materials, scarcity of resources, multi-supply and multi-demand sites, limited transport capacity, etc. Traditionally, outreach maximization is the focus of emergency relief. In this research, we propose a bi-level programming model which takes the aforementioned challenges into full account. We consider two objectives: minimizing the distribution time, and maximizing the allocation fairness. Because the problem is NP-hard, we design an improved differentialevolution (IDE) algorithm and numerically compare it with several conventional differential evolution algorithms, including CoDE, SaDE, JADE and JDE. We found that the proposed IDE outperforms the existing algorithms. The feasibility and validity of the proposed model and the IDE algorithm are verified by applying them to the 2008 Wenchuan earthquake in western China.
The problem of product structure optimization always appears in the coal preparation plants, mines, and mining areas three ranks. The differential evolution algorithm is applied to optimize the product structure in co...
详细信息
The problem of product structure optimization always appears in the coal preparation plants, mines, and mining areas three ranks. The differential evolution algorithm is applied to optimize the product structure in coal preparation plants. A model optimizing the coal product structure and maximizing economic benefit of coal preparation plants is developed, with the use of a differential evolution algorithm toolbox in optimization software called 1stopt, then the optimum solution of the products processing is achieved. The model using the differential evolution algorithm is tested through actual data;test results prove that the differential evolution algorithm can be used to optimize the product structure in coal preparation plants and it has characters of simple principle, strong ability of global convergence, memorizing optimum solution, and the optimization results accord with the practical situation.
The core element of a dynamic gesture recognition system is to localize the gesturing object, then some classification methods are used to recognize gestures. In this work, focus is made on gesturing object localizati...
详细信息
The core element of a dynamic gesture recognition system is to localize the gesturing object, then some classification methods are used to recognize gestures. In this work, focus is made on gesturing object localization. Adaptive differential evolution algorithm for real-time object tracking is proposed. The algorithm tracks the hand position in any directions at variable speed of gesturing, providing to the interacting users with the flexibility of choosing gesturing speed. The integration of motion blurs information in the tracking process improves the proposed tracker's efficiency and accuracy. Experiment results show good performance of the proposed tracker in real time(1).
In recent years, the differential evolution algorithm (DEA) has frequently been used to tackle various water resource problems due to its powerful search ability. However, one challenge of using the DEA is the tedious...
详细信息
In recent years, the differential evolution algorithm (DEA) has frequently been used to tackle various water resource problems due to its powerful search ability. However, one challenge of using the DEA is the tedious effort required to fine-tune parameter values due to a lack of theoretical understanding of what governs its searching behavior. This study investigates DEA's search behavior as a function of its parameter values. A range of behavioral metrics are developed to measure run-time statistics about DEA's performance, with primary focus on the search quality, convergence properties and solution generation statistics. Water distribution system design problems are utilized to enable investigation of the behavioral analysis using the developed metrics. Results obtained offer an improved knowledge on how the control parameter values affect DEA's search behavior, thereby providing guidance for parameter-tuning and hence hopefully increasing appropriate take-up of the DEA within the industry in tackling water resource optimization problems. (C) 2014 Elsevier Ltd. All rights reserved.
A cloud service provider (CP) offers computing resources with their own interface type and pricing policies besides other services such as storage on a pay-per-use model. Client's requests should be processed in a...
详细信息
A cloud service provider (CP) offers computing resources with their own interface type and pricing policies besides other services such as storage on a pay-per-use model. Client's requests should be processed in an appropriate CP datacenters in a trade-off relation between price and performance. The appropriate choice of a CP datacenters is the responsibility of the cloud-based service broker routing policy which acts as an intermediate between the users and the CP's datacenters. However, due to the distribution nature of the CP's datacenters, these datacenters can be overloaded with the increasing number of users and their requests being served at the same time if the datacenters are unwisely chosen. Therefore, choosing the appropriate datacenter is significant to the overall performance of the cloud computing systems. This paper aims to propose an optimized service broker routing policy based on different parameters that aims to achieve minimum processing time, minimum response time and minimum cost through employing a searching algorithm to search for the optimal solution from a possible solution space. A simulation-based deployment of the proposed algorithm along with a comparison study with other known algorithms form the field, confirms the ability of the proposed algorithm to minimize the load on service provider datacenters with minimum processing time, response time and overall cost.
This paper presents a multi-objective differentialevolution (MODE) algorithm for environmental/economic power dispatch (EED) problem. The EED problem is formulated as a nonlinear constrained multi-objective problem w...
详细信息
This paper presents a multi-objective differentialevolution (MODE) algorithm for environmental/economic power dispatch (EED) problem. The EED problem is formulated as a nonlinear constrained multi-objective problem with competing and non-commensurable objectives of fuel cost, emission and system loss. The proposed MODE approach adopts an external elitist archive to retain non-dominated solutions found during the evolutionary process. In order to preserve the diversity of Pareto optimality, a crowding entropy diversity measure tactic is proposed. The crowding entropy strategy is able to measure the crowding degree of the solutions more accurately. In addition, fuzzy set theory is employed to extract the best compromise solution. Several optimization runs of the proposed approach have been carried out on the IEEE 30- and 118-bus test system. The results demonstrate the capability of the proposed MODE approach to generate well-distributed Pareto optimal non-dominated solutions of multi-objective EED problem. The comparison with reported results of other MOEAs reveals the superiority of the proposed MODE approach and confirms its potential for solving other power systems multi-objective optimization problems. (C) 2010 Elsevier B.V. All rights reserved.
In this paper, a pickups and deliveries problem with fuzzy time windows (PDPFTW) is presented and solved. The customer service level associated with time window is characterized by fuzzy membership functions based on ...
详细信息
In this paper, a pickups and deliveries problem with fuzzy time windows (PDPFTW) is presented and solved. The customer service level associated with time window is characterized by fuzzy membership functions based on fuzzy set theory. A novel multi-objective fuzzy programming model of PDPFTW is proposed. The proposed model aims at minimizing the vehicle numbers and the overall travel costs and maximizing the total customer service level. A novel differential evolution algorithm (DE) for PDPFTW is also proposed. In DE, we first adopted the novel decimal coding to construct an initial population, and then used some improved differentialevolution operators unlike existing algorithm, in mutation operation, we used an integer order criterion based on natural number coding method and introduced a penalty technical to publish the infeasible solution. In addition, in the crossover operation, we designed a self-adapting crossover probability that varied with iteration. Our experimental results demonstrate the efficiency of the proposed DE, which saved some running time compare with GA in 100,200,400 and 1000 cases. At the same time, DE can get better solutions compare with GA in total distance of vehicles, total services level of customers and vehicle numbers. Moreover, we found that total service level would increase with wider time window.
differential evolution algorithms represent an up to date and efficient way of solving complicated optimization tasks. In this article we concentrate on the ability of the differential evolution algorithms to attain t...
详细信息
differential evolution algorithms represent an up to date and efficient way of solving complicated optimization tasks. In this article we concentrate on the ability of the differential evolution algorithms to attain the global minimum of the cost function. We demonstrate that although often declared as a global optimizer the classic differential evolution algorithm does not in general guarantee the convergence to the global minimum. To improve this weakness we design a simple modification of the classic differential evolution algorithm. This modification limits the possible premature convergence to local minima and ensures the asymptotic global convergence. We also introduce concepts that are necessary for the subsequent proof of the asymptotic global convergence of the modified algorithm. We test the classic and modified algorithm by numerical experiments and compare the efficiency of finding the global minimum for both algorithms. The tests confirm that the modified algorithm is significantly more efficient with respect to the global convergence than the classic algorithm.
暂无评论