Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4959044 | Computers & Operations Research | 2017 | 11 Pages |
Abstract
This study investigates optimal resource allocation for minimizing total cost in stochastic networks (SN) where the duration of all activities involved is not only a random variable, but also a function of the resources allocated. The total cost of the network comprises resource usage cost and penalty cost. An Electromagnetism Algorithm (EA) is used as a decision tool for optimization and a Label-Correcting Tracing Algorithm (LCTA) for approximation of completion time in SN is suggested. Furthermore, the Critical Path Cluster Algorithm (CPCA) and Cluster Local Search Algorithm (CLSA) are developed to enhance EA's search ability for resource allocation. Results from numerical experiments show that the proposed EA yields good solution quality.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Chu Weng-Ming, Chang Koan-Yuh,