Mobile agents (MAs) have been proposed as a distributed middleware approach suitable for autonomic data aggregation operations in Wireless Sensor Networks (WSN). Determining optimal itineraries for MAs traveling through WSN nodes is a non-trivial problem. Thus, several heuristics have been proposed to perform efficient itinerary planning for MAs. However, the evaluation of these heuristics is typically performed on the ground of different parameter spaces and assumptions about the underlying network and the capabilities of nodes. Herein, we implement, simulate and compare the most prominent itinerary planning algorithms upon a common parameter space, making realistic network-level assumptions.