Research Article Open Access

The Best Candidates Method for Solving Optimization Problems

Hlayel Abdallah Ahmad1
  • 1 , Afganistan
Journal of Computer Science
Volume 8 No. 5, 2012, 711-715

DOI: https://doi.org/10.3844/jcssp.2012.711.715

Submitted On: 28 April 2011 Published On: 27 February 2012

How to Cite: Ahmad, H. A. (2012). The Best Candidates Method for Solving Optimization Problems. Journal of Computer Science, 8(5), 711-715. https://doi.org/10.3844/jcssp.2012.711.715

Abstract

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.

  • 1,498 Views
  • 3,928 Downloads
  • 6 Citations

Download

Keywords

  • Operation research
  • linear assignment problems
  • optimization problems
  • hungarian method
  • best candidates method
  • optimal solution
  • solving optimization
  • candidates method
  • objective function
  • programming problem