Disertation!

Floyd's Algorithm

Making some slow progress here.

Okay, some new information that could be helpful.
1. We didn't use GA to determined which Distribution Point (DP) that the network are going to use. We employ Floyd's Algorithm to determined the shortest way to customer nodes.
2. We used GA to determined cable types, equipments (router types), connection types and find the cheapest solution.
3. A problem that occured to me is when there's a DP that just connected one customer node. In the first step using Floyd's algorithm, that DP is surely will be counted, while the most possible way is just extend a cable from a nearest DP as that would be cheaper.
4. Considering that no. 3 is not feasible due to that single customer is too distant to connect without using that additional DP spot, I need to find a way to include some additional parameters such as maximum cable length permitted.
5. Regarding no 3, I have this idea that we could probably solve it using the GA. Acknowlegding that DP, but employing 0 equipment as the cable just pass through.

posted by Chafid @ 3:57 PM