Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

28 results for “heuristics”
Set a search alert
Literature ReviewOpen accessEvery word in the titleA Review on Heuristics for Addition Chain Problem: Towards Efficient Public Key CryptosystemsAdamu Muhammad Noma, Abdullah Muhammed, Mohamad Afendee Mohamed, Zuriati Ahmad ZulkarnainField exponentiation and scalar multiplication are the pillars of and the most computationally expensive operations in the public key cryptosystems. Optimizing the operation is the key to the efficiency of the systems. Analogous to the optimization is solving addition chain problem. In this study, we survey from the onset of the addition chain problem to the state-of-the-art heuristics for optimizing … …Journal of Computer Science, Vol. 13, Issue 8 · 1 Jun 2017 · 8,163 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleBenders' Decomposition Based Heuristics for Large-Scale Dynamic Quadratic Assignment ProblemsSirirat Muenvanichakul, Peerayuth CharnsethikulProblem statement: Dynamic Quadratic Assignment Problem (DQAP) is NP hard problem. Benders decomposition based heuristics method is applied to the equivalent mixed-integer linear programming problem of the original DQAP. Approach: Approximate Benders Decomposition (ABD) generates the ensemble of a subset of feasible layout for Approximate Dynamic Programming (ADP) to determine the sub-optimal optimal solution. A Trust-Region Constraint (TRC) for the … …Journal of Computer Science, Vol. 5, Issue 1 · 31 Jan 2009 · 7,681 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleImplementation Weather-Type Models of Capacitated Arc Routing Problem via HeuristicsZuhaimy Ismail, Mohammad Fadzli RamliProblem statement: In this study, we introduced a new and real-life condition of Capacitated Arc Routing Problem (CARP), a model that represents vehicle’s operation in waste collection. In general, we studied the element of rain drops that affected the collected waste weight in total by imposed a new variable namely rainy weight age. In rainy days, the household refusals did … …American Journal of Applied Sciences, Vol. 8, Issue 4 · 18 Apr 2011 · 7,267 accessesView PDFCite
Research ArticleOpen accessIn the keywordsStatic Batch Mode Heuristic Algorithm for Mapping Independent Tasks in Computational GridR. Vijayalakshmi, V. VasudevanGrid computing plays an important role in solving large-scale computational problems in a high performance computing environment. Scheduling of tasks to efficient and best suitable resource is one of the most challenging phase in grid computing systems. Grid environment reveals several challenges in efficient scheduling of complex applications because of its heterogeneity, dynamic behavior and shared resources. Scheduling of independent … …Journal of Computer Science, Vol. 11, Issue 1 · 22 Sep 2014 · 7,429 accessesView PDFCite
Research ArticleOpen accessIn the keywordsAnt Colony Optimization for Capacitated Vehicle Routing ProblemW. F. Tan, L. S. Lee, Z. A. Majid, H. V. SeowProblem statement: The Capacitated Vehicle Routing Problem (CVRP) is a well-known combinatorial optimization problem which is concerned with the distribution of goods between the depot and customers. It is of economic importance to businesses as approximately 10-20% of the final cost of the goods is contributed by the transportation process. Approach: This problem was tackled using an Ant Colony Optimization … …Journal of Computer Science, Vol. 8, Issue 6 · 15 Mar 2012 · 10,043 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA Variable Neighborhood Search Algorithm for Assigning Cells to Switches in Wireless NetworksMatthieu Andr, Gilles Pesant, Samuel PierreThe problem of assigning cells to switches in wireless networks consists of minimizing the total operating cost, that is, the cost of linking cells to switches and the cost of handover from one cell to another, by taking into account factors such as network topology, switch capacity and traffic load in the entire network. Such a problem is well known … …Journal of Computer Science, Vol. 1, Issue 2 · 30 Jun 2005 · 6,748 accessesView PDFCite
Research ArticleOpen accessIn the keywordsSlime Mould Reproduction: A New Optimization Algorithm for Constrained Engineering ProblemsRajalakshmi Sakthivel, Kanmani SelvaduraiIn recent explorations of biologically inspired optimization strategies, the Slime Mould Reproduction (SMR) algorithm emerges as an innovative meta-heuristic optimization technique. This algorithm is deeply rooted in the reproductive dynamics observed in slime molds, particularly the intricate balance these organisms strike between local and global spore dispersal. By replicating this balance, the SMR algorithm deftly navigates between exploration and exploitation … …Journal of Computer Science, Vol. 20, Issue 1 · 21 Dec 2023 · 5,943 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA Review of Covering Arrays and Their Application to Software TestingBestoun S. Ahmed, Kamal Z. ZamliProblem statement: As a complex logic system, software may suffer from different source of faults. Those faults can be avoided by applying different testing processes. It appears recently that the interaction among the system factors represents a common source of faults. Software function properly, all input factors and their interactions of the software need to be tested i.e., exhaustive testing. … …Journal of Computer Science, Vol. 7, Issue 9 · 23 Jul 2011 · 8,707 accessesView PDFCite
Research ArticleOpen accessIn the keywordsSolving One-Dimensional Cutting Stock Problem with Discrete Demands and Capacitated Planning ObjectiveSirirat Wongprakornkul, Peerayuth CharnsethikulProblem statement: One-dimensional cutting stock problem with discrete demands and capacitated planning objective is an NP hard problem. Approach: The mathematical model with column-generation technique by a branch-and-bound procedure and the heuristic based on the first fit decreasing method are proposed. Then, both approaches were compared and some characteristics were investigated such as upper-bound value, percentage above lower-bound value, computation … …Journal of Mathematics and Statistics, Vol. 6, Issue 2 · 30 Jun 2010 · 7,947 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA Scheduling Algorithm Based on Petri Nets and Simulated AnnealingRachida Hadiby Ghoul, Abdelhamid Benjelloul, Sihem Kechida, Hicham TebbikhThis study aims at presenting a hybrid Flexible Manufacturing System "HFMS" short-term scheduling problem. Based on the art state of general scheduling algorithms, we present the meta-heuristic, we have decided to apply for a given example of HFMS. That was the study of Simulated Annealing Algorithm SA. The HFMS model based on hierarchical Petri nets, was used to represent static … …American Journal of Applied Sciences, Vol. 4, Issue 5 · 31 May 2007 · 7,164 accessesView PDFCite