共查询到20条相似文献,搜索用时 46 毫秒
1.
We carefully derive accurate asymptotic expansions of the steady-state voltage potentials in the presence of a finite number of diametrically small inhomogeneities with conductivities different from the background conductivity. We then apply these accurate asymptotic formulae for the purpose of identifying the location and certain properties of the shape of the conductivity anomaly. Our designed real-time algorithm makes use of constant current sources. It is based on the observation in both the near and far field of the pattern of a simple weighted combination of the input currents and the output voltages. The mathematical analysis provided in this paper indicates that our algorithm is with a very high resolution and accuracy. 相似文献
2.
Given a set of commodities to be routed over a network, the network design problem with relays involves selecting a route for each commodity and determining the location of relays where the commodities must be reprocessed at certain distance intervals. We propose a hybrid approach based on variable neighborhood search. The variable neighborhood algorithm searches for the route for each commodity and the optimal relay locations for a given set of routes are determined by an implicit enumeration algorithm. We show that dynamic programming can be used to determine the optimal relay locations for a single commodity. Dynamic programming is embedded into the implicit enumeration algorithm to solve the relay location problem optimally for multiple commodities. The special structure of the problem is leveraged for computational efficiency. In the variable neighborhood search algorithm, the routes of the current solution are perturbed and reconstructed to generate neighbor solutions using random and greedy construction heuristics. Computational experiments on three sets of problems (80 instances) show that the variable neighborhood search algorithm with optimal relay allocations outperforms all existing algorithms in the literature. 相似文献
3.
V. L. Beresnev E. N. Goncharov A. A. Mel’nikov 《Journal of Applied and Industrial Mathematics》2012,6(1):22-30
In the optimization problem for pseudo-Boolean functions we consider a local search algorithm with a generalized neighborhood.
This neighborhood is constructed for a locally optimal solution and includes nearby locally optimal solutions. We present
some results of simulations for pseudo-Boolean functions whose optimization is equivalent to the problems of facility location,
set covering, and competitive facility location. The goal of these experiments is to obtain a comparative estimate for the
locally optimal solutions found by the standard local search algorithm and the local search algorithm using a generalized
neighborhood. 相似文献
4.
In variational data assimilation a least‐squares objective function is minimised to obtain the most likely state of a dynamical system. This objective function combines observation and prior (or background) data weighted by their respective error statistics. In numerical weather prediction, data assimilation is used to estimate the current atmospheric state, which then serves as an initial condition for a forecast. New developments in the treatment of observation uncertainties have recently been shown to cause convergence problems for this least‐squares minimisation. This is important for operational numerical weather prediction centres due to the time constraints of producing regular forecasts. The condition number of the Hessian of the objective function can be used as a proxy to investigate the speed of convergence of the least‐squares minimisation. In this paper we develop novel theoretical bounds on the condition number of the Hessian. These new bounds depend on the minimum eigenvalue of the observation error covariance matrix and the ratio of background error variance to observation error variance. Numerical tests in a linear setting show that the location of observation measurements has an important effect on the condition number of the Hessian. We identify that the conditioning of the problem is related to the complex interactions between observation error covariance and background error covariance matrices. Increased understanding of the role of each constituent matrix in the conditioning of the Hessian will prove useful for informing the choice of correlated observation error covariance matrix and observation location, particularly for practical applications. 相似文献
5.
Mikhail Belkin Hariharan Narayanan Partha Niyogi 《Random Structures and Algorithms》2013,43(4):407-428
We draw on the observation that the amount of heat diffusing outside of a heated body in a short period of time is proportional to its surface area, to design a simple algorithm for approximating the surface area of a convex body given by a membership oracle. Our method has a complexity of O*(n4), where n is the dimension, compared to O*(n8) for the previous best algorithm. We show that our complexity cannot be improved given the current state‐of‐the‐art in volume estimation. © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 43, 407–428, 2013 相似文献
6.
Yu‐Hong Dai Jos Mario Martínez Jin‐Yun Yuan 《Numerical Linear Algebra with Applications》2003,10(4):323-334
The search direction in unconstrained minimization algorithms for large‐scale problems is usually computed as an iterate of the preconditioned) conjugate gradient method applied to the minimization of a local quadratic model. In line‐search procedures this direction is required to satisfy an angle condition that says that the angle between the negative gradient at the current point and the direction is bounded away from π/2. In this paper, it is shown that the angle between conjugate gradient iterates and the negative gradient strictly increases as far as the conjugate gradient algorithm proceeds. Therefore, the interruption of the conjugate gradient sub‐algorithm when the angle condition does not hold is theoretically justified. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
7.
Yannis Marinakis Magdalene Marinaki 《Journal of Mathematical Modelling and Algorithms》2008,7(1):59-78
This paper introduces a new hybrid algorithmic nature inspired approach based on particle swarm optimization, for solving
successfully one of the most popular logistics management problems, the location routing problem (LRP). The proposed algorithm
for the solution of the location routing problem, the hybrid particle swarm optimization (HybPSO-LRP), combines a particle
swarm optimization (PSO) algorithm, the multiple phase neighborhood search – greedy randomized adaptive search procedure (MPNS-GRASP)
algorithm, the expanding neighborhood search (ENS) strategy and a path relinking (PR) strategy. The algorithm is tested on
a set of benchmark instances. The results of the algorithm are very satisfactory for these instances and for six of them a
new best solution has been found.
相似文献
8.
Ankit Aggarwal Anand Louis Manisha Bansal Naveen Garg Neelima Gupta Shubham Gupta Surabhi Jain 《Mathematical Programming》2013,141(1-2):527-547
We consider the facility location problem where each facility can serve at most U clients. We analyze a local search algorithm for this problem which uses only the operations of add, delete and swap and prove that any locally optimum solution is no more than 3 times the global optimum. This improves on a result of Chudak and Williamson who proved an approximation ratio of ${3+2\sqrt{2}}$ for the same algorithm. We also provide an example which shows that any local search algorithm which uses only these three operations cannot achieve an approximation guarantee better than 3. 相似文献
9.
PI controller design using artificial bee colony algorithm for MPPT of photovoltaic system supplied DC motor‐pump load
下载免费PDF全文
![点击此处可从《Complexity》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Maximum Power Point Tracking (MPPT) is used in Photovoltaic (PV) systems to maximize its output power. A new MPPT system has been suggested for PV‐DC motor pump system by designing two PI controllers. The first one is used to reach MPPT by monitoring the voltage and current of the PV array and adjusting the duty cycle of the DC/DC converter. The second PI controller is designed for speed control of DC series motor by setting the voltage fed to the DC series motor through another DC/DC converter. The suggested design problem of MPPT and speed controller is formulated as an optimization task which is solved by Artificial Bee Colony (ABC) to search for optimal parameters of PI controllers. Simulation results have shown the validity of the developed technique in delivering MPPT to DC series motor pump system under atmospheric conditions and tracking the reference speed of motor. Moreover, the performance of the ABC algorithm is compared with Genetic Algorithm for various disturbances to prove its robustness. © 2015 Wiley Periodicals, Inc. Complexity 21: 99–111, 2016 相似文献
10.
In problems of optimal location, one seeks a position or location that optimizes a particular objective function; this objective function typically relates location and distances to a fixed point set. When one's search is restricted to a given set, we refer to this as a constrained optimal location problem. For a finite point set A, there exist numerous finite algorithms to solve optimal location problems. In this paper we demonstrate how an algorithm, solving optimal location problems in inner-product spaces, can be modified to solve certain constrained optimal location problems. We then apply this modification to a particularly simple (and easily implemented) algorithm and investigate the complexity of the result. In particular we improve a known estimate from exponential to polynomial. 相似文献
11.
Mohit Tawarmalani Shabbir Ahmed Nikolaos V. Sahinidis 《Journal of Global Optimization》2002,24(4):385-416
We develop eight different mixed-integer convex programming reformulations of 0-1 hyperbolic programs. We obtain analytical results on the relative tightness of these formulations and propose a branch and bound algorithm for 0-1 hyperbolic programs. The main feature of the algorithm is that it reformulates the problem at every node of the search tree. We demonstrate that this algorithm has a superior convergence behavior than directly solving the relaxation derived at the root node. The algorithm is used to solve a discrete p-choice facility location problem for locating ten restaurants in the city of Edmonton.The research was supported in part by NSF awards DMII 95-02722 and BES 98-73586 to NVS. 相似文献
12.
Guoliang Xue 《Numerical Algorithms》1995,9(1):1-12
In this paper we partially resolve an open problem in spherical facility location. The spherical facility location problem is a generalization of the planar Euclidean facility location problem. This problem was first studied by Katz and Cooper and by Drezner and Wesolowsky where a Weszfeld-like algorithm was proposed. This algorithm is very simple and does not require a line search. However, its convergence has been an open problem for more than ten years. In this paper, we prove that the sequence generated by the algorithm converges to the unique optimal solution under the condition that the oscillation of the sequence converges to zero. We conjecture that the algorithm is a descent algorithm and prove that the sequence generated by the algorithm converges to the optimal solution under this conjecture. 相似文献
13.
Unsupervised anomaly detection within non‐numerical sequence data by average index difference,with application to masquerade detection
下载免费PDF全文
![点击此处可从《商业与工业应用随机模型》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Anomaly detection within non‐numerical sequence data has developed into an important topic of data mining, but comparatively little research has been done regarding anomaly detection without training data (unsupervised anomaly detection). One application found in computer security is the detection of a so‐called masquerade attack, which consists of an attacker abusing a regular account. This leaves only the session input, which is basically a string of non‐numerical commands, for analysis. Our previous approach to this problem introduced the use of the so‐called average index difference function for mapping the non‐numerical symbol data to a numerical space. In the present paper, we examine the theoretical properties of the average index difference function, present an enhanced unsupervised anomaly detection algorithm based on the average index difference function, show the parameters to be theoretically inferable, and evaluate the performance using real‐world data. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
14.
Habib Ammari Junqing Chen Zhiming Chen Josselin Garnier Darko Volkov 《Journal de Mathématiques Pures et Appliquées》2014
The goal of this paper is to contribute to the field of nondestructive testing by eddy currents. We provide a mathematical analysis and a numerical framework for simulating the imaging of arbitrarily shaped small-volume conductive inclusions from electromagnetic induction data. We derive, with proof, a small-volume expansion of the eddy current data measured away from the conductive inclusion. The formula involves two polarization tensors: one associated with the magnetic contrast and the second with the conductivity of the inclusion. Based on this new formula, we design a location search algorithm. We include in this paper a discussion on data sampling, noise reduction, and probability of detection. We provide numerical examples that support our findings. 相似文献
15.
This paper presents a multi objective optimal location of AVRs in distribution systems at the presence of distributed generators based on modified teaching-learning-based optimization (MTLBO) algorithm. In the proposed MTLBO algorithm, teacher and learner phases are modified. The proposed objective functions are energy generation costs, electrical energy losses and the voltage deviations. The proposed algorithm utilizes several teachers and considers the teachers as an external repository to save found Pareto optimal solutions during the search process. Since the objective functions are not the same, a fuzzy clustering method is used to control the size of the repository. The proposed technique allows the decision maker to select one of the Pareto optimal solutions (by trade-off) for different applications. The performance of the suggested algorithm on a 70-bus distribution network in comparison with other evolutionary methods such as GA, PSO and TLBO, is extraordinary. 相似文献
16.
17.
《Mathematical and Computer Modelling》2007,45(3-4):459-472
We investigate the role of additional information in reducing the computational complexity of the global optimization problem (GOP). Following this approach, we develop GMG — an algorithm for finding the Global Minimum with a Guarantee. The new algorithm breaks up an originally continuous GOP into a discrete (grid) search problem followed by a descent problem. The discrete search identifies the basin of attraction of the global minimum after which the actual location of the minimizer is found upon applying a descent algorithm. The algorithm is first applied to the golf-course problem, which serves as a litmus test for its performance in the presence of both complete and degraded additional information. GMG is further assessed on a set of standard benchmark functions. We then illustrate the performance of the validated algorithm on a simple realization of the monocular passive ranging (MPR) problem in remote sensing, which consists of identifying the range of an airborne target (missile, plane, etc.) from its observed radiance. This inverse problem is set as a GOP whereby the difference between the observed and model predicted radiances is minimized over the possible ranges and atmospheric conditions. We solve the GOP using GMG and report on the performance of the algorithm. 相似文献
18.
针对标准灰狼算法种群多样性差、后期收敛速度慢、易陷入局部最优的缺陷,提出一种改进灰狼算法.利用改进Tent混沌映射初始化种群,增加种群多样性;引入螺旋函数,提高算法收敛速度;融合模拟退火思想,避免陷入局部最优;设置搜索阈值,平衡全局搜索与局部搜索;利用改进Tent混沌映射产生新个体,替换性能较差个体并进行高斯扰动,增加寻优精度;将当前解和新解进行算术杂交,以保留当前解优点并减小扰动差异.使用基准测试函数和共享单车停车点选址及期初配置模型测试算法性能.结果表明,改进灰狼算法较标准灰狼算法、遗传算法和粒子群算法,收敛速度更快,寻优精度更高,性能更优越,并将该算法应用到共享单车停车选址上,验证了算法的有效性. 相似文献
19.
The capacitated single assignment hub location problem with modular link capacities is a variant of the classical hub location problem in which the cost of using edges is not linear but stepwise, and the hubs are restricted in terms of transit capacity rather than in the incoming traffic. We propose a metaheuristic algorithm based on strategic oscillation, a methodology originally introduced in the context of tabu search. Our method incorporates several designs for constructive and destructive algorithms, together with associated local search procedures, to balance diversification and intensification for an efficient search. Computational results on a large set of instances show that, in contrast to exact methods that can only solve small instances optimally, our metaheuristic is able to find high-quality solutions on larger instances in short computing times. In addition, the new method, which joins tabu search strategies with strategic oscillation, outperforms the previous tabu search implementation. 相似文献
20.
We consider subspace iteration (or projection‐based) algorithms for computing those eigenvalues (and associated eigenvectors) of a Hermitian matrix that lie in a prescribed interval. For the case that the projector is approximated with polynomials, we present an adaptive strategy for selecting the degree of these polynomials such that convergence is achieved with near‐to‐optimum overall work without detailed a priori knowledge about the eigenvalue distribution. The idea is then transferred to the approximation of the projector by numerical integration, which corresponds to FEAST algorithm proposed by E. Polizzi in 2009. [E. Polizzi: Density‐matrix‐based algorithm for solving eigenvalue problems. Phys. Rev. B 2009; 79 :115112]. Here, our adaptation controls the number of integration nodes. We also discuss the interaction of the method with search space reduction methods. 相似文献