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

214 articles for “Problem solving”
Set a search alert
Research ArticleOpen accessEvery word in the titleSolving the Robust Design Problem for a Two-Commodity Flow Network with Node FailureNoha Hamdy Radwan, Moatamad Refaat Hassan, Mohamed Eid HusseinThe robust design in a flow network is one of the most important problems. It is defined as searching the optimal capacity that can be assigned to the nodes such that the network still survived even under the node’s failure. This problem is considered NP-hard. So, this study presents a genetic-based algorithm to determine the maximum node capacity for a … …American Journal of Engineering and Applied Sciences, Vol. 13, Issue 4 · 28 Dec 2020 · 6,593 accessesView PDFCite
Research ArticleOpen accessEvery word 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 accessEvery word in the titleAn 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 PDFCite
Research ArticleOpen accessEvery word in the titleSolving 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 PDFCite
Research ArticleOpen accessEvery word in the titleSolving 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 accessEvery word in the titleSolving the Traveling Salesman Problem Using New Operators in Genetic AlgorithmsNaef Taher Al Rahedi, Jalal AtoumProblem statement: Genetic Algorithms (GAs) have been used as search algorithms to find near-optimal solutions for many NP problems. GAs require effective chromosome representations as well as carefully designed crossover and mutation operators to achieve an efficient search. The Traveling Salesman Problem (TSP), as an NP search problem, involves finding the shortest Hamiltonian Path or Cycle in a graph of … …American Journal of Applied Sciences, Vol. 6, Issue 8 · 31 Aug 2009 · 7,584 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleTowards Solving the Problem of Virtual Machine Placement in Cloud Computing: A Job Classification ApproachAuday Al-Dulaimy, Ahmed Zekri, Wassim Itani, Rached ZantoutCloud Computing is a paradigm that delivers services by providing an access to wide range of shared resources which are hosted in cloud data centers. One of the recent challenges in this paradigm is to enhance the energy efficiency in these data centers. In this study, a model that identifies common patterns for the jobs submitted to the cloud is … …Journal of Computer Science, Vol. 12, Issue 3 · 8 Apr 2016 · 7,283 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleNew Collisions to Improve Pollard's Rho Method of Solving the Discrete Logarithm Problem on Elliptic CurvesAmmar Ali NeamahIt is true that different approaches have been utilised to accelerate the computation of discrete logarithm problem on elliptic curves with Pollard's Rho method. However, trapping in cycles fruitless will be obtained by using the random walks with Pollard's Rho. An efficient alternative approach that is based on new collisions which are reliant on the values ai, bi to solve … …Journal of Computer Science, Vol. 11, Issue 9 · 16 Dec 2015 · 7,340 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleSolving 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 PDFCite
Research ArticleOpen accessIn the keywordsTHE MODEL IN PREVENTING AND SOLVING DRUGS IN THE THAI-LAO BORDER VILLAGESWattana Puttichart, Saner Piromjitpong, Metta MettkarunjitA drug issue is a problem at both national and international levels. The root causes of the problems lie inside and outside the humans. To solve the problems in a sustainable way, it is essential to get cooperation from many parties. The research aimed to study the situations and prevention and solution of drugs in the border villages, to construct … …Journal of Social Sciences, Vol. 10, Issue 1 · 18 Apr 2014 · 7,494 accessesView PDFCite