OPUS 4 | Search

Zwei auf einen Streich: Optimierte dynamische Einsatzplanung für Gelbe Engel und Lastenaufzüge (2007)

Jörg Rambau Cornelius Schwarz

Wir modellieren zwei verschiedene dynamische Einsatzplanungsprobleme: die dynamische Einsatzplanung Gelber Engel beim ADAC und die Steuerung von Lastenaufzügen in einem Versandlager der Herlitz PBS AG. Wir benutzen eine Reoptimierungspolitik, die die Steuerung des Systems mit Hilfe der Lösung von statischen Schnappschussproblemen durchführt. Für die auftretenden Schnappschussprobleme vergleichen wir zwei Modellierungsansätze (Flussmodell versus Tourenmodell), von denen nur einer echtzeittauglich ist. Das Verfahren zur dynamischen Einsatzplanung Gelber Engel ist beim ADAC in Betrieb.

There are integral heptagons, no three points on a line, no four on a circle (2007)

Tobias Kreisel Sasch Kurz

We give two configurations of seven points in the plane, no three points in a line, no four points on a circle with pairwise integral distances. This answers a famous question of Paul Erdös.

The Top-Dog Index: A New Measurement for the Demand Consistency of the Size Distribution in Pre-Pack Orders for a Fashion Discounter with Many Small Branches (2008)

Sascha Kurz Jörg Rambau Jörg Schlüchtermann Rainer Wolf

We propose the new Top-Dog-Index, a measure for the branch-dependent historic deviation of the supply data of apparel sizes from the sales data of a fashion discounter. A common approach is to estimate demand for sizes directly from the sales data. This approach may yield information for the demand for sizes if aggregated over all branches and products. However, as we will show in a real-world business case, this direct approach is in general not capable to provide information about each branchs individual demand for sizes: the supply per branch is so small that either the number of sales is statistically too small for a good estimate (early measurement) or there will be too much unsatisfied demand neglected in the sales data (late measurement). Moreover, in our real-world data we could not verify any of the demand distribution assumptions suggested in the literature. Our approach cannot estimate the demand for sizes directly. It can, however, individually measure for each branch the scarcest and the amplest sizes, aggregated over all products. This measurement can iteratively be used to adapt the size distributions in the pre-pack orders for the future. A real-world blind study shows the potential of this distribution free heuristic optimization approach: The gross yield measured in percent of gross value was almost one percentage point higher in the test-group branches than in the control-group branches.

The Stochastic Guaranteed Service Model with Recourse for Multi-Echelon Warehouse Management (2012)

Jörg Rambau Konrad Schade

The Guaranteed Service Model (GSM) computes optimal order-points in multi-echelon inventory control under the assumptions that delivery times can be guaranteed and the demand is bounded. Our new Stochastic Guaranteed Service Model (SGSM) with Recourse covers also scenarios that violate these assumptions. Simulation experiments on real-world data of a large German car manufacturer show that policies based on the SGSM dominate GSM-policies.

The Integrated Size and Price Optimization problem (2012)

Miriam Kießling Sascha Kurz Jörg Rambau

We present the Integrated Size and Price Optimization Problem (ISPO) for a fashion discounter with many branches. Based on a two-stage stochastic programming model with recourse, we develop an exact algorithm and a production-compliant heuristic that produces small optimality gaps. In a field study we show that a distribution of supply over branches and sizes based on ISPO solutions is significantly better than a one-stage optimization of the distribution ignoring the possibility of optimal pricing.

Stability with uniform bounds for online dial-a-ride problems under reasonable load (2011)

Sven O. Krumke Jörg Rambau

In continuously running logistic systems (like in-house pallet transportation systems), finite buffer capacities usually require controls achieving uniformly bounded waiting queues (strong stability). Standard stochastic traffic assumptions (arrival rates below service rates) can, in general, not guarantee these strong stability requirements, no matter which control. Therefore, the worst-case traffic notion of reasonable load was introduced, originally for the analysis of the Online-Dial-a-Ride Problem. A set of requests is reasonable if the requests that are presented in a sufficiently large time period can be served in a time period of at most the same length. The rationale behind this concept is that the occurrence of non-reasonable request sets renders the system overloaded, and capacity should be extended. For reasonable load, there are control policies that can guarantee uniformly bounded flow times, leading to strong stability in many cases. Control policies based on naive eoptimization, however, can in general achieve neither bounded flow times nor strong ability. In this chapter, we review the concept and examples for reasonable load. Moreover, we present new control policies achieving strong stability as well as new elementary examples of request sets where naive reoptimization fails.

On the minimum diameter of plane integral point sets (2007)

Sascha Kurz Alfred Wassermann

Since ancient times mathematicians consider geometrical objects with integral side lengths. We consider plane integral point sets P, which are sets of n points in the plane with pairwise integral distances where not all the points are collinear. The largest occurring distance is called its diameter. Naturally the question about the minimum possible diameter d(2,n) of a plane integral point set consisting of n points arises. We give some new exact values and describe state-of-the-art algorithms to obtain them. It turns out that plane integral point sets with minimum diameter consist very likely of subsets with many collinear points. For this special kind of point sets we prove a lower bound for d(2,n) achieving the known upper bound n^{c_2loglog n} up to a constant in the exponent.

On the characteristic of integral point sets in $\mathbb{E}^m$ (2005)

Sascha Kurz

We generalise the definition of the characteristic of an integral triangle to integral simplices and prove that each simplex in an integral point set has the same characteristic. This theorem is used for an efficient construction algorithm for integral point sets. Using this algorithm we are able to provide new exact values for the minimum diameter of integral point sets.

Maximal integral point sets over Z^2 (2008)

Sascha Kurz Andrey Radoslavov Antonov

Geometrical objects with integral side lengths have fascinated mathematicians through the ages. We call a set P={p(1),...,p(n)} in Z^2 a maximal integral point set over Z^2 if all pairwise distances are integral and every additional point p(n+1) destroys this property. Here we consider such sets for a given cardinality and with minimum possible diameter. We determine some exact values via exhaustive search and give several constructions for arbitrary cardinalities. Since we cannot guarantee the maximality in these cases we describe an algorithm to prove or disprove the maximality of a given integral point set. We additionally consider restrictions as no three points on a line and no four points on a circle.

Lotsize optimization leading to a p-median problem with cardinalities (2007)

Constantin Gaul Sascha Kurz Jörg Rambau

We consider the problem of approximating the branch and size dependent demand of a fashion discounter with many branches by a distributing process being based on the branch delivery restricted to integral multiples of lots from a small set of available lot-types. We propose a formalized model which arises from a practical cooperation with an industry partner. Besides an integer linear programming formulation and a primal heuristic for this problem we also consider a more abstract version which we relate to several other classical optimization problems like the p-median problem, the facility location problem or the matching problem.

Preprint

Refine

Author

Year of publication

Document Type

Language

Keywords

Institute

26 search hits