4,314 research outputs found
An Area-Optimized Chip of Ant Colony Algorithm Design in Hardware Platform Using the Address-Based Method
The ant colony algorithm is a nature-inspired algorithm highly used for solving many complex problems and finding optimal solutions; however, the algorithm has a major flaw and that is the vast amount of calculations and if the proper correction algorithm and architectural design are not provided, it will lead to the increasing use of hardware platform due to the high volume of operations; and perhaps at higher scales, it causes the chip area not to work because of the high number of problems; hence, the purpose of this paper is to save the hardware platform as far as possible and use it optimally through providing a particular algorithm running on a reconfigurable chip driven by the address-based method, so that the comparison of synthesis operations with the similar works shows significant improvements as much as 1/3 times greater than the other similar hardware methods.DOI:http://dx.doi.org/10.11591/ijece.v4i6.692
A Hybrid Monte Carlo Ant Colony Optimization Approach for Protein Structure Prediction in the HP Model
The hydrophobic-polar (HP) model has been widely studied in the field of
protein structure prediction (PSP) both for theoretical purposes and as a
benchmark for new optimization strategies. In this work we introduce a new
heuristics based on Ant Colony Optimization (ACO) and Markov Chain Monte Carlo
(MCMC) that we called Hybrid Monte Carlo Ant Colony Optimization (HMCACO). We
describe this method and compare results obtained on well known HP instances in
the 3 dimensional cubic lattice to those obtained with standard ACO and
Simulated Annealing (SA). All methods were implemented using an unconstrained
neighborhood and a modified objective function to prevent the creation of
overlapping walks. Results show that our methods perform better than the other
heuristics in all benchmark instances.Comment: In Proceedings Wivace 2013, arXiv:1309.712
CBPRS: A City Based Parking and Routing System
Navigational systems assist drivers in finding a route between two locations that is time optimal in theory but seldom in practice due to delaying circumstances the system is unaware of, such as traffic jams. Upon arrival at the destination the service of the system ends and the driver is forced to locate a parking place without further assistance. We propose a City Based Parking Routing System (CBPRS) that monitors and reserves parking places for CBPRS participants within a city. The CBPRS guides vehicles using an ant based distributed hierarchical routing algorithm to their reserved parking place. Through means of experiments in a simulation environment we found that reductions of travel times for participants were significant in comparison to a situation where vehicles relied on static routing information generated by the well known Dijkstra’s algorithm. Furthermore, we found that the CBPRS was able to increase city wide traffic flows and decrease the number and duration of traffic jams throughout the city once the number of participants increased.information systems;computer simulation;dynamic routing
Recommended from our members
Combinatorial optimization and metaheuristics
Today, combinatorial optimization is one of the youngest and most active areas of discrete mathematics. It is a branch of optimization in applied mathematics and computer science, related to operational research, algorithm theory and computational complexity theory. It sits at the intersection of several fields, including artificial intelligence, mathematics and software engineering. Its increasing interest arises for the fact that a large number of scientific and industrial problems can be formulated as abstract combinatorial optimization problems, through graphs and/or (integer) linear programs. Some of these problems have polynomial-time (“efficient”) algorithms, while most of them are NP-hard, i.e. it is not proved that they can be solved in polynomial-time. Mainly, it means that it is not possible to guarantee that an exact solution to the problem can be found and one has to settle for an approximate solution with known performance guarantees. Indeed, the goal of approximate methods is to find “quickly” (reasonable run-times), with “high” probability, provable “good” solutions (low error from the real optimal solution). In the last 20 years, a new kind of algorithm commonly called metaheuristics have emerged in this class, which basically try to combine heuristics in high level frameworks aimed at efficiently and effectively exploring the search space. This report briefly outlines the components, concepts, advantages and disadvantages of different metaheuristic approaches from a conceptual point of view, in order to analyze their similarities and differences. The two very significant forces of intensification and diversification, that mainly determine the behavior of a metaheuristic, will be pointed out. The report concludes by exploring the importance of hybridization and integration methods
An Integration Of AHP-ACO Technique For Social Interaction And Travel Planning
The current web and mobile computing technologies have encouraged all sorts of applications mushroom in the market. However, most of the application that available
does not integrate the place recommendation and route planning. Besides that, improving the processing speed of the algorithm is also another challenge of this research. Thus, the objectives of this research is to integrate the place recommendation based on profile preference using Analytic Hierarchy Process (AHP) method and route planning using ACO method. The second objective of this research is to enhance the processing speed of the proposed AHP-ACO technique in generating the optimum route plan. This study
presents the integration methods of AHP algorithm for point of interest decision-making and ACO and rule-based algorithms for route optimization. AHP interest scores based on user preferences, business information and community reviews are used to model decision making. ACO and rule-based algorithms are used to arrange the itinerary of the place of interest that either has been chosen by the user or recommended by the system.The integration AHP-ACO method has been enhanced to reduce the execution time from
5 minutes to 30 seconds for 7 days trip planning. Object Oriented Software Engineering(OOSE) methodology has been used to build the mobile recommender system prototype
and web application prototype. Questionnaires have been distributed to collect user feedback. The results show that the integration method is promising for helping the user
in making decisions and itinerary arrangements
- …