15 results for “Local Search Algorithms”

Set a search alert

Research ArticleOpen accessIn the abstractVariable Neighborhood Simplex Search Methods for Global Optimization ModelsPongchanun LuangpaiboonProblem statement: Many optimization problems of practical interest are encountered in various fields of chemical, engineering and management sciences. They are computationally intractable. Therefore, a practical algorithm for solving such problems is to employ approximation algorithms that can find nearly optimums within a reasonable amount of computational time. Approach: In this study the hybrid methods combining the Variable Neighborhood Search … …Journal of Computer Science, Vol. 8, Issue 4 · 15 Feb 2012 · 6,510 accessesView PDF Cite

Research ArticleOpen accessIn the abstractA New Cooperative Algorithm Based on PSO and K-Means for Data ClusteringMehdi Neshat, Shima Farshchian Yazdi, Daneyal Yazdani, Mehdi SargolzaeiProblem statement: Data clustering has been applied in multiple fields such as machine learning, data mining, wireless sensor networks and pattern recognition. One of the most famous clustering approaches is K-means which effectively has been used in many clustering problems, but this algorithm has some drawbacks such as local optimal convergence and sensitivity to initial points. Approach: Particle Swarm Optimization … …Journal of Computer Science, Vol. 8, Issue 2 · 19 Nov 2011 · 7,967 accessesView PDF Cite

Research ArticleOpen accessIn the abstractHybridization of Neural Learning Algorithms Using Evolutionary and Discrete Gradient ApproachesRanadhir Ghosh, John Yearwood, Moumita Ghosh, Adil BagirovIn this study we investigated a hybrid model based on the Discrete Gradient method and an evolutionary strategy for determining the weights in a feed forward artificial neural network. Also we discuss different variants for hybrid models using the Discrete Gradient method and an evolutionary strategy for determining the weights in a feed forward artificial neural network. The Discrete Gradient … …Journal of Computer Science, Vol. 1, Issue 3 · 30 Sep 2005 · 6,587 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordFINDING A RESIDENCE WITH ALL FACILITIES USING NEAREST NEIGHBOR SEARCHK. Padmapriya, Dr. S. SridharNearest neighbor search is one of the most widely-used techniques and its applications including mobile communication, Geographic information systems, bioinformatics, computer vision and marketing. For example, four friends want to rent an apartment which should be nearer to their working places. Our paper discussed about the problems on finding the most appropriate location among a set of available places. The … …Journal of Computer Science, Vol. 10, Issue 6 · 1 Feb 2014 · 6,803 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordNelder-Mead Method with Local Selection Using Neighborhood and Memory for Stochastic OptimizationNoocharin Tippayawannakorn, Juta PichitlamkenWe consider the Nelder-Mead (NM) simplex algorithm for optimization of discrete-event stochastic simulation models. We propose new modifications of NM to reduce computational time and to improve quality of the estimated optimal solutions. Our means include utilizing past information of already seen solutions, expanding search space to their neighborhood and using adaptive sample sizes. We compare performance of these extensions … …Journal of Computer Science, Vol. 9, Issue 4 · 10 May 2013 · 6,121 accessesView PDF Cite