Title: A New System (ZH1) for Verdict the Optimal Solution of Assignment Problems
Abstract: The assignment Complications is one of the greatest public optimization problems, and it is a private sort of transportation problem. Its goal is to assign an equal number of tasks to an equal number of people. It is used to maximize total profit or reduce total cost of allocation. The assignment problem is a fundamental combinatorial optimization problem. In its most general form, the problem is as follows: The problem instance has a number of agents and a number of tasks. Any agent can be assigned to perform any task, incurring some cost that may vary depending on the agent-task assignment. It is required to perform as many tasks as possible by assigning at most one agent to each task and at most one task to each agent, in such a way that the total cost of the assignment is minimized. This paper provides a novel approach to solving the assignment problem. Furthermore, several numerical examples were provided to compare the results of the new techniques' clarifications to the results of the Hungarian method's solutions.
Publication Year: 2022
Publication Date: 2022-03-31
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot