99,376 Hits in 4.3 sec

Solving Quadratic Assignment Problem Using Water Cycle Optimization Algorithm

Maryam Parhizgar
2014 International Journal of Intelligent Information Systems  
The implementation of proposed algorithms on standard test functions and also its result comparison with other meta-heuristics algorithms express algorithm's desirable quality and its prominence to other  ...  meta-heuristics algorithms.  ...  Implementation of proposed algorithm on standard test functions and also its comparison with other meta-heuristics algorithms express desirable quality and its prominence to other meta-heuristics algorithms  ... 
doi:10.11648/j.ijiis.s.2014030601.24 fatcat:m6ddyoppwncfpen4khvn4wtkxm

Steiner tree methods for optimal sub-network identification: an empirical study

Afshin Sadeghi, Holger Fröhlich
2013 BMC Bioinformatics  
Results: Here we conducted a systematic simulation study of four different approximate and one exact algorithms on a large human protein-protein interaction network with~14,000 nodes and~400,000 edges.  ...  Our devised algorithm for merged Steiner trees, which is a further development of the Takahashi and Matsuyama algorithm, proved to be useful for small seed lists.  ...  Comparison to exact steiner tree algorithm We next investigated the accuracy of the best of our tested Steiner tree heuristics, namely the shortest paths based algorithm, in comparison to the exact Steiner  ... 
doi:10.1186/1471-2105-14-144 pmid:23627667 pmcid:PMC3674966 fatcat:wek7brbtlzas5mwltpzksumwfm

Exact and Inexact Scheduling Algorithms for Multiple Earth Observation Satellites Under Uncertainties of Clouds

Jianjiang Wang, Erik Demeulemeester, Dishan Qiu, Jin Liu
2015 Social Science Research Network  
To solve the problem efficiently under different scenarios, we propose an exact algorithm and some heuristic algorithms.  ...  Furthermore, we design five heuristics to solve the large-scale problems that generally fail to be solved by the exact algorithm due to the large space complexity.  ...  This research was also supported by the National Natural Science Foundation of China under Grants No. 61104180, and No. 71271213.  ... 
doi:10.2139/ssrn.2634934 fatcat:sxew5k7ysjdsvhddzzist5djmi

On the Metaheuristics Approach to the Problem of Genetic Sequence Comparison and Its Parallel Implementation

Sergey Makarkin, Boris Melnikov, Alexander Panin
2013 Applied Mathematics  
We propose several heuristics; compare results achieved when using those heuristics and compare parallel and sequential implementation of proposed approach.  ...  By this approach, one can define a whole new class of metrics on a set of strings; some of this metrics can lead to interesting results when used for string comparison.  ...  ., in different sub-problems of the same discrete optimization problem) different heuristics relatively perform better? (This question is true for both exact and unfinished algorithms).  ... 
doi:10.4236/am.2013.410a1006 fatcat:w2p5dxz5tzepdps76smuiiad2i

Approaches to solve cell formation, machine layout and cell layout problem: A Review

J.N. Patel, S.V. Patel
2014 Transactions on Machine Learning and Artificial Intelligence  
An attempt has been done in this paper to review such approaches based on heuristics, meta-heuristics, hybrid methods and exact solution methods developed by past researchers to solve these problems.  ...  The main objective of this review paper is to find out the effective and efficient approaches by comparing them based on performance criteria, their benefits and drawbacks in solving cellular manufacturing  ...  Section 3 presents review & comparison of approaches such as heuristics, meta-heuristics, hybrid methods and exact solution methods taken from literature to solve cell formation, machine layout and cell  ... 
doi:10.14738/tmlai.25.600 fatcat:lojcd2i4fvdxfh6us6ur7lwpdy

The Use of an Exact Algorithm within a Tabu Search Maximum Clique Algorithm

Derek H. Smith, Roberto Montemanni, Stephanie Perkins
2020 Algorithms  
The exact algorithm uses a graph coloring upper bound for pruning, and the best such algorithm to use in this context is considered.  ...  It is compared with a state-of-the-art algorithm that does not use exact search.  ...  In the main heuristic of the original HTS algorithm, a sequence S is selected.  ... 
doi:10.3390/a13100253 fatcat:7panffvgengwnoq4votm6wwkvu

A hybrid genetic algorithm for the discrete time–cost trade-off problem

Rifat Sonmez, Önder Halis Bettemir
2012 Expert systems with applications  
(QSA) and the Hybrid method that combines Genetic Algorithm with Simulated Annealing (HGASA).  ...  In this paper the Sudoku problem is solved using stochastic search techniques and these are: Cultural Genetic Algorithm (CGA), Repulsive Particle Swarm Optimization (RPSO), Quantum Simulated Annealing  ...  In a comparison of five evolutionary based algorithms, GAs showed the worse performance for the DTCTP (Elbeltagi, Hegazy, & Grierson, 2005) .  ... 
doi:10.1016/j.eswa.2012.04.019 fatcat:62d6xgcvlfah5fv7uyg6dig3rq

Ensemble of meta-heuristic and exact algorithm based on the divide and conquer framework for multi-satellite observation scheduling [article]

