KLUEDO RSS FeedKLUEDO Dokumente/documents
https://kluedo.ub.uni-kl.de/index/index/
Mon, 16 Oct 2017 11:53:09 +0200Mon, 16 Oct 2017 11:53:09 +0200Restricted Planar Location Problems and Applications
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/4859
Facility location problems in the plane are among the most widely used tools of Mathematical Programming in modeling real-world problems. In many of these problems restrictions have to be considered which correspond to regions in which a placement of new locations is forbidden. We consider center and median problems where the forbidden set is
a union of pairwise disjoint convex sets. As applications we discuss the assembly of printed circuit boards, obnoxious facility location and the location of emergency facilities.H. W. Hamacher; S. Nickelreporthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/4859Mon, 16 Oct 2017 11:53:09 +0200Multicriterial Planar Location Problems
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/4856
Given Q different objective functions, three types of single-facility problems
are considered: Lexicographic, pareto and max ordering problems. After discussing the interrelation between the problem types, a complete characterization of lexicographic locations and some instances of pareto and max ordering locations is given. The characterizations result in efficient solution algorithms for finding these locations. The paper relies heavily on the theory of restricted locations developed by the same authors, and can be further extended, for instance, to multifacility problems with several objectives. The proposed approach is more general than previously published results on multicriteria planar location problems and is particulary suited for modelling real-world problems.H. W. Hamacher; S. Nickelreporthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/4856Mon, 16 Oct 2017 11:04:30 +0200Mathematical Modelling of Evacuation Problems: A State of Art
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1477
This paper details models and algorithms which can be applied to evacuation problems. While it concentrates on building evacuation many of the results are applicable also to regional evacuation. All models consider the time as main parameter, where the travel time between components of the building is part of the input and the overall evacuation time is the output. The paper distinguishes between macroscopic and microscopic evacuation models both of which are able to capture the evacuees' movement over time. Macroscopic models are mainly used to produce good lower bounds for the evacuation time and do not consider any individual behavior during the emergency situation. These bounds can be used to analyze existing buildings or help in the design phase of planning a building. Macroscopic approaches which are based on dynamic network flow models (minimum cost dynamic flow, maximum dynamic flow, universal maximum flow, quickest path and quickest flow) are described. A special feature of the presented approach is the fact, that travel times of evacuees are not restricted to be constant, but may be density dependent. Using multicriteria optimization priority regions and blockage due to fire or smoke may be considered. It is shown how the modelling can be done using time parameter either as discrete or continuous parameter. Microscopic models are able to model the individual evacuee's characteristics and the interaction among evacuees which influence their movement. Due to the corresponding huge amount of data one uses simulation approaches. Some probabilistic laws for individual evacuee's movement are presented. Moreover ideas to model the evacuee's movement using cellular automata (CA) and resulting software are presented. In this paper we will focus on macroscopic models and only summarize some of the results of the microscopic approach. While most of the results are applicable to general evacuation situations, we concentrate on building evacuation.H.W. Hamacher; S.A. Tjandrareporthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1477Mon, 02 Feb 2004 14:29:20 +0100Design of Zone Tariff Systems in Public Transportation
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1474
Given a public transportation system represented by its stops and direct connections between stops, we consider two problems dealing with the prices for the customers: The fare problem in which subsets of stops are already aggregated to zones and "good" tariffs have to be found in the existing zone system. Closed form solutions for the fare problem are presented for three objective functions. In the zone problem the design of the zones is part of the problem. This problem is NP hard and we therefore propose three heuristics which prove to be very successful in the redesign of one of Germany's transportation systemsH.W. Hamacher; A. Schöbelreporthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1474Mon, 02 Feb 2004 14:11:24 +0100Polyhedral Properties of the Uncapacitated Multiple Allocation Hub Location Problem
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1473
We examine the feasibility polyhedron of the uncapacitated hub location problem (UHL) with multiple allocation, which has applications in the fields of air passenger and cargo transportation, telecommunication and postal delivery services. In particular we determine the dimension and derive some classes of facets of this polyhedron. We develop some general rules about lifting facets from the uncapacitated facility location (UFL) for UHL and projecting facets from UHL to UFL. By applying these rules we get a new class of facets for UHL which dominates the inequalities in the original formulation. Thus we get a new formulation of UHL whose constraints are all facet–defining. We show its superior computational performance by benchmarking it on a well known data set.H.W. Hamacher; M. Labbé; S. Nickel; T. Sonnebornreporthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1473Mon, 02 Feb 2004 14:10:40 +0100The continuous stop location problem in public transportation networks
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1284
In this paper we consider the location of stops along the edges of an already existing public transportation network. This can be the introduction of bus stops along some given bus routes, or of railway stations along the tracks in a railway network. The positive effect of new stops is given by the better access of the potential customers to their closest station, while the increasement of travel time caused by the additional stopping activities of the trains leads to a negative effect. The goal is to cover all given demand points with a minimal amount of additional traveling time, where covering may be defined with respect to an arbitrary norm (or even a gauge). Unfortunately, this problem is NP-hard, even if only the Euclidean distance is used. In this paper, we give a reduction to a finite candidate set leading to a discrete set covering problem. Moreover, we identify network structures in which the coefficient matrix of the resulting set covering problem is totally unimodular, and use this result to derive efficient solution approaches. Various extensions of the problem are also discussed.A. Schöbel; H. W. Hamacher; A. Liebers; D. Wagnerpreprinthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1284Tue, 21 May 2002 00:00:00 +0200Finite Dominating Sets for Rectilinear Center Problems with Polyhedral Barriers
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/518
In planar location problems with barriers one considers regions which are forbidden for the siting of new facilities as well as for trespassing. These problems areimportant since they reflect various real-world situations.The resulting mathematical models have a non-convex objectivefunction and are therefore difficult to tackle using standardmethods of location theory even in the case of simple barriershapes and distance funtions.For the case of center objectives with barrier distancesobtained from the rectilinear or Manhattan metric it is shown that the problem can be solved by identifying a finitedominating set (FDS) the cardinality of which is bounded bya polynomial in the size of the problem input. The resultinggenuinely polynomial algorithm can be combined with bound computations which are derived from solving closely connectedrestricted location and network location problems.It is shown that the results can be extended to barrier center problems with respect to arbitrary block norms having fourfundamental directions.P.M. Dearing; Hamacher H.W.; K. Klamrothpreprinthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/518Mon, 03 Apr 2000 00:00:00 +0200