An efficient hybrid search algorithm for various optimization problems
This paper describes a detailed study of a recursive search algorithm for different optimization problems. Although the algorithm has been originally developed for a project scheduling problem with financial objectives, we show that it can be extended to many other application areas and therefore, can serve as a sub-procedure for various optimization problems. The contribution of the paper is threefold. First, we present a hybrid recursive search procedure for the project scheduling problem with net present value maximization and compare it with state-of-the-art procedures by means of computational tests. Second, we show how the procedure can be adapted to two other application areas: project scheduling with work continuity minimization and the open pit mining problem. Last, we highlight some future research areas where this hybrid procedure might bring a promising contribution.
|Date of creation:||Jan 2006|
|Date of revision:|
|Contact details of provider:|| Postal: Hoveniersberg 4, B-9000 Gent|
Phone: ++ 32 (0) 9 264 34 61
Fax: ++ 32 (0) 9 264 35 92
Web page: http://www.ugent.be/eb
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Elmaghraby, Salah E. & Herroelen, Willy S., 1990. "The scheduling of activities to maximize the net present value of projects," European Journal of Operational Research, Elsevier, vol. 49(1), pages 35-49, November.
- Herroelen, Willy S. & Van Dommelen, Patrick & Demeulemeester, Erik L., 1997. "Project network models with discounted cash flows a guided tour through recent developments," European Journal of Operational Research, Elsevier, vol. 100(1), pages 97-121, July.
- Jean-Claude Picard, 1976. "Maximal Closure of a Graph and Applications to Combinatorial Problems," Management Science, INFORMS, vol. 22(11), pages 1268-1272, July.
- Bruce Faaland & Kiseog Kim & Tom Schmitt, 1990. "A New Algorithm for Computing the Maximal Closure of a Graph," Management Science, INFORMS, vol. 36(3), pages 315-331, March.
- Herroelen, Willy S. & Gallens, Els, 1993. "Computational experience with an optimal procedure for the scheduling of activities to maximize the net present value of projects," European Journal of Operational Research, Elsevier, vol. 65(2), pages 274-277, March.
- Khaled El-Rayes & Osama Moselhi, 1998. "Resource-driven scheduling of repetitive activities," Construction Management and Economics, Taylor & Francis Journals, vol. 16(4), pages 433-446.
- Vanhoucke, Mario & Demeulemeester, Erik & Herroelen, Willy, 2003. "Progress payments in project scheduling problems," European Journal of Operational Research, Elsevier, vol. 148(3), pages 604-620, August.
- Mario Vanhoucke & Erik Demeulemeester & Willy Herroelen, 2001. "On Maximizing the Net Present Value of a Project Under Renewable Resource Constraints," Management Science, INFORMS, vol. 47(8), pages 1113-1121, August.
- M. Vanhoucke, 2004. "Work Continuity Constraints In Project Scheduling," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 04/265, Ghent University, Faculty of Economics and Business Administration.
- A. H. Russell, 1970. "Cash Flows in Networks," Management Science, INFORMS, vol. 16(5), pages 357-373, January.
When requesting a correction, please mention this item's handle: RePEc:rug:rugwps:06/365. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Nathalie Verhaeghe)
If references are entirely missing, you can add them using this form.