Module Handbook

  • Dynamischer Default-Fachbereich geändert auf MAT

Module MAT-51-10-M-7

Location Theory (M, 9.0 LP)

Module Identification

Module Number Module Name CP (Effort)
MAT-51-10-M-7 Location Theory 9.0 CP (270 h)

Basedata

CP, Effort 9.0 CP = 270 h
Position of the semester 1 Sem. irreg.
Level [7] Master (Advanced)
Language [EN] English
Module Manager
Ruzika, Stefan, Prof. Dr. (PROF | DEPT: MAT)
Lecturers
Ruzika, Stefan, Prof. Dr. (PROF | DEPT: MAT)
Schöbel, Anita, Prof. Dr. (PROF | DEPT: MAT)
Area of study [MAT-OPT] Optimisation
Reference course of study [MAT-88.105-SG] M.Sc. Mathematics
Livecycle-State [NORM] Active

Notice

Due to large overlap of contents, this module cannot be included in the master's examination along with [MAT-51-11-M-7] or [MAT-51-12-M-7].

Courses

Type/SWS Course Number Title Choice in
Module-Part 		Presence-Time /
Self-Study 		SL SL is
required for exa. 		PL CP Sem.
4V+2U MAT-51-10-K-7
Location Theory
P 84 h 186 h - - PL1 9.0 irreg.
  • About [MAT-51-10-K-7]: Title: "Location Theory"; Presence-Time: 84 h; Self-Study: 186 h

Examination achievement PL1

  • Form of examination: oral examination (20-30 Min.)
  • Examination Frequency: irregular (by arrangement)
  • Examination number: 86280 ("Location Theory")

Evaluation of grades

The grade of the module examination is also the module grade.


Contents

From [MAT-51-10-K-7] Location Theory:
In the lecture and exercise classes, the fundamentals of network and discrete location theory as well as planar location theory are discussed. The last part of the module also presents current research topics that students could work on. The following contents will be covered in detail:
  • classification and formulations of location problems,
  • complexity results for location problems,
  • dealing with the fundamental concepts of location theory: finite dominating sets, location allocation, Weber problems,
  • optimality criteria depending on the structure of the class of location problem, in particular of the distance function,
  • exact, approximate and heuristic procedures for solving location problems,
  • extensions of location problems by considering several criteria,
  • discussion of current research directions, such as obnoxious location, dynamic models or combined location route planning.

Competencies / intended learning achievements

Upon successful completion of this module, the students have learnt about the applicability of location problems in industry and society. They have gained a good overview of the theory and common methods for solving planar and discrete location problems as well as location problems on networks. They are able to critically assess the possibilities and limitations of the algorithms and have been introduced to current research topics.

By completing the given exercises, the students have developed a skilled, precise and independent handling of the terms, propositions and techniques taught in the lecture. Moreover, they have learnt how to apply these techniques to new problems, analyze them and develop solution strategies.

Literature

From [MAT-51-10-K-7] Location Theory:
  • G. Laporte, S. Nickel, F. Saldanha da Gama: Location Science,
  • M. S. Daskin: Network and Discrete Location: Models, Algorithms, and Applications,
  • R.L. Francis, F. McGinnis, J.A. White: Facility Layout and Location,
  • H. Hamacher: Mathematische Lösungsverfahren für planare Standortprobleme,
  • R.F. Love, J.G. Morris, G.O. Wesolowski: Facilities Location.

References to Module / Module Number [MAT-51-10-M-7]

Module-Pool Name
[MAT-52-MPOOL-7] Specialisation Mathematical Optimisation (M.Sc.)
[MAT-AM-MPOOL-7] Applied Mathematics (Advanced Modules M.Sc.)