REFING: heuristic to solve bi-objective resource allocation problem with bound and varying capacity

R.A. Malairajan, K. Ganesh, Tzong-Ru Lee and S.P. Anbuudayasankar

International Journal of Operational Research, 2013, vol. 17, issue 2, 145-169

Abstract: One of the important extensions of the classical multi-commodity network flow (MCNF) problem in bi-objective resource allocation problem with bound and varying capacity (BORAPBVC). We developed a recursive function inherent genetic algorithm (REFING) to solve MCNF problem and BORAPBVC. The objective of BORAPBVC problem is to find the optimal allocation with the consideration of two objectives and lower and upper bound as the service limit in the serving nodes with varying capacity. The REFING heuristic is tested for randomly generated datasets of BORAPBVC. When compared with the results of brute force method, REFING has performed better both in terms of solution quality and computational time.

Keywords: multi-commodity network flow; bi-objective resource allocation; genetic algorithms; capacity variation; recursive function. (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=53620 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:17:y:2013:i:2:p:145-169

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().