A hybrid algorithm based on simplex search and differential evolution for resource-constrained project scheduling problem

Authors:
Ling Wang;Ye Xu;Chen Fang
Affiliations:
Tsinghua National Laboratory for Information Science and Technology (TNList), Department of Automation, Tsinghua University, Beijing, P.R. China;Tsinghua National Laboratory for Information Science and Technology (TNList), Department of Automation, Tsinghua University, Beijing, P.R. China;Tsinghua National Laboratory for Information Science and Technology (TNList), Department of Automation, Tsinghua University, Beijing, P.R. China
Venue:
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing
Year:
2011

Citing 5
Cited 0

Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions

SIAM Journal on Optimization
Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

Journal of Global Optimization
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)

Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
An effective hybrid algorithm based on simplex search and differential evolution for global optimization

ICIC'09 Proceedings of the Intelligent computing 5th international conference on Emerging intelligent computing technology and applications
Opposition-Based Differential Evolution

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, an effective hybrid algorithm is proposed to solve the resource-constrained project scheduling problem by merging Nelder-Mead (NM) simplex method and differential evolution (DE). The individuals are encoded with the priority value based method and decoded by serial schedule generate scheme (SGS). Moreover, a reasonable framework is proposed to hybridize the simplex-based geometric search and the DE-based evolutionary search, and the simplex search is modified to further improve the quality of solutions obtained by DE. By interactively using the two methods with different mechanisms, the searching behavior can be enriched and the exploration and exploitation abilities can be well balanced. Simulation results based on some benchmarks demonstrate the effectiveness of the proposed hybrid algorithm.