Publication Type:

Journal Article

Source:

International Journal of Operational Research, Volume 17, Number 2, p.145-169 (2013)

URL:

http://www.scopus.com/inward/record.url?eid=2-s2.0-84877247831&partnerID=40&md5=23b5d1248f9b6f97a7da35dcf4f4d951

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. © 2013 Inderscience Enterprises Ltd.

Notes:

cited By (since 1996)0

Cite this Research Publication

R. Aa Malairajan, Ganesh, Kb, Lee, T. - Rc, and Anbuudayasankar, S. Pd, “REFING: Heuristic to solve bi-objective resource allocation problem with bound and varying capacity”, International Journal of Operational Research, vol. 17, pp. 145-169, 2013.

207
PROGRAMS
OFFERED
5
AMRITA
CAMPUSES
15
CONSTITUENT
SCHOOLS
A
GRADE BY
NAAC, MHRD
9th
RANK(INDIA):
NIRF 2017
150+
INTERNATIONAL
PARTNERS
  • Amrita on Social Media

  • Contact us

    Amrita Vishwa Vidyapeetham
    Amritanagar, Coimbatore - 641 112
    Tamilnadu, India