2,448 research outputs found
Energy Efficient Ant Colony Algorithms for Data Aggregation in Wireless Sensor Networks
In this paper, a family of ant colony algorithms called DAACA for data
aggregation has been presented which contains three phases: the initialization,
packet transmission and operations on pheromones. After initialization, each
node estimates the remaining energy and the amount of pheromones to compute the
probabilities used for dynamically selecting the next hop. After certain rounds
of transmissions, the pheromones adjustment is performed periodically, which
combines the advantages of both global and local pheromones adjustment for
evaporating or depositing pheromones. Four different pheromones adjustment
strategies are designed to achieve the global optimal network lifetime, namely
Basic-DAACA, ES-DAACA, MM-DAACA and ACS-DAACA. Compared with some other data
aggregation algorithms, DAACA shows higher superiority on average degree of
nodes, energy efficiency, prolonging the network lifetime, computation
complexity and success ratio of one hop transmission. At last we analyze the
characteristic of DAACA in the aspects of robustness, fault tolerance and
scalability.Comment: To appear in Journal of Computer and System Science
Routing design for less-than-truckload motor carriers using ant colony techniques
One of the most important challenges for Less-Than-Truck-Load carriers consists of determining how to consolidate flows of small shipments to minimize costs while maintaining a certain level of service. For any origin-destination pair, there are several strategies to consolidate flows, but the most usual ones are: peddling/collecting routes and shipping through one or more break-bulk terminals. Therefore, the target is determining a route for each origin-destination pair that minimizes the total transportation and handling cost guaranteeing a certain level of service. Exact resolution is not viable for real size problems due to the excessive computational time required. This research studies different aspects of the problem and provides a metaheuristic algorithm (based on Ant Colonies Optimization techniques) capable of solving real problems in a reasonable computational time. The viability of the approach has been proved by means of the application of the algorithm to a real Spanish case, obtaining encouraging results
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
ROUTING DESIGN FOR LESS-THAN-TRUCKLOAD MOTOR CARRIERS USING ANT COLONY TECHNIQUES
One of the most important challenges for Less-Than-Truck-Load carriers consists of determining how to consolidate flows of small shipments to minimize costs while maintaining a certain level of service. For any origin-destination pair, there are several strategies to consolidate flows, but the most usual ones are: peddling/collecting routes and shipping through one or more break-bulk terminals. Therefore, the target is determining a route for each origin-destination pair that minimizes the total transportation and handling cost guaranteeing a certain level of service. Exact resolution is not viable for real size problems due to the excessive computational time required. This research studies different aspects of the problem and provides a metaheuristic algorithm (based on Ant Colonies Optimization techniques) capable of solving real problems in a reasonable computational time. The viability of the approach has been proved by means of the application of the algorithm to a real Spanish case, obtaining encouraging results.
Ant colony optimisation and local search for bin-packing and cutting stock problems
The Bin Packing Problem and the Cutting Stock Problem are two related classes of NP-hard combinatorial optimization problems. Exact solution methods can only be used for very small instances, so for real-world problems, we have to rely on heuristic methods. In recent years, researchers have started to apply evolutionary approaches to these problems, including Genetic Algorithms and Evolutionary Programming. In the work presented here, we used an ant colony optimization (ACO) approach to solve both Bin Packing and Cutting Stock Problems. We present a pure ACO approach, as well as an ACO approach augmented with a simple but very effective local search algorithm. It is shown that the pure ACO approach can compete with existing evolutionary methods, whereas the hybrid approach can outperform the best-known hybrid evolutionary solution methods for certain problem classes. The hybrid ACO approach is also shown to require different parameter values from the pure ACO approach and to give a more robust performance across different problems with a single set of parameter values. The local search algorithm is also run with random restarts and shown to perform significantly worse than when combined with ACO
- …