Paper Info
Title
Random assignment method based on genetic algorithms and its application in resource allocation
Abstract
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 @? 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.
Year
DOI
Venue
2012
10.1016/j.eswa.2012.04.055
Expert Syst. Appl.
Keywords
Field
DocType
management process,random assignment problem,resource allocation,solution model,genetic algorithm,valid solution,random variable,assignment process,random assignment method,new model,decision process,assignment problem,decision maker,markov chain,genetic algorithms
Weapon target assignment problem,Mathematical optimization,Quadratic assignment problem,Computer science,Generalized assignment problem,Assignment problem,Resource allocation,Optimization problem,Genetic algorithm,Linear bottleneck assignment problem
Journal
Volume
Issue
ISSN
39
15
0957-4174
Citations 
PageRank 
References 
8
0.45
13
Authors
4
Name
Order
Citations
PageRank
Fachao Li115722.30
Lida Xu26275279.34
Chenxia Jin310113.20
Hong Wang41357.79