.png){kind=icon}
Return
An ant colony optimization heuristic for constrained task allocation problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jocs.2015.01.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
I present an ant colony optimization (ACO) heuristic for solving the constraint task allocation problem (CTAP). Using real-world and simulated datasets, I compare the results of ACO with those of mixed integer programming (MIP) formulation, iterated greedy (IG) heuristic, and tighter of linear programming or Lagrangian relaxation based lower bounds. For datasets where optimal results could be obtained using the MIP formulation, the ACO results were either optimal or very tight with an average relative gap of less than 0.5% from the optimal value. When comparing the ACO results to the best lower bound, the ACO results had an average relative gap of approximately 3%. In all cases, the ACO algorithm found better results than the IG heuristic. The results from my experiments indicate that the proposed ACO heuristic is very promising for solving CTAPs. (C) 2015 Elsevier B.V. All rights reserved.
Keywords:
Combinatorial problems
Distributed computing
Parallel processing
Scheduling
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
18.3
Papers:
3.1K
Citations:
4.0K
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSave
View more