Dual Probability Learning Based Local Search for the Task Assignment Problem

• Published in: IEEE transactions on automation science and engineering Vol. 19; no. 1; pp. 332 - 347
• Main Authors: Li, Zuocheng, Tang, Lixin, Hao, Jin-Kao
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.01.2022; The Institute of Electrical and Electronics Engineers, Inc. (IEEE); Institute of Electrical and Electronics Engineers
• Subjects: Algorithms; Assignment problem; Computer Science; Corporate learning; Heuristic methods; Industrial applications; Integer programming; Learning based search; Machine learning; Mixed integer; neighborhood search; Operations research; Optimization; Probability distribution; Production planning; Search algorithms; Search problems; Silicon steels; Slabs; Steel; Steel making; Task analysis; task assignment

The task assignment problem (TAP) is concerned with assigning a set of tasks to a set of agents subject to the limited processing and memory capacities of each agent. The objective to be minimized is the total assignment cost and total communication cost. TAP is a relevant model for many practical a...