Solving MRCPSP by a Hybrid Genetic Algorithm

Yan Li; Lloyd Gibson

doi:10.4028/www.scientific.net/AMM.411-414.2369

Paper Titles

A Case Study of AGV Scheduling for Production Material Handling
p.2351

Exploring Semi-Autonomous Structure for Emergency Logistics Multi-Agent System
p.2355

Hybrid Simulate Annealing Algorithm Based Dynamic Crew Scheduling Research
p.2359

Aircraft Dynamic Scheduling Algorithm Research Based on Heuristic Column Generation Algorithm
p.2364

Solving MRCPSP by a Hybrid Genetic Algorithm
p.2369

The Influence of Training Step on Price Forecasting Based on Support Vector Machine
p.2373

Financial Distress Study Based on PSO K-Means Clustering Algorithm and Rough Set Theory
p.2377

The Workflow Management System Basing on the Flexibility of Rule Engine
p.2384

Research and Design on Hotel Chain Intelligent Management System
p.2387

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 411-414Solving MRCPSP by a Hybrid Genetic Algorithm

Solving MRCPSP by a Hybrid Genetic Algorithm

Abstract:

In this paper we present a genetic algorithm for the multi-mode resource-constrained project scheduling problem (MRCPSP), in which multiple execution modes are available for each of the activities of the project. To solve the problem, we apply a hybrid genetic algorithm, which makes use of nonrenewable resource feasibility checking procedure, local search based mutation and topological sort procedure. We present detailed computational results for the MRCPSP, which reveal that our procedure is effective in solving the problem.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 411-414)

Pages:

2369-2372

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.411-414.2369

Citation:

Cite this paper

Online since:

September 2013

Authors:

Yan Li, Lloyd Gibson

Keywords:

Genetic Algorithm (GA), Local Search, Multi-Mode, Project Scheduling

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Bouleimen, K. and H. Lecocq, A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. European Journal of Operational Research. 2(2003) 268-281.

DOI: 10.1016/s0377-2217(02)00761-0

Google Scholar

[2] Jarboui, B., et al., A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems. Applied Mathematics and Computation. 1(2008) 299-308.

DOI: 10.1016/j.amc.2007.04.096

Google Scholar

[3] Wuliang, P. and W. Chengen, A multi-mode resource-constrained discrete time–cost tradeoff problem and its genetic algorithm based solution. International Journal of Project Management. 6(2009) 600-609.

DOI: 10.1016/j.ijproman.2008.10.009

Google Scholar

[4] Coelho, J. and M. Vanhoucke, Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers. European Journal of Operational Research. 1(2011) 73-82.

DOI: 10.1016/j.ejor.2011.03.019

Google Scholar

[5] Ghoddousi, P., et al., Multi-mode resource-constrained discrete time–cost-resource optimization in project scheduling using non-dominated sorting genetic algorithm. Automation in Construction. 0(2013) 216-227.

DOI: 10.1016/j.autcon.2012.11.014

Google Scholar

[6] Nabipoor Afruzi, E., et al., A multi-mode resource-constrained discrete time–cost tradeoff problem solving using an adjusted fuzzy dominance genetic algorithm. Scientia Iranica, Transactions E: Industrial Engineering(2013).

DOI: 10.1016/j.scient.2012.12.024

Google Scholar

[7] Gen, M. and R. Cheng, Genetic algorithms and engineering optimization. Wiley-interscience. (2000).

Google Scholar