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

DOI10.1007/S10589-008-9210-9MaRDI QIDQ707776zbMATH OpenOpenAlexFDO

Authors Omid Bozorg Haddad, Mahsa Mirmomeni, Mahboubeh Zarezadeh Mehrizi, M. A. Mariño

Publication date 8 October 2010

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10589-008-9210-9

zbMATH Keywords

constrained/unconstrained resourcescritical path method (CPM)honey-bee mating optimization (HBMO)

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Comparative analysis of swarm intelligence and heuristic priority rules for solving multi-project scheduling problem
• Hybrid particle swarm and differential evolution algorithm for solving multimode resource-constrained project scheduling problem
• An efficient particle swarm optimizer with application to man-day project scheduling problems
• scientific article; zbMATH DE number 5845931
• Application of GA optimization for solving precedent relationship problem in project scheduling

Cites work

• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 1300399 (Why is no real title available?)
• scientific article; zbMATH DE number 1488066 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• A branch and bound algorithm for the robust shortest path problem with interval data.
• A hybrid genetic algorithm for the single machine scheduling problem
• A tabu search algorithm for the open shop scheduling problem
• A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows
• An exact algorithm for project scheduling with multiple modes
• An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
• Dynamic programming algorithms for the elementary shortest path problem with resource constraints
• Honey-bee mating optimization (HBMO) algorithm for optimal reservoir operation
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Optimization by simulated annealing
• PROGRESS: Optimally solving the generalized resource-constrained project scheduling problem
• Parallel Algorithms for Dynamic Shortest Path Problems
• Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure

Cited in

(2)

• Solving project scheduling problems with a heuristic learning algorithm
• Co-adaptability solution to conflict events in construction projects by segmented hierarchical algorithm

Describes a project that uses

Uses Software

• PROGRESS

This page was built for publication: Finding the shortest path with honey-bee mating optimization algorithm in project management problems with constrained/unconstrained resources

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q707776)