Cost effective mobile agent planning for distributed information retrieval

@INPROCEEDINGS{918934,
		author={Jin-Wook Baek and Jae-Heung Yeo and Gyu-Tae Kim and Heon-Young Yeom},
		booktitle={Distributed Computing Systems, 2001. 21st International Conference on.},
		title={Cost effective mobile agent planning for distributed information retrieval},
		year={2001},
		month={Apr},
		pages={65-72},
		keywords={distributed databases;distributed programming;information retrieval;information retrieval systems;minimisation;multi-agent systems;planning (artificial intelligence);software performance evaluation;travelling salesman problems;2OPT algorithm;BYKY1 algorithm;BYKY2 algorithm;bandwidth;cost-effectiveness;distributed agent system;distributed information retrieval systems;execution time minimization;heuristic algorithms;local routing path optimization;minimal latency;minimum travelling agent number;mobile agent planning;mobile computing;near-optimal performance;network traffic;objective function;optimal total routing cost;performance factors;travelling salesman problem;Bandwidth;Costs;Delay;Distributed computing;Heuristic algorithms;Information retrieval;Mobile agents;Routing;Telecommunication traffic;Traveling salesman problems},
		doi={10.1109/ICDSC.2001.918934},}