A METAHEURISTIC ALGORITHM FOR STOCHASTIC ASSIGNMENT PROBLEM

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.

ESHGHI K.; ARAGHI M.

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

Journal Paper

Paper Information

Journal: INDUSTRIAL ENGINEERING & MANAGEMENT SHARIF (SHARIF: ENGINEERING) Year:2009 | Volume:24 | Issue:45 Page(s): 3-12

Download Full-Text

Persian Verion

View:

2,078

Download:

Cites:

Information Journal Paper

Title

A METAHEURISTIC ALGORITHM FOR STOCHASTIC ASSIGNMENT PROBLEM

Author(s)

ESHGHI K. | ARAGHI M. | Issue Writer Certificate

Keywords

ASSIGNMENT PROBLEMQ3

ANT COLONY OPTIMIZATION ALGORITHMQ3

METAHEVRISTICSQ3

Abstract

In this paper, a metahevristic algorithm, based on the Ant Colony Optimization (ACO) method, is presented for solving stochastic ASSIGNMENT PROBLEMs. In a stochastic ASSIGNMENT PROBLEM, it is assumed that agents will arrive with a known distribution function and the working time of each agent is also a stochastic variable and can be determined by a normal distribution function. Furthermore, it is also assumed that the proficiency of each agent is a stochastic variable. After modeling the problem, an ACO algorithm is developed to solve the model. Furthermore, in an evaluation phase of the objective function, a simulation algorithm is also presented. Finally, the convergence of the proposed algorithm is shown on some randomly generated test problems. Computational results show the efficiency of this algorithm in comparison to the other techniques for solving stochastic ASSIGNMENT PROBLEMs.

Cites

No record.

References

No record.

Cite

APA: Copy

ESHGHI, K., & ARAGHI, M.. (2009). A METAHEURISTIC ALGORITHM FOR STOCHASTIC ASSIGNMENT PROBLEM. INDUSTRIAL ENGINEERING & MANAGEMENT SHARIF (SHARIF: ENGINEERING), 24(45), 3-12. SID. https://sid.ir/paper/107589/en

Vancouver: Copy

ESHGHI K., ARAGHI M.. A METAHEURISTIC ALGORITHM FOR STOCHASTIC ASSIGNMENT PROBLEM. INDUSTRIAL ENGINEERING & MANAGEMENT SHARIF (SHARIF: ENGINEERING)[Internet]. 2009;24(45):3-12. Available from: https://sid.ir/paper/107589/en

IEEE: Copy

K. ESHGHI, and M. ARAGHI, “A METAHEURISTIC ALGORITHM FOR STOCHASTIC ASSIGNMENT PROBLEM,” INDUSTRIAL ENGINEERING & MANAGEMENT SHARIF (SHARIF: ENGINEERING), vol. 24, no. 45, pp. 3–12, 2009, [Online]. Available: https://sid.ir/paper/107589/en

Related Journal Papers