A new differential evolution using a bilevel optimization model for solving generalized multi-point dynamic aggregation problems
The multi-point dynamic aggregation problem (MPDAP) comes mainly from real-world applications, which is characterized by dynamic task assignation and routing optimization with limited resources. Due to the dynamic allocation of tasks, more than one optimization objective, limited resources, and othe...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2023-06-01
|
| Series: | Mathematical Biosciences and Engineering |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/doi/10.3934/mbe.2023612?viewType=HTML |
| _version_ | 1797783601671045120 |
|---|---|
| author | Yu Shen Hecheng Li |
| author_facet | Yu Shen Hecheng Li |
| author_sort | Yu Shen |
| collection | DOAJ |
| description | The multi-point dynamic aggregation problem (MPDAP) comes mainly from real-world applications, which is characterized by dynamic task assignation and routing optimization with limited resources. Due to the dynamic allocation of tasks, more than one optimization objective, limited resources, and other factors involved, the computational complexity of both route programming and resource allocation optimization is a growing problem. In this manuscript, a task scheduling problem of fire-fighting robots is investigated and solved, and serves as a representative multi-point dynamic aggregation problem. First, in terms of two optimized objectives, the cost and completion time, a new bilevel programming model is presented, in which the task cost is taken as the leader's objective. In addition, in order to effectively solve the bilevel model, a differential evolution is developed based on a new matrix coding scheme. Moreover, some percentage of high-quality solutions are applied in mutation and selection operations, which helps to generate potentially better solutions and keep them into the next generation of population. Finally, the experimental results show that the proposed algorithm is feasible and effective in dealing with the multi-point dynamic aggregation problem. |
| first_indexed | 2024-03-13T00:28:12Z |
| format | Article |
| id | doaj.art-8f66da2ec53f4a7bbb692edc6d82cb6a |
| institution | Directory Open Access Journal |
| issn | 1551-0018 |
| language | English |
| last_indexed | 2024-03-13T00:28:12Z |
| publishDate | 2023-06-01 |
| publisher | AIMS Press |
| record_format | Article |
| series | Mathematical Biosciences and Engineering |
| spelling | doaj.art-8f66da2ec53f4a7bbb692edc6d82cb6a2023-07-11T01:27:55ZengAIMS PressMathematical Biosciences and Engineering1551-00182023-06-01208137541377610.3934/mbe.2023612A new differential evolution using a bilevel optimization model for solving generalized multi-point dynamic aggregation problemsYu Shen0Hecheng Li11. School of Computer Science and Technology, Qinghai Normal University, Xining 810008, Qinghai, China2. School of Mathematics and Statistics, Qinghai Normal University, Xining 810008, Qinghai, ChinaThe multi-point dynamic aggregation problem (MPDAP) comes mainly from real-world applications, which is characterized by dynamic task assignation and routing optimization with limited resources. Due to the dynamic allocation of tasks, more than one optimization objective, limited resources, and other factors involved, the computational complexity of both route programming and resource allocation optimization is a growing problem. In this manuscript, a task scheduling problem of fire-fighting robots is investigated and solved, and serves as a representative multi-point dynamic aggregation problem. First, in terms of two optimized objectives, the cost and completion time, a new bilevel programming model is presented, in which the task cost is taken as the leader's objective. In addition, in order to effectively solve the bilevel model, a differential evolution is developed based on a new matrix coding scheme. Moreover, some percentage of high-quality solutions are applied in mutation and selection operations, which helps to generate potentially better solutions and keep them into the next generation of population. Finally, the experimental results show that the proposed algorithm is feasible and effective in dealing with the multi-point dynamic aggregation problem.https://www.aimspress.com/article/doi/10.3934/mbe.2023612?viewType=HTMLmulti-point dynamic aggregation problemmultirobot systemtask allocationbilevel optimization modeldifferential evolution |
| spellingShingle | Yu Shen Hecheng Li A new differential evolution using a bilevel optimization model for solving generalized multi-point dynamic aggregation problems Mathematical Biosciences and Engineering multi-point dynamic aggregation problem multirobot system task allocation bilevel optimization model differential evolution |
| title | A new differential evolution using a bilevel optimization model for solving generalized multi-point dynamic aggregation problems |
| title_full | A new differential evolution using a bilevel optimization model for solving generalized multi-point dynamic aggregation problems |
| title_fullStr | A new differential evolution using a bilevel optimization model for solving generalized multi-point dynamic aggregation problems |
| title_full_unstemmed | A new differential evolution using a bilevel optimization model for solving generalized multi-point dynamic aggregation problems |
| title_short | A new differential evolution using a bilevel optimization model for solving generalized multi-point dynamic aggregation problems |
| title_sort | new differential evolution using a bilevel optimization model for solving generalized multi point dynamic aggregation problems |
| topic | multi-point dynamic aggregation problem multirobot system task allocation bilevel optimization model differential evolution |
| url | https://www.aimspress.com/article/doi/10.3934/mbe.2023612?viewType=HTML |
| work_keys_str_mv | AT yushen anewdifferentialevolutionusingabileveloptimizationmodelforsolvinggeneralizedmultipointdynamicaggregationproblems AT hechengli anewdifferentialevolutionusingabileveloptimizationmodelforsolvinggeneralizedmultipointdynamicaggregationproblems AT yushen newdifferentialevolutionusingabileveloptimizationmodelforsolvinggeneralizedmultipointdynamicaggregationproblems AT hechengli newdifferentialevolutionusingabileveloptimizationmodelforsolvinggeneralizedmultipointdynamicaggregationproblems |