In the original investigation of Ant System algorithms, there were three versions of
Ant System that differed in how and when they laid pheromone. They are:
• “Ant-density” updates the pheromone on a road traveled with a fixed amount
after every step.
• “Ant-quantity” updates the pheromone on a road traveled with an amount
proportional to the inverse of the length of the road after every step.
• “Ant-cycle” first completed the tour and then updates each road used with an
amount proportional to the inverse of the total length of the tour.
Of the three approaches “Ant-cycle” was found to produce the best results and
subsequently receives the most attention. It will be used for the remainder of this
paper.
Main Loop Ends
Output
• The best tour found is returned as the output of the problem.
3.2 .ROUTING
Routing has been a significant area of research for swarm intelligence. Starting with
Schonderwoerd in 1997, and Di Caro in 1998, the exploitation of the foraging
behaviour of ants has been shown to significantly improve the quality of routing in
networks. Most recently, research into ad hoc network routing has been active; with
Di Caro (AntHocNet) having provided the most compelling research.
Ad hoc networks consist of autonomous self-organized nodes. Nodes use a wireless
medium for communication, thus two nodes can communicate directly if and only if
they are within each other’s transmission radius. Examples are sensor networks
(attached to a monitoring station), rooftop networks (for wireless Internet access), and
conference and rescue scenarios for ad hoc networks, possibly mobile. In a routing
task, a message is sent from a source to a destination node in a given network. Two
nodes normally communicate via other nodes in a multi-hop fashion. Swarm
intelligence follows the behaviour of cooperative ants in order to solve hard static and
dynamic optimization problems. Ants leave pheromone trails at nodes or edges which
increases the likelihood of other ants to follow these trails. Routing paths are then
found dynamically on the fly, using this so called notion of stigmergy.The ideas
In the original investigation of Ant System algorithms, there were three versions ofAnt System that differed in how and when they laid pheromone. They are:• “Ant-density” updates the pheromone on a road traveled with a fixed amountafter every step.• “Ant-quantity” updates the pheromone on a road traveled with an amountproportional to the inverse of the length of the road after every step.• “Ant-cycle” first completed the tour and then updates each road used with anamount proportional to the inverse of the total length of the tour.Of the three approaches “Ant-cycle” was found to produce the best results andsubsequently receives the most attention. It will be used for the remainder of thispaper.Main Loop EndsOutput• The best tour found is returned as the output of the problem.3.2 .ROUTINGRouting has been a significant area of research for swarm intelligence. Starting withSchonderwoerd in 1997, and Di Caro in 1998, the exploitation of the foragingbehaviour of ants has been shown to significantly improve the quality of routing innetworks. Most recently, research into ad hoc network routing has been active; withDi Caro (AntHocNet) having provided the most compelling research.Ad hoc networks consist of autonomous self-organized nodes. Nodes use a wirelessmedium for communication, thus two nodes can communicate directly if and only ifthey are within each other’s transmission radius. Examples are sensor networks(attached to a monitoring station), rooftop networks (for wireless Internet access), andconference and rescue scenarios for ad hoc networks, possibly mobile. In a routingtask, a message is sent from a source to a destination node in a given network. Twonodes normally communicate via other nodes in a multi-hop fashion. Swarmintelligence follows the behaviour of cooperative ants in order to solve hard static anddynamic optimization problems. Ants leave pheromone trails at nodes or edges whichincreases the likelihood of other ants to follow these trails. Routing paths are thenfound dynamically on the fly, using this so called notion of stigmergy.The ideas
การแปล กรุณารอสักครู่..
