The Multi Terminal q-FlowLoc Problem: A Heuristic

  • In this paper the multi terminal q-FlowLoc problem (q-MT-FlowLoc) is introduced. FlowLoc problems combine two well-known modeling tools: (dynamic) network flows and locational analysis. Since the q-MT-FlowLoc problem is NP-hard we give a mixed integer programming formulation and propose a heuristic which obtains a feasible solution by calculating a maximum flow in a special graph H. If this flow is also a minimum cost flow, various versions of the heuristic can be obtained by the use of different cost functions. The quality of this solutions is compared.

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Author:Stephanie Heller, Horst W. Hamacher
URN (permanent link):urn:nbn:de:hbz:386-kluedo-16862
Serie (Series number):Report in Wirtschaftsmathematik (WIMA Report) (136)
Document Type:Report
Language of publication:English
Year of Completion:2011
Year of Publication:2011
Publishing Institute:Technische Universität Kaiserslautern
Tag:(dynamic) network flows; FlowLoc; heuristic; location theory
Faculties / Organisational entities:Fachbereich Mathematik
DDC-Cassification:510 Mathematik

$Rev: 12793 $