ant-colony | 易学教程

Where can I learn more about “ant colony” optimizations?

阅读更多关于 Where can I learn more about “ant colony” optimizations?

问题 I've been reading things here and there for a while now about using an "ant colony" model as a heuristic approach to optimizing various types of algorithms. However, I have yet to find an article or book that discusses ant colony optimizations in an introductory manner, or even in a lot of detail. Can anyone point me at some resources where I can learn more about this idea? 回答1: On the off chance that you know German (yes, sorry …), a friend and I have written an introduction with code about

Dynamic drawing ants in winforms during execution of ant colony

阅读更多关于 Dynamic drawing ants in winforms during execution of ant colony

问题 After this question (Show trail of moving pixel in C# WinForm project) for my personal ant colony project in c#, I'm trying to apply the solution second suggested solution: the one that combines drawing the trail into a bitmap and the new ants onto the surface. [...]Application.Run(new ShowAnts());[...] public partial class ShowAnts : Form { Bitmap bmp; int j = 0; public ShowAnts() { InitializeAntProgram(); InitializeComponent(); bmp = new Bitmap(pictureBox1.ClientSize.Width, pictureBox1

Most efficient implementation for a complete undirected graph

阅读更多关于 Most efficient implementation for a complete undirected graph

问题 Problem background I am currently developing a framework of Ant Colony System algorithms. I thought I'd start out by trying them on the first problem they were applied to: Travelling Salesman Problem (TSP). I will be using C# for the task. All TSP instances will consist of a complete undirected graph with 2 different weights associated with each edge. Question Until now I've only used adjacency-list representations but I've read that they are recommended only for sparse graphs. As I am not

Probability density function from a paper, implemented using C++, not working as intended

阅读更多关于 Probability density function from a paper, implemented using C++, not working as intended

So i'm implementing a heuristic algorithm, and i've come across this function. I have an array of 1 to n (0 to n-1 on C, w/e). I want to choose a number of elements i'll copy to another array. Given a parameter y, (0 < y <= 1), i want to have a distribution of numbers whose average is (y * n). That means that whenever i call this function, it gives me a number, between 0 and n, and the average of these numbers is y*n. According to the author, "l" is a random number: 0 < l < n . On my test code its currently generating 0 <= l <= n. And i had the right code, but i'm messing with this for hours

Where can I learn more about “ant colony” optimizations?

阅读更多关于 Where can I learn more about “ant colony” optimizations?

I've been reading things here and there for a while now about using an "ant colony" model as a heuristic approach to optimizing various types of algorithms. However, I have yet to find an article or book that discusses ant colony optimizations in an introductory manner, or even in a lot of detail. Can anyone point me at some resources where I can learn more about this idea? On the off chance that you know German (yes, sorry …), a friend and I have written an introduction with code about this subject which I myself find quite passable. The text and code uses the example of TSP to introduce the