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

12 articles for “Neighborhood Search”
Set a search alert
Research ArticleOpen accessPhrase in the titleEstimating the Claim Severity Distribution using Variable Neighborhood SearchKunjira Kingphai, Samruam ChongcharoenIn this study, Variable Neighborhood Search (VNS) is utilized to estimate the parameters of actual motor insurance claims data set and compared them obtained by the Moment Estimation Methods (MOM) and Maximum likelihood Estimation Method (MLE) which are known as a conscientious method. Then, the Kolmogorov-Smirnov test (K-S) is used to show how well the selected distribution fits the actual … …American Journal of Applied Sciences, Vol. 13, Issue 12 · 19 Dec 2016 · 7,326 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleIntegrating a Repairing-based Genetic Algorithm-Neighborhood Search Structure in Solving the Course Timetabling ProblemChong-Keat Teoh, Habibollah Haron, Antoni Wibowo, Mohd. Salihin NgadimanThe course timetabling problem is not a trivial task as it is an NP-hard and NP-complete problem and many solutions have been proposed due to its high complexity search landscape. In essence, the nature of the course timetabling problem is to assign a lecturer-course entity to existing teaching venue and timeslot in an academic institution. In this article, the authors … …Journal of Computer Science, Vol. 12, Issue 10 · 15 Dec 2016 · 7,102 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleESTIMATION OF WEIBULL PARAMETERS USING A RANDOMIZED NEIGHBORHOOD SEARCH FOR THE SEVERITY OF FIRE ACCIDENTSSoontorn Boonta, Anchalee Sattayatham, Pairote SattayathamIn this study, we applied Randomized Neighborhood Search (RNS) to estimate the Weibull parameters to determine the severity of fire accidents; the data were provided by the Thai Reinsurance Public Co., Ltd. We compared this technique with other frequently-used techniques: the Maximum Likelihood Estimator (MLE), the Method of Moments (MOM), the Least Squares Method (LSM) and the weighted least squares … …Journal of Mathematics and Statistics, Vol. 9, Issue 1 · 15 Mar 2013 · 6,928 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleA 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 accessEvery word in the titleVariable 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 PDFCite
Research ArticleOpen accessIn the keywordsNelder-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 PDFCite
Research ArticleOpen accessIn the abstractModified ACS Centroid Memory for Data ClusteringAyad Mohammed Jabbar, Ku Ruhana Ku-Mahamud, Rafid SagbanAnt Colony Optimization (ACO) is a generic algorithm, which has been widely used in different application domains due to its simplicity and adaptiveness to different optimization problems. The key component that governs the search process in this algorithm is the management of its memory model. In contrast to other algorithms, ACO explicitly utilizes an adaptive memory, which is important to … …Journal of Computer Science, Vol. 15, Issue 10 · 11 Oct 2019 · 7,641 accessesView PDFCite
Research ArticleOpen accessIn the abstractIntegration 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
Research ArticleOpen accessIn the abstractA Comparative Study of the Development Model in Education and Religion Management Process between Thailand and LaoSongkoon ChantachanProblem statement: The monks’ education was a foundation for national development. The objectives of this research were: (1) to study historical background and development of model and process of management in education and religion between Thai-Lao, (2) to study and compare the model of management in education and religion of Thai-Lao and (3) to find guidelines for collaboration in management … …Journal of Social Sciences, Vol. 7, Issue 2 · 9 Mar 2011 · 8,165 accessesView PDFCite
Research ArticleOpen accessIn the abstractFractal Images Compressing by Estimating the Closest Neighborhood with Using of Schema TheoryMahdi Jampour, Mahdi Yaghoobi, Maryam AshourzadehProblem statement: One of the methods used for compressing images and especially natural images is by benefiting from fractal features of images. Natural images have properties like Self-Similarity that can be used in image compressing. The basic approach in compressing methods is based on the fractal features and searching the best replacement block for the original image. Approach: In this … …Journal of Computer Science, Vol. 6, Issue 5 · 31 May 2010 · 6,899 accessesView PDFCite