The Best Candidates Method for Solving Optimization Problems

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.

Solving Transportation Problems Using the Best Candidates Method

“…Basically, these methods are different in term of the quality for the produced basic starting solution and the best starting solution that yields smaller objective value. In this study, we used the Vogel's approximation method, since it generally produces better starting solutions than other solving methods; as well we have used the BCM solution steps [8].…”

Evaluation of total dissolved solids in rivers by improved neuro fuzzy approaches using metaheuristic algorithms

“…Although random in some characteristics, GA is not completely coincidental because it makes use of past data to determine where to explore next. Several fields of knowledge have found success using GAs to solve optimization challenges (Ahmad, 2012). Steps for the modified GA are listed as follows:…”

Pendistribusian Penjualan Beras Menggunakan Best Candidate Method Dan Modi

“…Jejak digambarkan sesudah ditemukan sel dengan indeks yang mempunyai harga negatif terbesar. Artinya, untuk dapat menentukan sel yang akan masuk ke dalam penyelesaian berikutnya seperti pada cara batu loncatan [7].…”