A scatter search hybrid algorithm for resource availability cost problem

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper discusses the resource availability cost problem (RACP) with the objective of minimizing the total cost of the unlimited renewable resources by a prespecified project deadline. A tabued scatter search (TSS) algorithm is developed to solve the RACP. The deadline constraint is handled in coding. A tabu search module is embedded in the framework of scatter search. A computational experiment was conducted and the computational results show that the proposed TSS hybrid algorithm is effective and advantageous for the RACP.

Author supplied keywords

Cite

CITATION STYLE

APA

Meng, H., Wang, B., Nie, Y., Xia, X., & Zhang, X. (2016). A scatter search hybrid algorithm for resource availability cost problem. In Advances in Intelligent Systems and Computing (Vol. 382, pp. 39–51). Springer Verlag. https://doi.org/10.1007/978-3-662-47926-1_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free