Finding the shortest path with honey-bee mating optimization algorithm in project management problems with constrained/unconstrained resources

Authors:
Omid Bozorg Haddad;Mahsa Mirmomeni;Mahboubeh Zarezadeh Mehrizi;Miguel A. Mariño
Affiliations:
Department of Irrigation & Reclamation Engineering, Faculty of Soil & Water Engineering, College of Agriculture & Natural Resources, University of Tehran, Karaj, Iran;Abadgaran Construction Company, Tehran, Iran;Department of Hydraulic Structure, Faculty of Agriculture, Tarbiat Modares University, Tehran, Iran;Hydrology Program, Department of Civil & Environmental Engineering, and Department of Biological & Agricultural Engineering, University of California, Davis, USA 95616-8628
Venue:
Computational Optimization and Applications
Year:
2010

Citing 8
Cited 0

A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows

Computers and Operations Research - Special issue: heuristic, genetic and tabu search
An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation

Management Science
A tabu search algorithm for the open shop scheduling problem

Computers and Operations Research
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
A Hybrid Genetic Algorithm for the Single Machine Scheduling Problem

Journal of Heuristics
A branch and bound algorithm for the robust shortest path problem with interval data

A branch and bound algorithm for the robust shortest path problem with interval data
A genetic algorithm for resource-constrained scheduling

A genetic algorithm for resource-constrained scheduling
Dynamic algorithms for the shortest path routing problem: learning automata-based solutions

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Effective project management requires the development of a realistic plan and a clear communication of the plan from the beginning to the end of the project. The critical path method (CPM) of scheduling is the fundamental tool used to develop and interconnect project plans. Ensuring the integrity and transparency of those schedules is paramount for project success. The complex and discrete nature of the solution domain for such problems causes failing of traditional and gradient-based methods in finding the optimal or even feasible solution in some cases. The difficulties encountered in scheduling construction projects with resource constraints are highlighted by means of a simplified bridge construction problem and a basic masonry construction problem. The honey-bee mating optimization (HBMO) algorithm has been previously adopted to solve mathematical and engineering problems and has proven to be efficient for searching optimal solutions in large-problem domains. This paper presents the HBMO algorithm for scheduling projects with both constrained and unconstrained resources. Results show that the HBMO algorithm is applicable to projects with or without resource constraints. Furthermore, results obtained are promising and compare well with those of well-known heuristic approaches and gradient-based methods.