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.
Download full text files
Additional Services
| Author: | Stephanie Heller, Horst W. Hamacher |
|---|---|
| URN: | urn:nbn:de:hbz:386-kluedo-16862 |
| Series (Serial Number): | Report in Wirtschaftsmathematik (WIMA Report) (136) |
| Document Type: | Report |
| Language of publication: | English |
| Year of Completion: | 2011 |
| Year of first Publication: | 2011 |
| Publishing Institution: | Technische Universität Kaiserslautern |
| Date of the Publication (Server): | 2011/03/02 |
| Tag: | (dynamic) network flows; FlowLoc; heuristic; location theory |
| Faculties / Organisational entities: | Kaiserslautern - Fachbereich Mathematik |
| DDC-Cassification: | 5 Naturwissenschaften und Mathematik / 510 Mathematik |
| Licence (German): |  Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011 |