8 results for “Combinatorial Optimization”

Set a search alert

Research ArticleOpen accessPhrase in the titleTolerances Applied in Combinatorial OptimizationBoris Goldengorin, Gerold Jäger, Paul MolitorIn this paper we deal with sensitivity analysis of combinatorial optimization problems and its fundamental term, the tolerance. For three classes of objective functions (∑, ∏, MAX) we give some basic properties on upper and lower tolerances. We show that the upper tolerance of an element is well defined, how to compute the upper tolerance of an element and give … …Journal of Computer Science, Vol. 2, Issue 9 · 30 Sep 2006 · 18,423 accessesView PDF Cite

Research ArticleOpen accessIn the keywordsTAGN-IDC: Implicit Discrete Constraints for Tsunami Aware Graph Neural Networks in Spatial Evacuation RoutingSularno, Wendi Boy, Putri Anggraini et al.Tsunami evacuation route requires rapid identification of safe evacuation paths under dynamically changing hazard conditions. A major challenge is incorporating hard binary road-blockage constraints caused by tsunami inundation while maintaining end-to-end differentiability for deep learning models. Existing approaches commonly rely on continuous relaxations or stochastic sampling techniques, which either compromise physical feasibility or increase computational complexity. This study proposes the … …Journal of Computer Science, Vol. 22, Issue 9 · 24 Sep 2026 · 704 accessesView PDF Cite

Research ArticleOpen accessIn the abstractSECURING MOBILE ANT AGENT USING CHINESE REMAINDER THEOREMSrinath Doss, Janet JeyarajRecent days, research in wireless network becomes major area for the past few decades. In wireless routing many routing methods such as table driven, source driven; many characteristics such as reactive routing, proactive routing; many routing algorithms such as dijikstra’s shortest path, distributed bell-man ford algorithm are proposed in the literature. For effective wireless routing, the recent ant colony optimization … …Journal of Computer Science, Vol. 9, Issue 9 · 6 Aug 2013 · 6,560 accessesView PDF Cite

Research ArticleOpen accessIn the abstractAnt Colony Optimization for Capacitated Vehicle Routing ProblemW. F. Tan, L. S. Lee, Z. A. Majid, H. V. SeowProblem statement: The Capacitated Vehicle Routing Problem (CVRP) is a well-known combinatorial optimization problem which is concerned with the distribution of goods between the depot and customers. It is of economic importance to businesses as approximately 10-20% of the final cost of the goods is contributed by the transportation process. Approach: This problem was tackled using an Ant Colony Optimization … …Journal of Computer Science, Vol. 8, Issue 6 · 15 Mar 2012 · 10,043 accessesView PDF Cite

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 PDF Cite

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