Guohua Wu, Qizhang Luo, Xiao Du, Xinwei Wang, Yinguo Chen, Ponnuthurai Nagaratnam Suganthan
2021 arXiv   pre-print
To solve the large-scale multi-satellite observation scheduling problem, this paper proposes an ensemble of meta-heuristic and exact algorithm based on a divide-and-conquer framework (EHE-DCF), including  ...  To validate the performance of EHE-DCF, we compare it with B&B, three divide-and-conquer based meta-heuristics, and a state-of-the-art meta-heuristic.  ...  ENSEMBLE OF HEURISTIC AND EXACT ALGORITHM A.  ... 
arXiv:2007.03644v2 fatcat:5fpj5xiynfetxevwdjjam5ezum

Heuristic initialization for bipartite matching problems

Johannes Langguth, Fredrik Manne, Peter Sanders
2010 ACM Journal of Experimental Algorithmics  
We compare combinations of several known heuristics and exact algorithms to find fast combined methods, using real-world matrices as well as randomly generated instances.  ...  In addition, we present a new heuristic aimed at obtaining high-quality matchings and compare its impact on bipartite matching algorithms with that of other heuristics.  ...  As this is not directly proportional to the quality of the initialization, but largely dependent on the exact algorithm used, we have to compare pairings of heuristics and exact algorithms for a proper  ... 
doi:10.1145/1671970.1712656 fatcat:4xfvvxyzijbsrhnoic23juhe54

Improved extremal optimization for the Ising spin glass

A. Alan Middleton
2004 Physical Review E  
A version of the extremal optimization (EO) algorithm introduced by Boettcher and Percus is tested on 2D and 3D spin glasses with Gaussian disorder.  ...  Relative to EO, this adaptive algorithm finds exact ground states with a speed-up of order 10^4 (10^2) for 16^2- (8^3-) spin samples.  ...  DMR-0109164 and No. DMR-0219292).  ... 
doi:10.1103/physreve.69.055701 pmid:15244875 fatcat:itfwmh3x5rfjtn5dgf4awisple

Locally optimal heuristic for modularity maximization of networks

Sonia Cafieri, Pierre Hansen, Leo Liberti
2011 Physical Review E  
heuristic of Clauset, Newman and Moore [Phys.  ...  They show that the proposed divisive heuristic gives better results than the divisive heuristic of Newman and than the agglomerative heuristic of Clauset et al.  ...  Table 3 : Comparison of results of the divisive Kernighan-Lin based heuristic (KL), the proposed locally optimal divisive heuristic (divisive CHL), and an exact algorithm for modularity maximization [  ... 
doi:10.1103/physreve.83.056105 pmid:21728603 fatcat:ft5nnitfnzg6ho3d35nbpou7ja

Heuristics Core Mapping in On-Chip Networks for Parallel Stream-Based Applications [chapter]

Piotr Dziurzanski, Tomasz Maka
2008 Lecture Notes in Computer Science  
We provide a new multi-path routing algorithm together with heuristic algorithms for core mapping so that minimize the total transfer in the hardware implementation.  ...  A novel approach for implementation of multimedia streaming applications into mesh Networks on Chips structure is proposed.  ...  We provided three heuristic mapping algorithms and compared them with the exact solutions.  ... 
doi:10.1007/978-3-540-69384-0_48 fatcat:iupvk3vgtrhrxpzzh5xohf3xyy

A Review and Comparison of Genetic Algorithms for the 0-1 Multidimensional Knapsack Problem

Bernhard Lienland, Li Zeng
2015 International Journal of Operations Research and Information Systems  
The authors validated fitness values and required computation times in varying problem types and environments. Results demonstrate the superiority of one GA.  ...  Therefore, to identify the "best" genetic algorithm, this article reviews and compares 11 existing GAs.  ...  Two general approaches on solving the 0-1 MKP have emerged during the past decades: exact methods and heuristics. Even though exact methods (cf. Martello et al., 1999 (cf.  ... 
doi:10.4018/ijoris.2015040102 fatcat:wq3po5pfnrbnbcfun6ynnwug3q

Effective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons

Mahdi Bashiri, Hossein Karimi
2012 Journal of Industrial Engineering International  
Effective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons Journal of Industrial Engineering International Provided in Cooperation with  ...  Results indicate that TS is the best in 31% of QAPs, and the IFLS method, which is in the literature, is the best in 58 % of QAPs; these two methods are the same in 11% of test problems.  ...  Acknowledgments The authors would like to thank the anonymous referees for their constructive comments on earlier version of this work.  ... 
doi:10.1186/2251-712x-8-6 fatcat:iqdtpfrch5goljytug7ujqjjpm

Using a Lagrangian heuristic for a combinatorial auction problem

Y. Guo, A. Lim, B. Rodrigues, J. Tang
2005 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)  
In this paper, a combinatorial auction problem is modeled as a NP-complete set packing problem and a Lagrangian relaxation based heuristic algorithm is proposed.  ...  Comparisons with CPLEX 8.0 are also provided, which show that the algorithm provides good solutions.  ...  Non-exact algorithms, using iterative greedy heuristic [6] , and stochastic local search [5] can be found in recent literature.  ... 
doi:10.1109/ictai.2005.126 dblp:conf/ictai/GuoLRT05 fatcat:iljaouwlo5a2tmxw5xp3tkpudu
« Previous Showing results 1 — 15 out of 99,376 results