Using Discrete Differential Evolution and Entropy to Solve the MRCPSP
Using Discrete Differential Evolution and Entropy to Solve the MRCPSP
Angela Hsiang-Ling Chen, Yun-Chia Liang and Jose David Padilla
Angela Hsiang-Ling Chen, Yun-Chia Liang and Jose David Padilla
Department of Marketing and Distribution Management, Nanya Institute of Technology, Taiwan
Department of Industrial Engineering and Management,Yuan Ze University, Taiwan
Department of Industrial Engineering and Management,Yuan Ze University, Taiwa
Department of Marketing and Distribution Management, Nanya Institute of Technology, Taiwan
Department of Industrial Engineering and Management,Yuan Ze University, Taiwan
Department of Industrial Engineering and Management,Yuan Ze University, Taiwa
Optimal resource allocation in project management has been an intensively
researched
problem. However, to date, there is no guideline that can help practitioners
generate schedules capable of withstanding the inherent uncertainty of
projects. In
a previous study, the authors proposed a practical methodology to help
alleviate
this issue and obtained favorable results when testing with benchmark
instances. In
this study, a different optimization algorithm, a discrete Differential
Evolution,
is employed to confirm that the proposed methodology is stable, efficient, and
practical.
