.png){kind=icon}
.png){kind=icon}
Return
Random assignment method based on genetic algorithms and its application in resource allocation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2012.04.055.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Assignment problem is considered a well-known optimization problem in manufacturing and management processes in which a decision maker's point of view is merged into a decision process and a valid solution is established. In this study, taking the complementary relations between expected value and variance in decision making and the synthesizing effect of random variables into consideration, a new model for random assignment problems is proposed; in which the characteristic of assignment problems are considered to present a concrete scheme based on genetic algorithms (denoted by SE circle plus GA-SAF, for short). We study the model's convergence using the Markov chain theory, and analyze its performance through simulation. All of these indicate that this solution model can effectively aid decision making in the assignment process, and that it possesses the desirable features such as interpretability and computational efficiency, as such it can be widely used in many aspects including manufacturing, operations, logistics, etc. (C) 2012 Elsevier Ltd. All rights reserved.
Keywords:
Random assignment problem
Synthesizing effect
Genetic algorithms
Markov chain
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
2.9W
Citations:
10.2W