New improved Ones assignment method

Khalid, M. M.; Sultana, Mariam; Zaidi, Faheem

doi:10.12988/ams.2014.45327

Cited by 4 publications

(7 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the 4 th row the smaller cost next to C * is $9, which corresponds to the cell (4, 1). Thereby, we make our first shift from (4,5) to (4,1). This shift and its corresponding induced shifts are shown in Table 12.…”

Section: (Ii) Find the First Set Of Shifts For Reduction In The Overa...mentioning

confidence: 99%

“…(Refer Table 15). Next, if we make a shift from (3,4) to (3,1) or (3,4) to (3,5), then they also makes no further improvement in Z.…”

Section: (Ii) Find the First Set Of Shifts For Reduction In The Overa...mentioning

confidence: 99%

“…In the same year 2014, Khalid M. et al [5] introduced the New Improved Ones Assignment Method (NIOAM), which leads to brief computation time comparatively and will attain an exact optimal solution. Besides, this improved version will overcome the drawbacks as specified by Gamal M.D.H.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

NILA – An Innovative Technique for Optimality Testing and Optimizing a Solution in Assignment Problems

Murugesan¹,

Selvi²

2022

GJPAM

View full text Add to dashboard Cite

In this research article, we propose a very simple and innovative iterative technique named NILA (equivalent name for the MOON in the classical Tamil language) for optimality testing and also optimization of a solution obtained by a method in assignment problems. The NILA technique has been tested on a number of near optimal and optimal solutions obtained for many balanced and unbalanced assignment problems by several other available methods. Testing results validate that the proposed NILA technique is the ideal one for testing the optimality of an obtained solution and also optimizing that solution, if that's not optimal. Thereby, we obtain the 'tested optimal' solutions to assignment problems. Another added advantage of the proposed technique is that it also generates the possible numbers of alternative optimal solutions to a given assignment problem, it they exist to the problem. Howsoever, we have to accept the reality that for the assignment problems the solutions generated by the 'Hungarian' method and the 'Mantra' technique are 'optimal by default' (not necessary to test its optimality). It is the design (divine!) specialty of the two methods.

show abstract

Section: (Ii) Find the First Set Of Shifts For Reduction In The Overa...mentioning

confidence: 99%

“…(Refer Table 15). Next, if we make a shift from (3,4) to (3,1) or (3,4) to (3,5), then they also makes no further improvement in Z.…”

Section: (Ii) Find the First Set Of Shifts For Reduction In The Overa...mentioning

confidence: 99%

See 1 more Smart Citation

NILA – An Innovative Technique for Optimality Testing and Optimizing a Solution in Assignment Problems

Murugesan¹,

Selvi²

2022

GJPAM

View full text Add to dashboard Cite

show abstract

“…Many previous studies on assignment problems have been conducted, including a new technique for determining the optimal solution to assignment problems with maximization objective functions [17]. The assignment problem is a subset of linear programming [18,19,20,21,22]. The One to One Fixed Method will be used in this study to determine optimal solutions in learning outcomes.…”

Section: Introductionmentioning

confidence: 99%

Determining Optimal Solutions in Learning Outcome Using One to One Fixed Method

Wulan¹,

Jamaluddin²,

Ramadhan³

2021

Proceedings of the International Conference on Science and Engineering (ICSE-UIN-SUKA 2021)

View full text Add to dashboard Cite

General assignment problems include n tasks that must be assigned to m workers where each worker has different competencies in completing each task. This research discusses the problem of solving minimization case assignments using a new method, namely the One-to-One Fixed Method. Completion of the One-to-One Fixed method starts by seeing whether the data obtained is balanced or not, if not then an additional dummy, if yes then proceed to the next stage, calculate the penalty by subtracting each row and column with the smallest element, and combining the results of subtracting rows and column into one table. Next, count those that are affected by the line 2 times and are added and are not affected by the line minus the smallest cost that is not affected by the line, if you have not found the optimal result then repeat the steps until you find the optimal result. In the problem of assigning the minimization case after using the One to One Fixed method on a 3 × 3 matrix, the total cost to be incurred by the Islamic Higher

show abstract

“…Other methods may include one by Kosowsky and Yuille [5] that uses statistical physics, another by Basirzadh [6] called Ones Assignment method, which is somewhat similar to the Hungarian and minimizes or maximizes the objective function,the revised Ones Assignment Method by Muley and Ghade [7]. Lastly, new improved ones assignment mehod by authors of this study [8]. This study puts forward and investigates a fresh approach to the solution of the assignment problem.…”

Section: Introductionmentioning

confidence: 99%

A new diagonal optimal approach for assignment problem

Khalid¹,

Sultana²,

Zaidi³

2014

ams

Self Cite

View full text Add to dashboard Cite

Different situations give rise to the assignment problem, where we must discover an optimal way to assign 'n' objects to 'm' in an bijective function. We have, in this research, propose the possibility of solving exactly the Linear Assignment Problem with a method that would be more efficient than the Hungarian method of exact solution. This method is based on applying a series of pairwise interchanges of assignments to a starting heuristically generated feasible solution, wherein each pairwise interchange is guaranteed to improve the objective function value of the feasible solution.It seems that our algorithm finds the optimal solution which is the same as one found by the Hungarian method, but in much simpler. 7980 M. Khalid et al.

show abstract

New improved Ones assignment method

Cited by 4 publications

References 2 publications

NILA – An Innovative Technique for Optimality Testing and Optimizing a Solution in Assignment Problems

NILA – An Innovative Technique for Optimality Testing and Optimizing a Solution in Assignment Problems

Determining Optimal Solutions in Learning Outcome Using One to One Fixed Method

A new diagonal optimal approach for assignment problem

Contact Info

Product

Resources

About