Home // FUTURE COMPUTING 2012, The Fourth International Conference on Future Computational Technologies and Applications // View article

Multiple Trajectory Search for the Resource-Constrained Project Scheduling Problem

Authors:
Lin-Yu Tseng
Kuan-Cheng Lin

Keywords: resource-constrained project scheduling problem; multiple trajectory search; peak crossover; forward-backward improvement

Abstract:
The resource-constrained project scheduling problem is one of the most important scheduling problems and has attracted much attention of researchers. In this study, we proposed a new metaheuristic called the multiple trajectory search for solving this problem. The multiple trajectory search algorithm was previously proposed by us to solve the real-parameter optimization problems, both single-objective and multi-objective. And its performance was good as revealed by the ranking in the competitions held in 2008 and 2009 IEEE Congress on Evolutionary Computation. In this study, we arranged the multiple trajectory search algorithm to solve a combinatorial problem – the resource-constrained project scheduling problem. The experimental results show that the proposed method is competitive with other state-of-the-art methods, especially for the problem sets with 30 and 60 activities.

Pages: 74 to 79

Copyright: Copyright (c) IARIA, 2012

Publication date: July 22, 2012

Published in: conference

ISSN: 2308-3735

ISBN: 978-1-61208-217-2

Location: Nice, France

Dates: from July 22, 2012 to July 27, 2012