Re: Need some advise

I think that works perfectly. Thank you very much.


Jules wrote:
mvsunstar@xxxxxxxx wrote:
Hi there,

I'm looking for a way to solve the following problem and I'm sure its
easy enough to do. I have the following table:

A B C

Node1 2 4 6
Node2 3 1 5
Node3 5 8 2
Node4 4 6 3

Basically each node has a value representing the distance to each
lettered area. My first task is to find the node that represents the
center i.e. it has the overall shortest paths to each lettered area.
My second task is to give weight to each of the lettered areas and
repeat finding the center - this time so that the node picked is taking
the weights of the lettered areas into consideration.

Any help with an approach on this would be very helpful. It's been a
while that I tinkered with math and I'm trying to implement a form of
network analysis in a GIS to find an ideal service center that takes
into account the friction of the road network.

Cheers

Well, it's not entirely clear what you mean by "has the overall
shortest paths to each lettered area." One way in which you might
measure this is, for each node, sum the squares of the distances to the
lettered areas. Whichever node has the smalles sum of squares is
nearest the center. If the lettered areas have weights, just multiply
the weight of the area times the square of the distance before you sum.

.