147 results for “solving problems”

Set a search alert

Research ArticleOpen accessAll words, across the recordSolving Two Deadlock Cycles through Neighbor Replication on Grid Deadlock Detection ModelNoriyani Mohd Zin, A. Noraziah, Ahmed N. Abdalla, Ainul Azila CheFauziA data grid is compose of hundreds of geographically distributed computers and storage resources usually locate under different places and enables users to share data and other resources. Problem statement: Data replication is one of the mechanisms in managing data grid architecture that receive particular attention since it can provide efficient access to data, fault tolerance, reduce access latency and … …Journal of Computer Science, Vol. 8, Issue 2 · 1 Dec 2011 · 7,257 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordSolving 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 PDF Cite

Research ArticleOpen accessAll words, across the recordEco-Efficient Product Design Using Theory of Inventive Problem Solving (TRIZ) PrinciplesIssac Lim Sing Sheng, Teoh Kok-SooProblem statement: In recent years, much attention has been focused on the eco-efficiency of product development. The majority of environmental decisions are only made in the later stages of product development where not much modification can be done. To produce eco-efficient products, environmental decisions ought to be considered in the early stages of product development. With the demand of developing … …American Journal of Applied Sciences, Vol. 7, Issue 6 · 30 Jun 2010 · 11,983 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordAn Improved Genetic Algorithm Based on Adaptive Repair Operator for Solving the Knapsack ProblemSunanda Gupta, M. L. GargProblem statement: Knapsack problem is a typical NP complete problem. During last few decades, Knapsack problem has been studied through different approaches, according to the theoretical development of combinatorial optimization. Approach: In this study, modified evolutionary algorithm was presented for 0/1 knapsack problem. Results: A new objective_func_evaluation operator was proposed which employed adaptive repair function named as repair and elitism … …Journal of Computer Science, Vol. 5, Issue 8 · 31 Aug 2009 · 7,713 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordSolving the Near-Far Problem in Dynamic Frequency Hopping-Optical Code Division Multiple Access using Power ControlW. J.M. Al-galbi, M. Mokhtar, A. F. Abas et al.Problem statement: In this study, a distributed power control algorithm is proposed for Dynamic Frequency Hopping Optical-CDMA (DFH-OCDMA) system. Approach: In general, the DFH-OCDMA can support higher number of simultaneous users compared to other OCDMA techniques. However, the performance of such system degrades significantly as the received power does lower than its minimum threshold. Results: This may obviously occur in … …Journal of Computer Science, Vol. 5, Issue 6 · 30 Jun 2009 · 7,521 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordSolving the Vehicle Routing Problem with Stochastic Demands via Hybrid Genetic Algorithm-Tabu SearchZ. Ismail, IrhamahThis study considers a version of the stochastic vehicle routing problem where customer demands are random variables with known probability distribution. A new scheme based on a hybrid GA and Tabu Search heuristic is proposed for this problem under a priori approach with preventive restocking. The relative performance of the proposed HGATS is compared to each GA and TS alone, … …Journal of Mathematics and Statistics, Vol. 4, Issue 3 · 30 Sep 2008 · 7,951 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordExperimental Comparison Between Evolutionary Algorithm and Barycenter Heuristic for the Bipartite Drawing ProblemZoheir EzzianeThis research investigates the use of intelligent techniques for the bipartite drawing problem (BDP). Due to the combinatorial nature of the solution space, the use of traditional search methods lead to exponential time. Hence, the aim of this paper is to speed up the search time when solving the BDP through the use of Evolutionary Algorithms (EAs) and Barycenter Heuristic … …Journal of Computer Science, Vol. 3, Issue 9 · 30 Sep 2007 · 6,716 accessesView PDF Cite