Ma J. (2008), Research on Cultural Algorithm for Solving Routing Problem of Mobile Agent, The Journal of China Universities of Posts and Telecommunications, ISSN:1002- 1310 , 15(4): 121-125.Ma;Jun;Zhang;Jian-pei;Yang;Jing.Research on cultural algorithm for solving routing problem of mobile...
The mobile agent routing problem The distributed computation model based on a mobile agent routing problem can overcome not only drawbacks of the traditional client/server scheme, but also the flexibility, the stability, the extensibility of the ant colony system are suitable well for solving complex...
An efficient Harris Hawk optimization algorithm for solving the travelling salesman problem. Clust. Comput. MAY 2021, 1–25 (2021). Google Scholar Mohammadzadeh, H. & Gharehchopogh, F. S. A multi-agent system based for solving high-dimensional optimization problems: A case study on email ...
Set Partitioning ProblemCoalition FormationClusteringA decentralized algorithm for solving set partitioning problems聽(SPP) has numerous applications in multi-agent systems. Apart from its relevance for problems of operations research, the SPP is equivalent to clustering of agents as well as the generation...
Meta-heuristic algorithms have a high position among academic researchers in various fields, such as science and engineering, in solving optimization problems. These algorithms can provide the most optimal solutions for optimization problems. This paper investigates a new meta-heuristic algorithm called Sl...
Shaheen et al.57integrated a novel amalgamated heap-based agent with jellyfish optimizer (AHJFO) to optimize combined heat and power economic dispatch (CHPED). They improved the efficiency of two newly developed techniques: the heap-based optimizer (HBO) and JSO. AHJFO incorporates an adjustment...
for navigating to a given goal, for example, a robot navigating to a specific location in a park to deliver a package, we want this model to recognize the robot and any obstacle in its way, but not the changes in its surrounding environment that occur independently of the agen...
The task in the multi-agent path finding problem (MAPF) is to find paths for multiple agents, each with a different start and goal position, such that agents do not collide. A successful optimal MAPF solver is the conflict-based search (CBS) algorithm. CBS is a two level algorithm where...
44 investigated the two-machine NWFSSP with two competing agents, aiming to minimize the overall completion time of one agent while adhering to an upper bound on the makespan of the second agent. Polynomial-time algorithms were demonstrated for certain restricted scenarios. Additionally, a ...
A support vector machine (SVM) is a statistical learning classifier that relies on information search for the intent of an agent. The literature (Vallon et al., 2017) proposes a classifier autonomous lane changing algorithm based SVM. Several SVMs are trained using data from human drivers' ...