Author:
Kumar Santosh,Al-Hasani Ali,Al-Rabeeah Masar,Eberhard Andrew
Abstract
Abstract
A need for an optimal solution for a given mathematical model is well known and many solution approaches have been developed to identify efficiently an optimal solution for a given situation. For example, one such class of mathematical models with industrial applications have been classified as mathematical programming models (MPM). The main idea behind these models is to find the optimal solution described by those models and interpret the solution back with respect to the given industrial situation. However, the same is not true for a ‘K’number of ranked optimal solutions, where K ≥ 2. Mathematically, the Kth best solution, K ≥ 2, deals with determination of the 2nd, 3rd, 4th or in general the Kth best solution. This Kth best solution, K ≥ 2, suddenly becomes much more demanding with respect to computational requirements, which increases with the increase in the value of K. This paper first identifies difficulties associated with determination of ranked solutions and later develops a random search method to find ranked optimal solutions in the case of an assignment problem. We test the efficiency of the proposed approach by executing the random search method on a number of different size assignment problems.
Subject
General Physics and Astronomy
Reference24 articles.
1. An improved cpu time in triangle splitting method for solving a biobjective mixed integer program;Al-Hasani;Int J Math Eng Manag Sci,2018
2. Bi-objective integer programming analysis based on the characteristic equation;Al-Rabeeah;International Journal of System Assurance Engineering and Management,2019
3. Computational Enhancement in the Application of the Branch and Bound Method for Linear Integer Programs and Related Models;Al-Rabeeah;International Journal of Mathematical, Engineering and Management Sciences,2019
4. A discussion of random methods for seeking maxima;Brooks;Operations research,1958
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献