TY - JOUR
T1 - A Multi-Model Estimation of Distribution Algorithm for Agent Routing Problem in Multi-Point Dynamic Task
AU - Lu, Sai
AU - Xin, Bin
AU - Dou, Lihua
AU - Wang, Ling
N1 - Publisher Copyright:
© 2018 Technical Committee on Control Theory, Chinese Association of Automation.
PY - 2018
Y1 - 2018
N2 - The agent routing problem in multi-point dynamic task (ARP-MPDT) is a multi-task routing problem of a mobile agent. In this problem, there are multiple tasks to be carried out in different locations. As time goes on, the state of each task will change nonlinearly. The agent must go to the task points in tum to perform the tasks, and the execution time of each task is related to the state of the task point when the agent arrives at the point. ARP-MPDT is a typical NP-hard optimization problem. In this paper, we establish the nonlinear ARP-MPDT model. A multi-model estimation of distribution algorithm (EDA) employing node histogram models (NHM) and edge histogram models (EHM) in probability modeling is used to solve the ARP-MPDT. The selection ratio of NHM and EHM probability models is adjusted adaptively. Finally, performance of the algorithm for solving the ARP-MPDT problem is verified by the computational experiments.
AB - The agent routing problem in multi-point dynamic task (ARP-MPDT) is a multi-task routing problem of a mobile agent. In this problem, there are multiple tasks to be carried out in different locations. As time goes on, the state of each task will change nonlinearly. The agent must go to the task points in tum to perform the tasks, and the execution time of each task is related to the state of the task point when the agent arrives at the point. ARP-MPDT is a typical NP-hard optimization problem. In this paper, we establish the nonlinear ARP-MPDT model. A multi-model estimation of distribution algorithm (EDA) employing node histogram models (NHM) and edge histogram models (EHM) in probability modeling is used to solve the ARP-MPDT. The selection ratio of NHM and EHM probability models is adjusted adaptively. Finally, performance of the algorithm for solving the ARP-MPDT problem is verified by the computational experiments.
KW - Estimation of distribution algorithm
KW - Multi-model
KW - Multi-point dynamic task
KW - Routing
UR - http://www.scopus.com/inward/record.url?scp=85062719083&partnerID=8YFLogxK
U2 - 10.23919/ChiCC.2018.8484163
DO - 10.23919/ChiCC.2018.8484163
M3 - Conference article
AN - SCOPUS:85062719083
SN - 1934-1768
VL - 2018-January
SP - 2468
EP - 2473
JO - Chinese Control Conference, CCC
JF - Chinese Control Conference, CCC
M1 - 8484163
T2 - 37th Chinese Control Conference, CCC 2018
Y2 - 25 July 2018 through 27 July 2018
ER -