Particle Swarm and Ant Colony Algorithms Hybridized for Multi-Mode Resource-constrained Project Scheduling Problem with Minimum Time Lag

Abstract

MMRCPSP/MIN has been proved to be a NP-hard problem. Based on the introduction of model of project scheduling problem with minimum time lag developed by Roland Heilmann, the paper analyzed two swarm intelligence algorithms which have good performance in solving combinatorial optimization problem-ACO and PSO algorithms. Based on analysis of these algorithms… (More)

Topics

3 Figures and Tables

Slides referencing similar topics