|
COMPARISON BETWEEN HEURISTICS AND METHODOLOGIES TO SOLVE THE NSLPKeywords: sensor location , minimum spanning tree , heuristic , optimization , traffic assignment. Abstract: For transportation planners update Origin-Destination matrices from traffic counts constantly is very common and very important and sometimes they need to evaluate networks such as the importance of a network or those links which get most information, or place geographically where sensor should be located to update an ODmatrix. The importance of decide where a sensor should be placed appears in terms of how many of them and where they should be placed according to the network characteristics. Many techniques have been applied to solve this common problem called: Network Sensor Location Problem but which one present better results or which one takes less computing time. In this paper a comparison between different methodologies to solve the NSLP and the relation with the minimum spanning tree, is presented.
|