Work

A Network Flow Algorithm for Solving Generalized Assignment Problem

Year: 2021

Type: article

Abstract: The generalized assignment problem (GAP) is an open problem in which an integer k is given and one wants to assign k ′ agents to k k ′ ≤ k jobs such that the sum of the corresponding cost is minimal. Unlike the traditional K -cardinality assignment problem, a job can be assigned to many, but different, agents and an agent may undertake several, but different, jobs in our problem. A network model with a special structure of GAP is given and an algorithm for GAP is proposed. Meanwhile, some important properties of the GAP are given. Numerical experiments are implemented, and the results indicate that the proposed algorithm can globally and efficiently optimize the GAP with a large range cost.

Source: Mathematical Problems in Engineering

DOI: 10.1155/2021/5803092

Authors: Yongwen Hu, Qunpo Liu

Institutions: Hubei University of Arts and Science, Henan Polytechnic University

Language: English

Topic: Optimization and Mathematical Programming

Subfield: Management Science and Operations Research

Field: Decision Sciences

Domain: Social Sciences

Open Access status: hybrid

Estimated APC paid: $2,550

Funder: Innovation Scientists and Technicians Troop Construction Projects of Henan Province