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

Summary: 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.