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

20 articles for “Simulated Annealing Algorithm”
Set a search alert
Research ArticleOpen accessPhrase in the titleA New Innovative Cooling Law for Simulated Annealing AlgorithmsAntonella Certa, Toni Lupo, Gianfranco PassannantiThe present paper proposes an original and innovative cooling law in the field of Simulated Annealing (SA) algorithms. Particularly, such a law is based on the evolution of different initial seeds on which the algorithm works in parallel. The efficiency control of the new proposal, executed on problems of different kind, shows that the convergence quickness by using such a … …American Journal of Applied Sciences, Vol. 12, Issue 6 · 16 Jul 2015 · 6,715 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleHybridization of Genetic Algorithm with Parallel Implementation of Simulated Annealing for Job Shop SchedulingThamilselvan Rakkiannan, Balasubramanie PalanisamyProblem statement: The Job Shop Scheduling Problem (JSSP) is observed as one of the most difficult NP-hard, combinatorial problem. The problem consists of determining the most efficient schedule for jobs that are processed on several machines. Approach: In this study Genetic Algorithm (GA) is integrated with the parallel version of Simulated Annealing Algorithm (SA) is applied to the job shop … …American Journal of Applied Sciences, Vol. 9, Issue 10 · 25 Aug 2012 · 7,056 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA 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
Research ArticleOpen accessIn the keywordsSIMULATED ANNEALING APPROACH TO COST-BASED MULTI- QUALITY OF SERVICE JOB SCHEDULING IN CLOUD COMPUTING ENVIROMENTMonir Abdullah, Mohamed OthmanCloud computing environments facilitate applications by providing visualized resources that can be provisioned dynamically. The advent of cloud computing as a new model of service provisioning in distributed systems, encourages researchers to investigate its benefits and drawbacks in executing scientific applications such as workflows. One of the fundamental issues in this environment is related to task scheduling. Cloud task scheduling … …American Journal of Applied Sciences, Vol. 11, Issue 6 · 18 Mar 2014 · 7,651 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA Hybrid Retinal Image Registration Using Mutual InformationPradeepa Palraj, Ila VennilaImage registration has tremendous applications in medical industry both in diagnosis and therapy. But registering the retinal images is very difficult task because of the structural and illumination criteria. Normal registration algorithms are proved to be less effective and more complicated for such applications. This study aims at combining two methods of retinal image registration: Vessel based and non-vessel based … …American Journal of Applied Sciences, Vol. 10, Issue 11 · 18 Sep 2013 · 6,690 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA Gaussian Process Regression Model for the Traveling Salesman ProblemWanatchapong Kongkaew, Juta PichitlamkenProblem statement: Traveling Salesman Problem (TSP) is a famous NP hard problem. Many approaches have been proposed up to date for solving TSP. We consider a TSP tour as a dependent variable and its corresponding distance as an independent variable. If a predictive function can be formulated from arbitrary sample tours, the optimal tour may be predicted from this function. … …Journal of Computer Science, Vol. 8, Issue 10 · 30 Aug 2012 · 7,367 accessesView PDFCite
Research ArticleOpen accessIn the keywordsCombined Heuristic Technique for Optimization of Bloom Filter in Spam FilteringArulanand Natarajan, S. Subramanian, K. PremalathaProblem statement: Spam is an irrelevant or inappropriate message sent on the internet to a large number of newsgroups or users. A spam word is a list of well-known words that often appear in spam mails. Bloom Filter (BF) is used for identification of spam word. Approach: BF is a simple but powerful data structure that can check membership to … …Journal of Computer Science, Vol. 7, Issue 9 · 27 Jul 2011 · 7,226 accessesView PDFCite
Research ArticleOpen accessIn the keywordsApplication of Intelligence Based Genetic Algorithm for Job Sequencing Problem on Parallel Mixed-Model Assembly LineA. Norozi, M.K.A. Ariffin, N. IsmailProblem statement: In the area of globalization the degree of competition in the market increased and many companies attempted to manufacture the products efficiently to overcome the challenges faced. Approach: Mixed model assembly line was able to provide continuous flow of material and flexibility with regard to model change. The problem under study attempted to describe the mathematical programming limitation … …American Journal of Engineering and Applied Sciences, Vol. 3, Issue 1 · 31 Mar 2010 · 9,341 accessesView PDFCite
Research ArticleOpen accessIn the keywordsSimulated Annealing with Deterministic DecisionsTaisir EldosProblem statement: Simulated Annealing (SA) algorithms have been used in solving a wide range of discrete optimization problems for many years, with well know drawbacks like the computational time and difficulties related to the parameters settings. One of the other issues that open the door for research is the acceptance decision that provides for hill climbing; the standard SA algorithms … …Journal of Computer Science, Vol. 5, Issue 12 · 31 Dec 2009 · 7,119 accessesView PDFCite
Research ArticleOpen accessIn the keywordsIntegration of Genetic Algorithm with Tabu Search for Job Shop Scheduling with Unordered Subsequence Exchange CrossoverR. Thamilselvan, P. BalasubramanieProblem statement: The problem of scheduling n jobs on m machines with each job having specific machine route has been researched over the decade. The Job Shop Scheduling (JSS) is one of the hardest combinatorial optimization problems. Each resource can process at most one job at a time. Approach: This study proposes a new approach to solve a Job Shop … …Journal of Computer Science, Vol. 8, Issue 5 · 24 Feb 2012 · 6,650 accessesView PDFCite