An efficient merge search matheuristic for maximising net present value in project scheduling
by Dhananjay R. Thiruvady; Su Nguyen; Christian Blum; Andreas T. Ernst
International Journal of Operational Research (IJOR), Vol. 51, No. 1, 2024

Abstract: Resource constrained project scheduling (RCPS) is an important combinatorial optimisation problem with many practical applications. With complex requirements such as precedence constraints, limited resources, and finance-based objectives, finding optimal solutions for large problem instances is very challenging. To address this challenge, we propose a new matheuristic algorithm based on merge search and parallel computing to solve RCPS with the aim of maximising the net present value. This paper presents merge search, a novel matheuristic designed for RCPS, which is a variable partitioning and merging mechanism to formulate restricted integer programs. Parallel ant colony optimisation can generate excellent solutions for RCPS, and we use this method to generate the solution pool. The experimental results show that the proposed method outperforms the current state-of-the-art algorithms on known benchmark problem instances. Further analyses also demonstrate that the proposed algorithm is substantially more efficient compared to its counterparts in respect to its convergence properties.

Online publication date: Mon, 09-Sep-2024

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com