A New Optimization Algorithm For Combinatorial Problems
Journal Title: International Journal of Advanced Research in Artificial Intelligence(IJARAI) - Year 2013, Vol 2, Issue 5
Abstract
Combinatorial optimization problems are those problems that have a finite set of possible solutions. The best way to solve a combinatorial optimization problem is to check all the feasible solutions in the search space. However, checking all the feasible solutions is not always possible, especially when the search space is large. Thus, many meta-heuristic algorithms have been devised and modified to solve these problems. The meta-heuristic approaches are not guaranteed to find the optimal solution since they evaluate only a subset of the feasible solutions, but they try to explore different areas in the search space in a smart way to get a near-optimal solution in less cost and time. In this paper, we propose a new meta-heuristic algorithm that can be used for solving combinatorial optimization problems. The method introduced in this paper is named the Global Neighborhood Algorithm (GNA). The algorithm is principally based on a balance between both the global and local search. A set of random solutions are first generated from the global search space, and then the best solution will give the optimal value. After that, the algorithm will iterate, and in each iteration there will be two sets of generated solutions; one from the global search space and the other set of solutions will be generated from the neighborhood of the best solution. Throughout the paper, the algorithm will be delineated with examples. In the final phase of the research, the results of GNA will be discussed and compared with the results of Genetic Algorithm (GA) as an example of another optimization method.
Authors and Affiliations
Azmi Alazzam, Harold Lewis III
Keywords
Related Articles
- EP ID EP87446
- DOI -
- Views 181
- Downloads 0
Memetic Algorithm with Filtering Scheme for the Minimum Weighted Edge Dominating Set Problem
The minimum weighted edge dominating set problem (MWEDS) generalizes both the weighted vertex cover problem and the problem of covering the edges of graph by a minimum cost set of both vertices and edges. In this paper,...
External analysis of strategic market management can be realized based upon different human mindset–A debate in the light of statistical perspective
The paper entails the statistical correlation of the investigations carried out for the sales and profit prediction and analysis by persons of different mindsets in case of strategic uncertainty . The paper by vir...
Mashup Based Content Search Engine for Mobile Devices
Mashup based content search engine for mobile devices is proposed. Example of the proposed search engine is implemented with Yahoo!JAPAN Web SearchAPI, Yahoo!JAPAN Image searchAPI, YouTube Data API, and Amazon Prod...
An Evaluation of the Implementation of Practice Teaching Program for Prospective Teachers at Ganesha University of Education Based on CIPP-Forward Chaining
The recognition of teacher status is very high and this is followed by a requirement of a high competence level that a teacher has to have that the existence of teachers has to gain a serious attention, including a...
Migration Dynamics in Artificial Agent Societies
An Artificial Agent Society can be defined as a collection of agents interacting with each other for some purpose and/or inhabiting a specific locality, possibly in accordance to some common norms/rules. These soci...