• Home
  • Search
  • Cost effective mobile agent planning for distributed information retrieval
  • Cite Icon32
  • https://doi.org/10.1109/icdsc.2001.918934Copy DOI Icon

Cost effective mobile agent planning for distributed information retrieval

  • Apr 16, 2001
  • Jin-Wook Baek +3 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

The number of agents and the execution time are two significant performance factors in mobile agent planning (MAP). Fewer agents cause lower network traffic and consume less bandwidth. Regardless of the number of agents used, the execution time for a task must be kept minimal, which means that use of the minimal number of agents must not impact on the execution time unfavorably. As the population of the mobile agent application domain grows, the importance of these two factors also increases. After a careful review of these two factors, we propose two heuristic algorithms for finding the minimal number of traveling agents for retrieving information from a distributed computing environment, while keeping the latency minimal. Although agent planning, specifically MAP, is quite similar to the famous traveling salesman problem (TSP), agent planning has a different objective function from that of TSP. TSP deals with the optimal total routing cost, while MAP attempts to minimize the execution time to complete tasks of information retrieval. In this paper, we suggest two cost-effective MAP algorithms, BYKY1 (Baek-Yeo-Kim-Yeom 1) and BYKY2, which can be used in distributed information retrieval systems to find the factors mentioned above. At the end of each algorithm, 2OPT, a well-known TSP algorithm, is called to optimize each agent's local routing path. Experimental results show that BYKY2 produces near-optimal performance. These algorithms are more realistic and applicable directly to the problem domains than those of previous works.

Similar Papers
  • Book Chapter
  • Citations7

The Advantage of Intelligent Algorithms for TSP

  • Nov 30, 2010
  • Yuan-Bin Mo
  • Conference Article
  • Citations28

Timed mobile agent planning for distributed information retrieval

  • May 28, 2001
  • Jin-Wook Baek +2
  • Conference Article
  • Citations7

A Computational Approach to TSP Performance Prediction Using Data Mining

  • Jan 01, 2007
  • Paula Cecilia Fritzsche +2
  • Research Article
  • Citations111

Generalize a Small Pre-trained Model to Arbitrarily Large TSP Instances

  • May 18, 2021
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • Zhang-Hua Fu +2
  • Research Article
  • Citations63

An improved upper bound for the TSP in cubic 3-edge-connected graphs

  • Nov 17, 2004
  • Operations Research Letters
  • David Gamarnik +2
  • Book Chapter
  • Citations8

A Method to Compute the Sparse Graphs for Traveling Salesman Problem Based on Frequency Quadrilaterals

  • Jan 01, 2018
  • Yong Wang +1
  • Book Chapter

Edges Elimination for Traveling Salesman Problem Based on Frequency $$K_5$$ s

  • Jun 15, 2019
  • Yong Wang
  • Research Article
  • Citations20

Hybrid Optimization Algorithm Based on Wolf Pack Search and Local Search for Solving Traveling Salesman Problem

  • Jan 24, 2019
  • Journal of Shanghai Jiaotong University (Science)
  • Ruyi Dong +3
  • Conference Article
  • Citations12

An Improved Discrete Particle Swarm Optimization Algorithm for TSP

  • Nov 02, 2007
  • Web intelligence
  • Changsheng Zhang +3
  • Book Chapter
  • Citations4

Combinatorial Optimization Using Electro-Optical Vector by Matrix Multiplication Architecture

  • Jan 01, 2009
  • Dan E Tamir +3
  • Conference Article

Using Genetic Algorithm Based on Composite Statistical Functions to Solve TSP by Nodes Regrouping

  • Aug 01, 2011
  • Chen Jie +1
  • Research Article
  • Citations66

On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality

  • Aug 14, 2001
  • Networks
  • Thomas Andreae
  • PDF
  • Research Article
  • Citations66

Dynamic Flying Ant Colony Optimization (DFACO) for Solving the Traveling Salesman Problem

  • Apr 17, 2019
  • Sensors (Basel, Switzerland)
  • Fadl Dahan +3
  • Single Report

Landscape Analysis and Algorithm Development for Plateau Plagued Search Spaces

  • Feb 28, 2011
  • Adele Howe +1
  • PDF
  • Research Article
  • Citations3

Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation

  • Dec 02, 2021
  • Central European Journal of Operations Research
  • A Herraiz +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.