Problem statement:This study is about describing solution technique called Best Candidates Method (BCM) for solving optimization problems; the goal is to minimize the computation time to get the optimal solution. In this study I apply the BCM to the linear assignment problems (LAP) that is one of the optimization problems in the Operation Research (OR). Approach: The optimization problem solution methods operate in two ways. First, that find all available combinations in sequential or parallel solution manner then compare the results to get the optimal one, but its need a very large computation time either for a large scale problems. Second, is to try to reach directly the optimal solution using different methods, but all available methods not always reach the optimal solution and have a complex solution technique or have a long computation time. Results: The BCM elect the best candidates that give the lowest combinations to get the optimal solution. Conclusion/Recommendations: The BCM minimize the computation time and reduce the complexity where we can apply this method to different area of optimization problems.
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
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.