Assignment Problem (AP) is the fundamental application of TP studied in the area of Operations research. The AP is also an essential problem in the field of optimization, where the goal is to optimize production time or cost by allocating one task to one machine, one machine to one job, one destination to one source, or one source to one destination. Various solutions for resolving the assignment problem have been offered in the literature. Excellent response to task problems is obtained using the Hungarian technique. In this study, however, we are discussing a novel alternative strategy that is the almost best performance. Here, we are looking at another technique to resolve algorithm and solution steps AP. In addition, we present an innovative alternative strategy that provides the best performance of APs by utilizing a modified ant colony optimization (ACO) algorithm. A few revisions to the ant colony algorithm (Transition Rule and Pheromone Update Rule) are created, resulting in a solution that is extremely close to the ideal solution. This method is also to be noticed that, requires the least number of steps to reach optimality as compare the obtained results with other well-known meta-heuristic algorithms. Finally, a numerical example is provided to demonstrate this procedure.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.