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

Content Provider	Springer Nature Link
Author	Bozorg Haddad, Omid Mirmomeni, Mahsa Zarezadeh Mehrizi, Mahboubeh Mariño, Miguel A.
Copyright Year	2008
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.
Starting Page	97
Ending Page	128
Page Count	32
File Format	PDF
ISSN	09266003
Journal	Computational Optimization and Applications
Volume Number	47
Issue Number	1
e-ISSN	15732894
Language	English
Publisher	Springer US
Publisher Date	2008-10-03
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Critical path method (CPM) Honey-bee mating optimization (HBMO) Constrained/unconstrained resources Convex and Discrete Geometry Statistics Operations Research/Decision Theory Operations Research, Mathematical Programming Optimization
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Control and Optimization Computational Mathematics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

New efficient shortest path simplex algorithm: pseudo permanent labels instead of permanent labels

Shortest Path Auction Algorithm Without Contractions Using Virtual Source Concept

A recursive algorithm for constrained two-dimensional cutting problems

Path following in the exact penalty method of convex programming

Solving chance-constrained combinatorial problems to optimality

An optimal algorithm for a class of equality constrained quadratic programming problems with bounded spectrum

On the shortest path problem with negative cost cycles

A Shifted-Barrier Primal-Dual Algorithm Model for Linearly Constrained Optimization Problems

Graph Collapsing in Shortest Path Auction Algorithms

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

Similar Documents

New efficient shortest path simplex algorithm: pseudo permanent labels instead of permanent labels

Shortest Path Auction Algorithm Without Contractions Using Virtual Source Concept

A recursive algorithm for constrained two-dimensional cutting problems

Path following in the exact penalty method of convex programming

Solving chance-constrained combinatorial problems to optimality

An optimal algorithm for a class of equality constrained quadratic programming problems with bounded spectrum

On the shortest path problem with negative cost cycles

A Shifted-Barrier Primal-Dual Algorithm Model for Linearly Constrained Optimization Problems

Graph Collapsing in Shortest Path Auction Algorithms

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