Department of information technology development of optimized itinerary agent design pattern using development algorithm

Dissertant

al-Rifai, Fawwaz Nasir

Thesis advisor

al-Sharruf, Fayiz

University

Isra University

Faculty

Faculty of Information Technology

Department

Department Software Engineering

University Country

Jordan

Degree

Master

Degree Date

2020

English Abstract

The Personal Computer (PC) framework has been advanced from a solid PC gadget to a significantly more perplexing customer worker condition in earlier years.

One of those recently evolved advancements is the Mobile Agent (MA).

A MA is a creation of program and information that can (move) starting with one PC then onto the next self-rulingly and proceeds with its execution on the goal PC.

As a general rule, the portable operator is the code/object moving which goes in its itinerary inside the system of associated hubs.

In this thesis, the best way in insignificant time is found by relocating the Mobile Agent from the source hub to the goal hub utilizing the numerical procedure and streamlining strategy.

This work centers on how to locate the best way using the Itinerary design pattern and the Ant Colony Optimization (ACO) algorithm with the Java Agent Development Framework (JADE).

When comparing the algorithms with each other, time is considered an essential measure for selecting the best path when using the proposed approached the time of selecting the best path is 271.511, After figuring out the best path, the path will be compared with those of similar works that used the master-slave design pattern with the Genetic Algorithm (GA) and also that used the Node Compression Algorithm (NCA).

Main Subjects

Information Technology and Computer Science

Topics

• Algorithms
• Information technology
• Ant colony optimization algorithms

No. of Pages

34

Table of Contents

• APA
• MLA
• AMA

Language

English

Data Type

Arab Theses

Record ID

BIM-988687