16 results for “Combinatorial Approach”

Set a search alert

Research ArticleOpen accessIn the abstractAn 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 accessIn the abstractIntegrating Gene Expression Programming and Geographic Information Systems for Solving a Multi Site Land Use Allocation ProblemKhalid A. EldrandalyProblem statement: Land use planning may be defined as the process of allocating different activities or uses to specific units of area within a region. Multi sites Land Use Allocation Problems (MLUA) refer to the problem of allocating more than one land use type in an area. MLUA problem is one of the truly NP Complete (combinatorial optimization) problems. Approach: … …American Journal of Applied Sciences, Vol. 6, Issue 5 · 31 May 2009 · 7,849 accessesView PDF Cite

Research ArticleOpen accessIn the abstractTraveling Salesman Approach for Solving Petrol Distribution Using Simulated AnnealingZuhaimy Ismail, Wan Rohaizad Wan IbrahimThis research presents an attempt to solve a logistic company's problem of delivering petrol to petrol station in the state of Johor. This delivery system is formulated as a travelling salesman problem (TSP). TSP involves finding an optimal route for visiting stations and returning to point of origin, where the inter-station distance is symmetric and known. This real world application … …American Journal of Applied Sciences, Vol. 5, Issue 11 · 30 Nov 2008 · 7,194 accessesView PDF Cite

Research ArticleOpen accessIn the abstractExperimental 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

Research ArticleOpen accessIn the abstractResource Leveling Using Petrinet and Memetic ApproachK. Raja, S. KumananThe problem of scheduling activities dynamic for a project, within the available resources and adhering to precedence relationships is NP hard combinatorial. Traditional approaches and their extensions are limited in application for simultaneous scheduling of resources with leveling. Considering the need for improved modeling and scheduling techniques, this paper proposes the use of Petrinet based approach aided by memetic algorithm. … …American Journal of Applied Sciences, Vol. 4, Issue 5 · 31 May 2007 · 7,085 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordCombinatorial Properties of Modified Chordal Rings Degree Four NetworksR. N. Farah, M. Othman, M. H. SelamatProblem statement: Modified Chordal Rings Degree Four, called CHRm4 is the first modified structure of chordal rings. This CHRm4 is an undirected circulant graph and is a double loop graph. Approach: This study presented the main properties of CHRm4. There are connectivity, Hamiltonian cycle and asymmetric. Results: Several definitions, postulates, corollary, theorems and lemmas were constructed according to these three … …Journal of Computer Science, Vol. 6, Issue 3 · 31 Mar 2010 · 7,467 accessesView PDF Cite