REFING: heuristic to solve bi-objective resource allocation problem with bound and varying capacity
From MaRDI portal
Publication:2627405
DOI10.1504/IJOR.2013.053620zbMath1362.90117MaRDI QIDQ2627405
S. P. Anbuudayasankar, R. A. Malairajan, Tzong-Ru Lee, K. Ganesh
Publication date: 31 May 2017
Published in: International Journal of Operational Research (Search for Journal in Brave)
genetic algorithmsrecursive functionmulti-commodity network flowbi-objective resource allocationcapacity variation
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
This page was built for publication: REFING: heuristic to solve bi-objective resource allocation problem with bound and varying capacity