共查询到20条相似文献,搜索用时 15 毫秒
1.
Prasanna Balaprakash Mauro Birattari Thomas Stützle Zhi Yuan Marco Dorigo 《Swarm Intelligence》2009,3(3):223-242
The use of ant colony optimization for solving stochastic optimization problems has received a significant amount of attention
in recent years. In this paper, we present a study of enhanced ant colony optimization algorithms for tackling a stochastic
optimization problem, the probabilistic traveling salesman problem. In particular, we propose an empirical estimation approach to evaluate the cost of the solutions constructed by the ants.
Moreover, we use a recent estimation-based iterative improvement algorithm as a local search. Experimental results on a large
number of problem instances show that the proposed ant colony optimization algorithms outperform the current best algorithm
tailored to solve the given problem, which also happened to be an ant colony optimization algorithm. As a consequence, we
have obtained a new state-of-the-art ant colony optimization algorithm for the probabilistic traveling salesman problem. 相似文献
2.
State-space search strategies gleaned from animal behavior: a traveling salesman experiment 总被引:10,自引:0,他引:10
Alexandre Linhares 《Biological cybernetics》1998,78(3):167-173
A widespread search strategy employed by predators in both vertebrate and invertebrate phyla is the well-known area-restricted
search strategy. The generality, simplicity, and effectiveness of this strategy have made it emerge many times during the
course of natural selection. In this work, an artificial intelligence state-space search procedure is developed using search
guidelines gleaned from the foraging behavior of predators. This procedure, which we call predatory search, has been implemented
on a NP-Hard combinatorial problem: the traveling salesman problem. Numerical results are presented for a limited set of benchmark
problems, and area-restricted search seems to be effective: We have been able to find the optimal solution to, among others,
a 400-city Manhattan problem.
Received: 9 July 1997 / Accepted in revised form: 24 November 1997 相似文献
3.
Vui Ann Shim Kay Chen Tan Jun Yong Chia Jin Kiat Chong 《Flexible Services and Manufacturing Journal》2011,23(2):207-241
This paper studies the application of evolutionary algorithms for bi-objective travelling salesman problem. Two evolutionary algorithms, including estimation of distribution algorithm (EDA) and genetic algorithm (GA), are considered. The solution to this problem is a set of trade-off alternatives. The problem is solved by optimizing the order of the cities so as to simultaneously minimize the two objectives of travelling distance and travelling cost incurred by the travelling salesman. In this paper, binary-representation-based evolutionary algorithms are replaced with an integer-representation. Three existing EDAs are altered to use this integer-representation, namely restricted Boltzmann machine (RBM), univariate marginal distribution algorithm (UMDA), and population-based incremental learning (PBIL). Each city is associated with a representative integer, and the probability of any of this representative integer to be located in any position of the chromosome is constructed through the modeling approach of the EDAs. New sequences of cities are obtained by sampling from the probabilistic model. A refinement operator and a local search operator are proposed in this piece of work. The EDAs are subsequently hybridized with GA in order to complement the limitations of both algorithms. The effect that each of these operators has on the quality of the solutions are investigated. Empirical results show that the hybrid algorithms are capable of finding a set of good trade-off solutions. 相似文献
4.
Károly F. Pál 《Biological cybernetics》1993,69(5-6):539-546
We apply strategies inspired by natural evolution to a classical example of discrete optimization problems, the traveling salesman problem. Our algorithms are based on a new knowledge-augmented crossover operation. Even if we use only this operation in the reproduction process, we get quite good results. The most obvious faults of the solutions can be eliminated and the results can further be improved by allowing for a simple form of mutation. If each crossover is followed by an affordable local optimization, we get the optimum solution for a 318-town problem, probably the optimum solutions for several different 100-town problems, and very nearly optimum solutions for 350-town and 1000-town problems. A new strategy for the choice of parents considerably speeds up the convergence of the latter method. 相似文献
5.
D. B. Fogel 《Biological cybernetics》1988,60(2):139-144
Evolutionary optimization has been proposed as a method to generate machine learning through automated discovery. A simulation of natural evolution is conducted using the traveling salesman problem as an artificial environment. For an exact solution of a traveling salesman problem, the only known algorithms require the number of steps to grow at least exponentially with the number of elements in the problem. Three adaptive techniques are described and analyzed. Evolutionary adaptation is demonstrated to be worthwhile in a variety of contexts. Local stagnation is prevented by allowing for the probabilistic survival of the simulated organisms. In complex problems, the final routing is estimated to be better than 99.99999999999% of all possible tours, even though only a small fraction (8.58 × 10–151) of the total number of tours are examined. 相似文献
6.
We introduce a DNA encoding method to represent numerical values and a biased molecular algorithm based on the thermodynamic properties of DNA. DNA strands are designed to encode real values by variation of their melting temperatures. The thermodynamic properties of DNA are used for effective local search of optimal solutions using biochemical techniques, such as denaturation temperature gradient polymerase chain reaction and temperature gradient gel electrophoresis. The proposed method was successfully applied to the traveling salesman problem, an instance of optimization problems on weighted graphs. This work extends the capability of DNA computing to solving numerical optimization problems, which is contrasted with other DNA computing methods focusing on logical problem solving. 相似文献
7.
The fruit fly optimization algorithm (FOA) is a newly developed bio-inspired algorithm. The continuous variant version of FOA has been proven to be a powerful evolutionary approach to determining the optima of a numerical function on a continuous definition domain. In this study, a discrete FOA (DFOA) is developed and applied to the traveling salesman problem (TSP), a common combinatorial problem. In the DFOA, the TSP tour is represented by an ordering of city indices, and the bio-inspired meta-heuristic search processes are executed with two elaborately designed main procedures: the smelling and tasting processes. In the smelling process, an effective crossover operator is used by the fruit fly group to search for the neighbors of the best-known swarm location. During the tasting process, an edge intersection elimination (EXE) operator is designed to improve the neighbors of the non-optimum food location in order to enhance the exploration performance of the DFOA. In addition, benchmark instances from the TSPLIB are classified in order to test the searching ability of the proposed algorithm. Furthermore, the effectiveness of the proposed DFOA is compared to that of other meta-heuristic algorithms. The results indicate that the proposed DFOA can be effectively used to solve TSPs, especially large-scale problems. 相似文献
8.
D.John Anderson 《Theoretical population biology》1983,24(2):145-159
Optimal foraging models are examined that assume animals forage for discrete point resources on a plane and attempt to minimize their travel distance between resources. This problem is similar to the well-known traveling salesman problem: A salesman must choose the shortest path from his home office to all cities on his itinerary and back to his home office again. The traveling salesman problem is in a class of enigmatic problems, called NP-complete, which can be so difficult to solve that animals might be incapable of finding the best solution. Two major results of this analysis are: (1) The simple foraging strategy of always moving to the closest resource site does surprisingly well. More sophisticated strategies of “looking ahead” a small number of steps, choosing the shortest path, then taking a step, do worse if all the resource sites are visited, but do slightly better (less than 10%) if not all the resource sites are visited. (2) Short cyclical foraging routes resulted when resources were allowed to renew. This is suggested as an alternative explanation for “trap-lining” in animals that forage for discrete, widely separated resources. 相似文献
9.
This paper aims to present a new genetic approach that uses rank distance for solving two known NP-hard problems, and to compare rank distance with other distance measures for strings. The two NP-hard problems we are trying to solve are closest string and closest substring. For each problem we build a genetic algorithm and we describe the genetic operations involved. Both genetic algorithms use a fitness function based on rank distance. We compare our algorithms with other genetic algorithms that use different distance measures, such as Hamming distance or Levenshtein distance, on real DNA sequences. Our experiments show that the genetic algorithms based on rank distance have the best results. 相似文献
10.
Genetic algorithms are powerful search methods inspired by Darwinian evolution. To date, they have been applied to the solution of many optimization problems because of the easy use of their properties and their robustness in finding good solutions to difficult problems. The good operation of genetic algorithms is due in part to its two main variation operators, namely, crossover and mutation operators. Typically, in the literature, we find the use of a single crossover and mutation operator. However, there are studies that have shown that using multi-operators produces synergy and that the operators are mutually complementary. Using multi-operators is not a simple task because which operators to use and how to combine them must be determined, which in itself is an optimization problem. In this paper, it is proposed that the task of exploring the different combinations of the crossover and mutation operators can be carried out by evolutionary computing. The crossover and mutation operators used are those typically used for solving the traveling salesman problem. The process of searching for good combinations was effective, yielding appropriate and synergic combinations of the crossover and mutation operators. The numerical results show that the use of the combination of operators obtained by evolutionary computing is better than the use of a single operator and the use of multi-operators combined in the standard way. The results were also better than those of the last operators reported in the literature. 相似文献
11.
Endo TA 《Bioinformatics (Oxford, England)》2004,20(14):2181-2188
MOTIVATION: Developing a new method of assembling small sequences based on sequencing by hybridization with many positive and negative faults. First, an interpretation of a generic traveling salesman problem is provided (i.e. finding the shortest route for visiting many cities), using genetic algorithms. Second, positive errors are excluded before assembly by a sanitization process. RESULTS: The present method outperforms those described in previous studies, in terms of both time and accuracy. AVAILABILITY: http://kamit.med.u-tokai.ac.jp/~takaho/sbh/index.html 相似文献
12.
The goal of linkage mapping is to find the true order of loci from a chromosome. Since the number of possible orders is large even for a modest number of loci, the problem of finding the optimal solution is known as a NP-hard problem or traveling salesman problem (TSP). Although a number of algorithms are available, many either are low in the accuracy of recovering the true order of loci or require tremendous amounts of computational resources, thus making them difficult to use for reconstructing a large-scale map. We developed in this article a novel method called unidirectional growth (UG) to help solve this problem. The UG algorithm sequentially constructs the linkage map on the basis of novel results about additive distance. It not only is fast but also has a very high accuracy in recovering the true order of loci according to our simulation studies. Since the UG method requires n-1 cycles to estimate the ordering of n loci, it is particularly useful for estimating linkage maps consisting of hundreds or even thousands of linked codominant loci on a chromosome. 相似文献
13.
In this paper, we introduce the MAF-ACO algorithm, which emulates the foraging behavior of ants found in nature. In addition
to the usual pheromone model present in ACO algorithms, we introduce an incremental learning component. We view the components
of the MAF-ACO algorithm as stochastic approximation algorithms and use the ordinary differential equation (o.d.e.) method
to analyze their convergence. We examine how the local stigmergic interaction of the individual ants results in an emergent
dynamic programming framework. The MAF-ACO algorithm is also applied to the multi-stage shortest path problem and the traveling
salesman problem.
Research of Prof. V.S. Borkar was supported in part by grant no. III.5(157)/99-ET and a J.C. Bose Fellowship from the Department
of Science and Technology, Government of India. 相似文献
14.
Konstantin Klemm Anita Mehta Peter F. Stadler 《Bulletin of mathematical biology》2018,80(8):2154-2176
The traditional way of tackling discrete optimization problems is by using local search on suitably defined cost or fitness landscapes. Such approaches are however limited by the slowing down that occurs when the local minima that are a feature of the typically rugged landscapes encountered arrest the progress of the search process. Another way of tackling optimization problems is by the use of heuristic approximations to estimate a global cost minimum. Here, we present a combination of these two approaches by using cover-encoding maps which map processes from a larger search space to subsets of the original search space. The key idea is to construct cover-encoding maps with the help of suitable heuristics that single out near-optimal solutions and result in landscapes on the larger search space that no longer exhibit trapping local minima. We present cover-encoding maps for the problems of the traveling salesman, number partitioning, maximum matching and maximum clique; the practical feasibility of our method is demonstrated by simulations of adaptive walks on the corresponding encoded landscapes which find the global minima for these problems. 相似文献
15.
In this paper, we propose a method of reducing topological defects in self-organizing maps (SOMs) using multiple scale neighborhood functions. The multiple scale neighborhood functions are inspired by multiple scale channels in the human visual system. To evaluate the proposed method, we applied it to the traveling salesman problem (TSP), and examined two indexes: the tour length of the solution and the number of kinks in the solution. Consequently, the two indexes are lower for the proposed method. These results indicate that our proposed method has the ability to reduce topological defects. 相似文献
16.
Bansal Mukul S. Eulenstein Oliver Wehe Andr 《IEEE/ACM transactions on computational biology and bioinformatics / IEEE, ACM》2009,6(2):221-231
The gene-duplication problem is to infer a species supertree from a collection of gene trees that are confounded by complex histories of gene-duplication events. This problem is NP-complete and thus requires efficient and effective heuristics. Existing heuristics perform a stepwise search of the tree space, where each step is guided by an exact solution to an instance of a local search problem. A classical local search problem is the {tt NNI} search problem, which is based on the nearest neighbor interchange operation. In this work, we 1) provide a novel near-linear time algorithm for the {tt NNI} search problem, 2) introduce extensions that significantly enlarge the search space of the {tt NNI} search problem, and 3) present algorithms for these extended versions that are asymptotically just as efficient as our algorithm for the {tt NNI} search problem. The exceptional speedup achieved in the extended {tt NNI} search problems makes the gene-duplication problem more tractable for large-scale phylogenetic analyses. We verify the performance of our algorithms in a comparison study using sets of large randomly generated gene trees. 相似文献
17.
Schutte JF Koh BI Reinbolt JA Haftka RT George AD Fregly BJ 《Journal of biomechanical engineering》2005,127(3):465-474
Optimization is frequently employed in biomechanics research to solve system identification problems, predict human movement, or estimate muscle or other internal forces that cannot be measured directly. Unfortunately, biomechanical optimization problems often possess multiple local minima, making it difficult to find the best solution. Furthermore, convergence in gradient-based algorithms can be affected by scaling to account for design variables with different length scales or units. In this study we evaluate a recently-developed version of the particle swarm optimization (PSO) algorithm to address these problems. The algorithm's global search capabilities were investigated using a suite of difficult analytical test problems, while its scale-independent nature was proven mathematically and verified using a biomechanical test problem. For comparison, all test problems were also solved with three off-the-shelf optimization algorithms--a global genetic algorithm (GA) and multistart gradient-based sequential quadratic programming (SQP) and quasi-Newton (BFGS) algorithms. For the analytical test problems, only the PSO algorithm was successful on the majority of the problems. When compared to previously published results for the same problems, PSO was more robust than a global simulated annealing algorithm but less robust than a different, more complex genetic algorithm. For the biomechanical test problem, only the PSO algorithm was insensitive to design variable scaling, with the GA algorithm being mildly sensitive and the SQP and BFGS algorithms being highly sensitive. The proposed PSO algorithm provides a new off-the-shelf global optimization option for difficult biomechanical problems, especially those utilizing design variables with different length scales or units. 相似文献
18.
BACKGROUND: Several deterministic and stochastic combinatorial optimization algorithms have been applied to computational protein design and homology modeling. As structural targets increase in size, however, it has become necessary to find more powerful methods to address the increased combinatorial complexity. RESULTS: We present a new deterministic combinatorial search algorithm called 'Branch-and-Terminate' (B&T), which is derived from the Branch-and-Bound search method. The B&T approach is based on the construction of an efficient but very restrictive bounding expression, which is used for the search of a combinatorial tree representing the protein system. The bounding expression is used both to determine the optimal organization of the tree and to perform a highly effective pruning procedure named 'termination'. For some calculations, the B&T method rivals the current deterministic standard, dead-end elimination (DEE), sometimes finding the solution up to 21 times faster. A more significant feature of the B&T algorithm is that it can provide an efficient way to complete the optimization of problems that have been partially reduced by a DEE algorithm. CONCLUSIONS: The B&T algorithm is an effective optimization algorithm when used alone. Moreover, it can increase the problem size limit of amino acid sidechain placement calculations, such as protein design, by completing DEE optimizations that reach a point at which the DEE criteria become inefficient. Together the two algorithms make it possible to find solutions to problems that are intractable by either algorithm alone. 相似文献
19.
Assignment of orthologous genes via genome rearrangement 总被引:1,自引:0,他引:1
Chen X Zheng J Fu Z Nan P Zhong Y Lonardi S Jiang T 《IEEE/ACM transactions on computational biology and bioinformatics / IEEE, ACM》2005,2(4):302-315
The assignment of orthologous genes between a pair of genomes is a fundamental and challenging problem in comparative genomics. Existing methods that assign orthologs based on the similarity between DNA or protein sequences may make erroneous assignments when sequence similarity does not clearly delineate the evolutionary relationship among genes of the same families. In this paper, we present a new approach to ortholog assignment that takes into account both sequence similarity and evolutionary events at a genome level, where orthologous genes are assumed to correspond to each other in the most parsimonious evolving scenario under genome rearrangement. First, the problem is formulated as that of computing the signed reversal distance with duplicates between the two genomes of interest. Then, the problem is decomposed into two new optimization problems, called minimum common partition and maximum cycle decomposition, for which efficient heuristic algorithms are given. Following this approach, we have implemented a high-throughput system for assigning orthologs on a genome scale, called SOAR, and tested it on both simulated data and real genome sequence data. Compared to a recent ortholog assignment method based entirely on homology search (called INPARANOID), SOAR shows a marginally better performance in terms of sensitivity on the real data set because it is able to identify several correct orthologous pairs that are missed by INPARANOID. The simulation results demonstrate that SOAR, in general, performs better than the iterated exemplar algorithm in terms of computing the reversal distance and assigning correct orthologs. 相似文献
20.
This paper proposes a novel method to improve the efficiency of a swarm of robots searching in an unknown environment. The approach focuses on the process of feeding and individual coordination characteristics inspired by the foraging behavior in nature. A predatory strategy was used for searching; hence, this hybrid approach integrated a random search technique with a dynamic particle swarm optimization (DPSO) search algorithm. If a search robot could not find any target information, it used a random search algorithm for a global search. If the robot found any target information in a region, the DPSO search algorithm was used for a local search. This particle swarm optimization search algorithm is dynamic as all the parameters in the algorithm are refreshed synchronously through a communication mechanism until the robots find the target position, after which, the robots fall back to a random searching mode. Thus, in this searching strategy, the robots alternated between two searching algorithms until the whole area was covered. During the searching process, the robots used a local communication mechanism to share map information and DPSO parameters to reduce the communication burden and overcome hardware limitations. If the search area is very large, search efficiency may be greatly reduced if only one robot searches an entire region given the limited resources available and time constraints. In this research we divided the entire search area into several subregions, selected a target utility function to determine which subregion should be initially searched and thereby reduced the residence time of the target to improve search efficiency. 相似文献