共查询到20条相似文献,搜索用时 31 毫秒
1.
林耿 《计算机工程与应用》2015,51(23):78-81
最小赋权支配集是一个NP困难的组合优化问题,有着广泛的应用背景。提出了一个高效的求解最小赋权支配集的迭代禁忌搜索算法。该算法采用随机贪心构造算法构造初始解,并利用快速的局部禁忌搜索算法寻找局部最优解,通过随机扰动和修复策略来搜索新的区域,以期跳出当前的局部最优解。用顶点数为800到1 000的大规模标准测试例子测试提出的算法。数值实验结果和与现存的启发式算法比较结果表明了算法是有效的。 相似文献
2.
Given an undirected, vertex-weighted graph, the goal of the minimum weight vertex cover problem is to find a subset of the vertices of the graph such that the subset is a vertex cover and the sum of the weights of its vertices is minimal. This problem is known to be NP-hard and no efficient algorithm is known to solve it to optimality. Therefore, most existing techniques are based on heuristics for providing approximate solutions in a reasonable computation time.Population-based search approaches have shown to be effective for solving a multitude of combinatorial optimization problems. Their advantage can be identified as their ability to find areas of the space containing high quality solutions. This paper proposes a simple and efficient population-based iterated greedy algorithm for tackling the minimum weight vertex cover problem. At each iteration, a population of solutions is established and refined using a fast randomized iterated greedy heuristic based on successive phases of destruction and reconstruction. An extensive experimental evaluation on a commonly used set of benchmark instances shows that our algorithm outperforms current state-of-the-art approaches. 相似文献
3.
We consider a fixed charge two-stage location problem in which a given number of intermediate transshipment points are to be located between the supply plants and the customer locations. Both plants and transshipment points are capacitated. Scatter search is a population-based heuristic that has been applied to several combinatorial optimization problems. We develop an efficient scatter search-based heuristic approach with hybrid improvements including local search and path-relinking routines. Computational results demonstrate the effectiveness of the heuristic even for realistic problems with larger instances and tighter capacities. 相似文献
4.
Ariel Felner 《Annals of Mathematics and Artificial Intelligence》2005,45(3-4):293-322
As search spaces become larger and as problems scale up, an efficient way to speed up the search is to use a more accurate
heuristic function. A better heuristic function might be obtained by the following general idea. Many problems can be divided
into a set of subproblems and subgoals that should be achieved. Interactions and conflicts between unsolved subgoals of the
problem might provide useful knowledge which could be used to construct an informed heuristic function. In this paper we demonstrate
this idea on the graph partitioning problem (GPP). We first show how to format GPP as a search problem and then introduce
a sequence of admissible heuristic functions estimating the size of the optimal partition by looking into different interactions
between vertices of the graph. We then optimally solve GPP with these heuristics. Experimental results show that our advanced
heuristics achieve a speedup of up to a number of orders of magnitude. Finally, we experimentally compare our approach to
other states of the art graph partitioning optimal solvers on a number of classes of graphs. The results obtained show that
our algorithm outperforms them in many cases. 相似文献
5.
Rusln G. Marzo Celso C. Ribeiro 《International Transactions in Operational Research》2020,27(3):1419-1446
Given a graph with its vertex set partitioned into a set of groups, nonnegative costs associated to its edges, and nonnegative prizes associated to its vertices, the prize‐collecting generalized minimum spanning tree problem consists in finding a subtree of this graph that spans exactly one vertex of each group and minimizes the sum of the costs of the edges of the tree less the prizes of the selected vertices. It is a generalization of the NP‐hard generalized minimum spanning tree optimization problem. We propose a GRASP (greedy randomized adaptive search procedure) heuristic for its approximate solution, incorporating path‐relinking for search intensification and a restart strategy for search diversification. The hybridization of the GRASP with path‐relinking and restarts heuristic with a data mining strategy that is applied along with the GRASP iterations, after the elite set is modified and becomes stable, contributes to making the heuristic more robust. The computational experiments show that the heuristic developed in this work found very good solutions for test problems with up to 439 vertices. All input data for the test instances and detailed numerical results are made available from Mendeley Data. 相似文献
6.
One approach for utilizing geoscience models for management or policy analysis is via a simulation-based optimization framework—where an underlying model is linked with an optimization search algorithm. In this regard, MATLAB and Python are high-level programming languages that implement numerous optimization routines, including gradient-based, heuristic, and direct-search optimizers. The ever-expanding number of available algorithms makes it challenging for practitioners to identify optimizers that deliver good performance when applied to problems of interest. Thus, the primary contribution of this paper is to present a series of numerical experiments that investigated the performance of various MATLAB and Python optimizers. The experiments considered two simulation-based optimization case studies involving groundwater flow and contaminant transport. One case study examined the design of a pump-and-treat system for groundwater remediation, while the other considered least-squares calibration of a model of strontium (Sr) transport. Using these case studies, the performance of 12 different MATLAB and Python optimizers was compared. Overall, the Hooke-Jeeves direct search algorithm yielded the best performance in terms of identifying least-cost and best-fit solutions to the design and calibration problems, respectively. The IFFCO (implicit filtering for constrained optimization) direct search algorithm and the dynamically dimensioned search (DDS) heuristic algorithm also consistently yielded good performance and were up to 80% more efficient than Hooke-Jeeves when applied to the pump-and-treat problem. These results provide empirical evidence that, relative to gradient- and population-based alternatives, direct search algorithms and heuristic variants, such as DDS, are good choices for application to simulation-based optimization problems involving groundwater management. 相似文献
7.
Variable neighborhood search for the linear ordering problem 总被引:2,自引:0,他引:2
Carlos G. Garcia Dionisio Prez-Brito Vicente Campos Rafael Martí 《Computers & Operations Research》2006,33(12):3549
Given a matrix of weights, the linear ordering problem (LOP) consists of finding a permutation of the columns and rows in order to maximize the sum of the weights in the upper triangle. This NP-complete problem can also be formulated in terms of graphs, as finding an acyclic tournament with a maximal sum of arc weights in a complete weighted graph. In this paper, we first review the previous methods for the LOP and then propose a heuristic algorithm based on the variable neighborhood search (VNS) methodology. The method combines different neighborhoods for an efficient exploration of the search space. We explore different search strategies and propose a hybrid method in which the VNS is coupled with a short-term tabu search for improved outcomes. Our extensive experimentation with both real and random instances shows that the proposed procedure competes with the best-known algorithms in terms of solution quality, and has reasonable computing-time requirements.Variable neighborhood search (VNS) is a metaheuristic method that has recently been shown to yield promising outcomes for solving combinatorial optimization problems. Based on a systematic change of neighborhood in a local search procedure, VNS uses both deterministic and random strategies in search for the global optimum.In this paper, we present a VNS implementation designed to find high quality solutions for the NP-hard LOP, which has a significant number of applications in practice. The LOP, for example, is equivalent to the so-called triangulation problem for input–output tables in economics. Our implementation incorporates innovative mechanisms to include memory structures within the VNS methodology. Moreover we study the hybridization with other methodologies such as tabu search. 相似文献
8.
A heuristic method for learning Bayesian networks using discrete particle swarm optimization 总被引:1,自引:1,他引:0
Bayesian networks are a powerful approach for representing and reasoning under conditions of uncertainty. Many researchers
aim to find good algorithms for learning Bayesian networks from data. And the heuristic search algorithm is one of the most
effective algorithms. Because the number of possible structures grows exponentially with the number of variables, learning
the model structure from data by considering all possible structures exhaustively is infeasible. PSO (particle swarm optimization),
a powerful optimal heuristic search algorithm, has been applied in various fields. Unfortunately, the classical PSO algorithm
only operates in continuous and real-valued space, and the problem of Bayesian networks learning is in discrete space. In
this paper, two modifications of updating rules for velocity and position are introduced and a Bayesian networks learning
based on binary PSO is proposed. Experimental results show that it is more efficient because only fewer generations are needed
to obtain optimal Bayesian networks structures. In the comparison, this method outperforms other heuristic methods such as
GA (genetic algorithm) and classical binary PSO. 相似文献
9.
A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization
Ting Wu Yingsha Yang Linping Sun Hu Shao 《Computers & Mathematics with Applications》2009,58(10):2051-2059
Recently, an increasing attention was paid on different procedures for an unconstrained optimization problem when the information of the first derivatives is unavailable or unreliable. In this paper, we consider a heuristic iterated-subspace minimization method with pattern search for solving such unconstrained optimization problems. The proposed method is designed to reduce the total number of function evaluations for the implementation of high-dimensional problems. Meanwhile, it keeps the advantages of general pattern search algorithm, i.e., the information of the derivatives is not needed. At each major iteration of such a method, a low-dimensional manifold, the iterated subspace, is constructed. And an approximate minimizer of the objective function in this manifold is then determined by a pattern search method. Numerical results on some classic test examples are given to show the efficiency of the proposed method in comparison with a conventional pattern search method and a derivative-free method. 相似文献
10.
Abraham Duarte Laureano F. Escudero Rafael Martí Nenad Mladenovic Juan José Pantrigo Jesús Sánchez-Oro 《Computers & Operations Research》2012
The Vertex Separation Problem belongs to a family of optimization problems in which the objective is to find the best separator of vertices or edges in a generic graph. This optimization problem is strongly related to other well-known graph problems; such as the Path-Width, the Node Search Number or the Interval Thickness, among others. All of these optimization problems are NP-hard and have practical applications in VLSI (Very Large Scale Integration), computer language compiler design or graph drawing. Up to know, they have been generally tackled with exact approaches, presenting polynomial-time algorithms to obtain the optimal solution for specific types of graphs. However, in spite of their practical applications, these problems have been ignored from a heuristic perspective, as far as we know. In this paper we propose a pure 0-1 optimization model and a metaheuristic algorithm based on the variable neighborhood search methodology for the Vertex Separation Problem on general graphs. Computational results show that small instances can be optimally solved with this optimization model and the proposed metaheuristic is able to find high-quality solutions with a moderate computing time for large-scale instances. 相似文献
11.
12.
Richa Bansal Kamal Srivastava 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2011,15(2):397-412
The cyclic antibandwidth problem is to embed the vertices of a graph G of n vertices on a cycle C
n
such that the minimum distance (measured in the cycle) of adjacent vertices is maximized. Exact results/conjectures for this
problem exist in the literature for some standard graphs, such as paths, cycles, two-dimensional meshes, and tori, but no
algorithm has been proposed for the general graphs in the literature reviewed by us so far. In this paper, we propose a memetic
algorithm for the cyclic antibandwidth problem (MACAB) that can be applied on arbitrary graphs. An important feature of this
algorithm is the use of breadth first search generated level structures of a graph to explore a variety of solutions. A novel
greedy heuristic is designed which explores these level structures to label the vertices of the graph. The algorithm achieves
the exact cyclic antibandwidth of all the standard graphs with known optimal values. Based on our experiments we conjecture
the cyclic antibandwidth of three-dimensional meshes, hypercubes, and double stars. Experiments show that results obtained
by MACAB are substantially better than those given by genetic algorithm. 相似文献
13.
Sandalidis H.G. Stavroulakis P.P. Rodriguez-Tellez J. 《Evolutionary Computation, IEEE Transactions on》1998,2(4):125-137
Modern cellular mobile communications systems are characterized by a high degree of capacity. Consequently, they have to serve the maximum possible number of calls while the number of channels per cell is limited. The objective of channel allocation is to assign a required number of channels to each cell such that both efficient frequency spectrum utilization is provided and interference effects are minimized. Channel assignment is therefore an important operation of resource management and its efficient implementation increases the fidelity, capacity, and quality of service of cellular systems. Most channel allocation strategies are based on deterministic methods, however, which result in implementation complexity that is prohibitive for the traffic demand envisaged for the next generation of mobile systems. An efficient heuristic technique capable of handling channel allocation problems is introduced as an alternative. The method is called a combinatorial evolution strategy (CES) and belongs to the general heuristic optimization techniques known as evolutionary algorithms (EAs). Three alternative allocation schemes operating deterministically, namely the dynamic channel assignment (DCA), the hybrid channel assignment (HCA), and the borrowing channel assignment (BCA), are formulated as combinatorial optimization problems for which CES is applicable. Simulations for representative cellular models show the ability of this heuristic to yield sufficient solutions. These results will encourage the use of this method for the development of a heuristic channel allocation controller capable of coping with the traffic and spectrum management demands for the proper operation of the next generation of cellular systems 相似文献
14.
Neighborhood, or local, search is a popular and practical heuristic for many combinational optimization problems. We examine the neighborhood structures of two classes of problems, 0–1 integer programming and the mean tardiness job sequencing problem—from the viewpoint of state-space graphs in artificial intelligence. Such analysis is shown to provide fundamental insights into the nature of local search algorithms and provides a useful framework for evaluating and comparing such heuristics. Computational results are presented to support these observations. 相似文献
15.
We consider a generalized version of the well known Traveling Salesman Problem called Covering Salesman problem. In this problem, we are given a set of vertices while each vertex i can cover a subset of vertices within its predetermined covering distance ri. The goal is to construct a minimum length Hamiltonian cycle over a subset of vertices in which those vertices not visited on the tour has to be within the covering distance of at least one vertex visited on the tour. The paper proposes an Integer Linear Programming based heuristic method which takes advantage of Integer Linear Programming techniques and heuristic search to improve the quality of the solutions. Extensive computational tests on the standard benchmark instances and on a new set of large sized datasets show the effectiveness of the proposed approach. 相似文献
16.
Rough set theory is one of the effective methods to feature selection, which can preserve the meaning of the features. The essence of rough set approach to feature selection is to find a subset of the original features. Since finding a minimal subset of the features is a NP-hard problem, it is necessary to investigate effective and efficient heuristic algorithms. Ant colony optimization (ACO) has been successfully applied to many difficult combinatorial problems like quadratic assignment, traveling salesman, scheduling, etc. It is particularly attractive for feature selection since there is no heuristic information that can guide search to the optimal minimal subset every time. However, ants can discover the best feature combinations as they traverse the graph. In this paper, we propose a new rough set approach to feature selection based on ACO, which adopts mutual information based feature significance as heuristic information. A novel feature selection algorithm is also given. Jensen and Shen proposed a ACO-based feature selection approach which starts from a random feature. Our approach starts from the feature core, which changes the complete graph to a smaller one. To verify the efficiency of our algorithm, experiments are carried out on some standard UCI datasets. The results demonstrate that our algorithm can provide efficient solution to find a minimal subset of the features. 相似文献
17.
Jianjun Liu K. L. Teo Xiangyu Wang Changzhi Wu 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2016,20(4):1305-1313
Differential search (DS) is a recently developed derivative-free global heuristic optimization algorithm for solving unconstrained optimization problems. In this paper, by applying the idea of exact penalty function approach, a DS algorithm, where an S-type dynamical penalty factor is introduced so as to achieve a better balance between exploration and exploitation, is developed for constrained global optimization problems. To illustrate the applicability and effectiveness of the proposed approach, a comparison study is carried out by applying the proposed algorithm and other widely used evolutionary methods on 24 benchmark problems. The results obtained clearly indicate that the proposed method is more effective and efficient over the other widely used evolutionary methods for most these benchmark problems. 相似文献
18.
计算量较大的应用程序由于需要大量的能耗,因此在电池容量有限的移动设备上运行时十分受限。云计算迁移技术是保证此类应用程序在资源有限的设备上运行的主流方法。针对无线网络中应用程序任务图的调度和迁移问题,提出了一种快速高效的启发式算法。该算法将能够迁移到云端的任务都安排在云端完成这种策略作为初始解,通过逐次计算可迁移任务在移动端运行的能耗节省量,依次将节省量最大的任务迁移到移动端,并依据任务间的通讯时间及时更新各个任务的能耗节省量。为了寻找全局最优解,构造了适用于此问题的禁忌搜索算法,给出了相应的编码方法、禁忌表、邻域解以及算法终止准则。构造的禁忌搜索算法以提出的启发式解为初始解进行全局搜索,并实现对启发解的进一步优化。通过 实验 将所提方法与无迁移、随机迁移、饱和迁移3类算法进行对比,结果表明提出的启发式算法能够快速有效地给出能耗更小的解。例如,在宽度为10的任务图上,当深度为8时,无迁移、随机迁移与饱和迁移的能耗分别为5461、3357和2271能量单位,而给出的启发解对应的能耗仅为2111。在此基础上禁忌搜索算法又将其能耗降低到1942, 这进一步说明了提出的启发式算法能够产生高质量的近似解。 相似文献
19.
用分层关联方法求有向图中所有Hamilton回路的算法 总被引:2,自引:0,他引:2
首先建立了有向图中初级通路的关联关系,并对初级通路的关联关系进行了分析,得到了关于初级通路关联关系的一些重要结果.然后,对初级通路的关联关系进行了分级分层.在此基础上,设计了求有向图中所有Hamilton回路的算法.该算法利用长度为k的初级通路及其分层关联关系逐步求长度为k+1的初级通路及其分层关联关系的方法,求得有向图的所有Hamilton回路.通过理论分析可以看到,所设计的算法与已有的求有向图的所有Hamilton回路的算法相比,避免了大量的重复计算,从而降低了算法复杂度,为求解Hamilton回路问题提供了新思路. 相似文献
20.
An optimization problem for polygonal approximation of 2-D shapes is investigated in this paper. The optimization problem for a digital contour of N points with the approximating polygon of K vertices has a search space of C(N, K) instances, i.e., the number of ways of choosing K vertices out of N points. A genetic-algorithm-based method has been proposed for determining the optimal polygons of digital curves, and its performance is better than that of several existing methods for the polygonal approximation problems. This paper proposes an efficient evolutionary algorithm (EEA) with a novel orthogonal array crossover for obtaining the optimal solution to the polygonal approximation problem. It is shown empirically that the proposed EEA outperforms the existing genetic-algorithm-based method under the same cost conditions in terms of the quality of the best solution, average solution, variance of solutions, and the convergence speed, especially in solving large polygonal approximation problems. 相似文献