In this paper we present AOAB, the Automated optimization algorithm Benchmarking system. AOAB can be used to automatically conduct experiments with numerical optimization algorithms by applying them to different bench...
详细信息
ISBN:
(纸本)9781450300735
In this paper we present AOAB, the Automated optimization algorithm Benchmarking system. AOAB can be used to automatically conduct experiments with numerical optimization algorithms by applying them to different benchmarks with different parameter settings. Based on the results, AOAB can automatically perform comparisons between different algorithms and settings. It can aid the researcher to identify trends for good parameter settings and to find which algorithms are suitable for which type of problem. We introduce the system structure of AOAB (the server and the graphical client interface), define the way in which optimizers and benchmark functions can be implemented for the use in AOAB, and conduct an illustrative example experiment with our system: a comparison between Random Search and two Hill Climbers.
In this paper, author comes up with a new optimization algorithm about distribution routing planning. This method is used to make the best distribution route according to vehicle's load capacity, distance from dis...
详细信息
ISBN:
(纸本)9781424425020
In this paper, author comes up with a new optimization algorithm about distribution routing planning. This method is used to make the best distribution route according to vehicle's load capacity, distance from distribution centre and various client demand as well as cargo priority etc. The result could be displayed in electronic map. Proved by instances, this method can help managers to reduce the cost of distribution and make decisions for transportation control.
A new optimization algorithm, namely the Forest algorithm (FA), is introduced for the first time. This algorithm simulates trees' growth, reproduction and death in a forest to perform optimization. In the algorith...
详细信息
ISBN:
(纸本)9781479942626
A new optimization algorithm, namely the Forest algorithm (FA), is introduced for the first time. This algorithm simulates trees' growth, reproduction and death in a forest to perform optimization. In the algorithm, trees and branches represent a collection of trial solutions and parameters needed to be optimized respectively, and three mechanisms, i.e. growth, proliferation and death, are employed for improving trees' vitality, which is a factor defined to evaluate the fitness of trial solutions. This algorithm in general execute a global optimization by operating on a group of trial solutions in parallel, but its growth mechanism, which adopts a parameter sweeping method, is a local optimization, so it combines the ability to find global optima of the global optimization and the fast convergence of the local optimization. Several numerical experiments are conducted, in which the performance of the FA in terms of the global optimization capability, accuracy and efficiency is evaluated and compared to that of some widely-used global optimization algorithms such as the Genetic algorithm (GA) and the Particle Swarm optimization (PSO). Results shown the FA is able to perform global optimization effectively and with high accuracy.
optimization algorithms have been proved to be good solutions for many practical applications. They were mainly inspired by natural evolutions. However, they are still faced to some problems such as trapping in local ...
详细信息
ISBN:
(纸本)9783642245527;9783642245534
optimization algorithms have been proved to be good solutions for many practical applications. They were mainly inspired by natural evolutions. However, they are still faced to some problems such as trapping in local minimums, having low speed of convergence, and also having high order of complexity for implementation. In this paper, we introduce a new optimization algorithm, we called it Stem Cells algorithm (SCA), which is based on behavior of stem cells in reproducing themselves. SCA has high speed of convergence, low level of complexity with easy implementation process. It also avoid the local minimums in an intelligent manner. The comparative results on a series of benchmark functions using the proposed algorithm related to other well-known optimization algorithms such as genetic algorithm (GA), particle swarm optimization (PSO) algorithm, ant colony optimization (ACO) algorithm and artificial bee colony (ABC) algorithm demonstrate the superior performance of the new optimization algorithm.
Pulse Coupled Neural Network(PCNN) is widely used in the field of image processing, but it is a difficult task to define the relative parameters properly in the research of the applications of PCNN. So far the determi...
详细信息
ISBN:
(纸本)9781628411867
Pulse Coupled Neural Network(PCNN) is widely used in the field of image processing, but it is a difficult task to define the relative parameters properly in the research of the applications of PCNN. So far the determination of parameters of its model needs a lot of experiments. To deal with the above problem, a document segmentation based on the improved PCNN is proposed. It uses the maximum entropy function as the fitness function of bacterial foraging optimization algorithm, adopts bacterial foraging optimization algorithm to search the optimal parameters, and eliminates the trouble of manually set the experiment parameters. Experimental results show that the proposed algorithm can effectively complete document segmentation. And result of the segmentation is better than the contrast algorithms.
Industrial Wireless Sensor Networks (IWSNs) are emerged as flexible and cost-efficient alternatives to the traditional wired networks in various monitoring and control applications within the industrial domain. Low de...
详细信息
ISBN:
(纸本)9781728112688
Industrial Wireless Sensor Networks (IWSNs) are emerged as flexible and cost-efficient alternatives to the traditional wired networks in various monitoring and control applications within the industrial domain. Low delay is a key feature of delay-sensitive applications as the data is typically valid for a short interval of time. If data arrives too late it is of limited use which may lead to performance drops or even system outages which can create significant economical losses. In this paper, we propose a decentralized optimization algorithm to minimize the End-to-End (E2E) delay of multi-hop IWSNs. Firstly, we formulate the optimization problem by considering the objective function as the network delay where the constraint is the stability criteria based on the total arrival rate and the total service rate. The objective function is proved to be strictly convex for the entire network, then a Decentralized Primal-Dual (DeP-D) algorithm is proposed based on the sub-gradient method to solve the formulated optimization problem. The performance of the proposed DeP-D is evaluated through simulations and compared with WirelessHART network and the results show that the proposed DeP-D can achieve at least 40% reduction in the average E2E delay.
In this paper, proposed optimization technique called whale optimization algorithm (WOA) is presents to find the optimum allocation of distributed generation (DG) and capacitor in radial distribution systems during re...
详细信息
ISBN:
(纸本)9781538652619
In this paper, proposed optimization technique called whale optimization algorithm (WOA) is presents to find the optimum allocation of distributed generation (DG) and capacitor in radial distribution systems during reduction of single and multi-objective function namely, (network power losses, voltage deviation, and total operating cost). The multi objective function is formed by the use of weighted sum method. In this paper, multiple-DG units have been analyzed under two load power factors (i. e., unity and optimal) with and without capacitor (C). WOA technique has been applied to a 33-bus radial distribution system. The performance of the WOA technique is compared with other evolutionary optimization methods under different operating conditions of the system. The impact of integrating the proper size of DG and C at the suitable placement based on proposed algorithm are shown in the simulation results.
With the advancement in high performance computing and numerical optimization techniques, engineering design optimization problems are becoming more complex, larger scale, higher fidelity, and computationally more dem...
详细信息
ISBN:
(数字)9781624105784
ISBN:
(纸本)9781624105784
With the advancement in high performance computing and numerical optimization techniques, engineering design optimization problems are becoming more complex, larger scale, higher fidelity, and computationally more demanding, requiring longer run times than ever before. There exists methodologies and techniques that can address some of these challenges but very few can address all, and most are limited in the extent that these concerns can be addressed. With the goal of addressing such challenging engineering problems, we developed a new optimization algorithm, named AMIEGO, that combines concepts from surrogate-based optimization approaches, gradient-based numerical methods, Partial Least Squares, evolutionary algorithms, and Branch-and-Bound, providing newer capabilities that were not previously perceived. The effort here builds upon this previously developed optimization algorithm to include multiple infill sampling capability that combines the concept of generalized expected improvement function, unsupervised learning, and multi-objective evolutionary technique. To demonstrate, AMIEGO with the multiple infill capability (called AMIEGO-MIMOS) solves a series of increasingly difficult engineering design optimization problems. The results reveal the performance of the new approach is problem dependent. When applied to a ten-bar truss problem, the newly proposed multiple infill strategy consistently leads to a better design solutions when compared to the existing CPTV method (implemented with the context of the AMIEGO algorithm). On the other hand, when applied to a mixed-integer high fidelity wing topology optimization problem - MIMOS, despite showing a steeper convergence at the start, eventually leads to an inferior solution as compared to CPTV approach. These results also reveal that a small number of starting points, in general, are sufficient to lead to a good overall solution.
The North Atlantic region is the busiest oceanic airspace controlled by the United States. To better serve the two traffic flows between Europe and North America, two Organized Track Systems (OTS) are created on a dai...
详细信息
ISBN:
(数字)9781624106101
ISBN:
(纸本)9781624106101
The North Atlantic region is the busiest oceanic airspace controlled by the United States. To better serve the two traffic flows between Europe and North America, two Organized Track Systems (OTS) are created on a daily basis to accommodate oceanic flights. This paper studies the potential benefits of a novel method for assigning flights to the OTS in the North Atlantic airspace. A mathematical model for the group assignment procedure is provided in this study, and a metaheuristic optimization algorithm is proposed for the solution methodology. The proposed algorithm is validated with a small size problem verifying it can find the global optimal in reasonable computational time. The validated optimization algorithm is implemented inside a fast-time flight simulation tool, called Global Oceanic Model. This study used the real-scale flight traffic related to three consecutive days in June 2016. The simulation results show the operational benefits of the proposed assignment procedure in terms of efficiency, level of service, and airline equity.
As an important component of the vessel's Dynamic Positioning(DP) System, thrust allocation determines the control input of each thruster device from the control law. Thrust allocation problems can be formulated a...
详细信息
ISBN:
(纸本)9781467374439
As an important component of the vessel's Dynamic Positioning(DP) System, thrust allocation determines the control input of each thruster device from the control law. Thrust allocation problems can be formulated as nonlinear optimization problems. A chaos Particle Swarm optimization(PSO) algorithm combined with multi-agent scheme is proposed for the thrust allocation in this paper. The algorithm which uses multi-agent topological structure has three functions that keeps the diversity of the particle swarm population, improving particle swarm global search ability, and enhancing information diversity. Relying on chaotic local search to get rid of local optima, it can also improve the convergence precision. The numerical simulations are conducted to demonstrate the effectiveness of the proposed methods, and the results are compared with PSO algorithm.
暂无评论