COMBINATION METHOD: VERY FAST RANKING PROCEDURE WITH GLOBAL SOLUTION(S) BASED ON PERMUTATION METHOD

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

ASGHARPOUR M.J.; GHASEMI K.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: AMIRKABIR Year:2002 | Volume:13 | Issue:51 Page(s): 361-381

Download Full-Text

Persian Verion

View:

1,589

Download:

Cites:

Information Journal Paper

Title

COMBINATION METHOD: VERY FAST RANKING PROCEDURE WITH GLOBAL SOLUTION(S) BASED ON PERMUTATION METHOD

Author(s)

ASGHARPOUR M.J. | GHASEMI K.

Keywords

PERMUTATIONQ4

COMBINATIONQ4

MADMQ4

RANKINGQ4

LINEAR ORDERINGQ4

VALUE FUNCTIONQ4

NP-HARD PROBLEMQ4

GLOBAL OPTIMAL SOLUTIONQ4

Abstract

PERMUTATION method is one of the MADM techniques. This method can find and determine the best LINEAR ORDERING of the alternatives on the basis of maximizing a test called "T" test. Unfortunately, to reach the final result by PM, needs tremendous amount of CPU-time and increases exponentially as the number of the alternatives increases. Therefore it can be categorized as NP-Hard. There are many heuristic methods in literatures which try to find local solutions of the PERMUTATION method. The following new COMBINATION method applies to optimization conditions during the calculating process (by defining two main rules). It reduces the searching space continuously and computes the final GLOBAL OPTIMAL SOLUTIONs with respect to VALUE FUNCTIONs properties. The new COMBINATION method is about 120,000 times faster than PERMUTATION method with the same conditions and 10 alternatives and based on empirical data. COMBINATION method can be developed for other LINEAR ORDERING problems such as traveling salesman, one machine or one job scheduling and preferential voting system.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

ASGHARPOUR, M.J., & GHASEMI, K.. (2002). COMBINATION METHOD: VERY FAST RANKING PROCEDURE WITH GLOBAL SOLUTION(S) BASED ON PERMUTATION METHOD. AMIRKABIR, 13(51), 361-381. SID. https://sid.ir/paper/802/en

Vancouver: Copy

ASGHARPOUR M.J., GHASEMI K.. COMBINATION METHOD: VERY FAST RANKING PROCEDURE WITH GLOBAL SOLUTION(S) BASED ON PERMUTATION METHOD. AMIRKABIR[Internet]. 2002;13(51):361-381. Available from: https://sid.ir/paper/802/en

IEEE: Copy

M.J. ASGHARPOUR, and K. GHASEMI, “COMBINATION METHOD: VERY FAST RANKING PROCEDURE WITH GLOBAL SOLUTION(S) BASED ON PERMUTATION METHOD,” AMIRKABIR, vol. 13, no. 51, pp. 361–381, 2002, [Online]. Available: https://sid.ir/paper/802/en

Related Journal Papers