Dr.-Ing. Anne Meyer
Anne Meyer schloss im Jahr 2007 das Studium der technischen VWL an der Universität Karlsruhe ab und arbeitete im Anschluss für ein Jahr im Bereich Sportadministration in der Schweiz. Im September 2008 kehrte sie sowohl nach Karlsruhe als auch zu Ihren Studienschwerpunkten Logistik und Verkehrswesen zurück und unterstützt seitdem das Team Logistics Systems Engineering am FZI.
Derzeit beschäftigt sie sich überwiegend mit Tourenplanungsproblemen und Transporten in logistischen Netzwerken.
Zu ihren Forschungsinteressen gehören:
- Vehicle Routing Problems
- Network Service Problems
- Constraint Programming
- Lean manufacturing principles / Lean Logistics
Zeitungs- oder Zeitschriftenartikel (3)
- The multi-period service territory design problem - An introduction, a model and a heuristic approachInfoDetails
Matthias Bender, Anne Meyer, Jörg Kalcsics, Stefan Nickel, 2016
In service territory design applications, a field service workforce is responsible for providing recurring services at their customers’ sites. We introduce the associated planning problem, which consists of two subproblems: In the partitioning subproblem, customers must be grouped into service territories. In the scheduling subproblem, customer visits must be scheduled throughout the multi-period planning horizon. The emphasis of this paper is put on the scheduling subproblem. We propose a mixed integer programming model for this subproblem and present a location-allocation heuristic. The results of extensive experiments on real-world instances show that the proposed heuristic produces high-quality solutions.
- Patient-based nurse rostering in home careInfoDetails
Jacqueline Wirnitzer, Iris Heckmanna, Anne Meyer , Stefan Nickel, 2015
The monthly nurse rostering is one of the most time consuming planning tasks of our project partner, a leading German home care provider. The planning is currently done manually by experienced senior nurses. However, the planning setup is very complex due to requirements such as legal working time restrictions, availabilities of full and part time nurses, and patient requests with differing requirements on qualification and frequency. The objective is to assign as few different nurses as possible to each patient. Although this continuity is important for quality of care, it is hardly addressed in literature. In this paper, we elaborate a mid-term home care rostering problem (HCR) that fits the requirements of our partner. It implies the assignment of nurses to weekly recurring patient-visit-tours under consideration of the aforementioned continuity of care. We propose different measures of continuity, which are used in five novel MIP formulations, each incorporating all hard planning constraints. We evaluate the models by means of 45 generated instances with realistic features. Further experiments on a real-world instance show that the approach improves continuity of care considerably compared to the manual solution.
- A Two Stage Approach for Balancing a Periodic Long-Haul Transportation NetworkInfoDetails
Anne Meyer, Andreas Cardeneo und Kai Furmans, Springer, 2011
This paper presents a concept and planning methods to adapt lean production principles – especially regularity and balancing – to a long-haul transportation network. The two stage approach is discussed and solution methods for both stages are outlined. Summarised results of a simulation study on real network data are given to show the logistical impact of the concept.
- Modelling milk runs in lean manufac turing — PVRP with additional constraintsDetails
Anne Meyer, 2013
- A constraint programming based approach for planning milk runsDetails
Anne Meyer, 2012
- A constraint programming based approach for planning milk runsInfoDetails
Meyer, Anne, 2012
Milk runs -- a logistics concept of lean manufacturing -- can be modelled as a Period Vehicle Routing Problem (PVRP) with additional requirements on regularity and robustness. We propose a CP formulation for PVRPs based on an existing VRP model, which can be easily extended. Furthermore, we suggest a CP based Parallel Insertion Heuristic to construct feasible starting solutions and a Large Neighborhood Search as a local search improvement technique. For the latter we present different adaptions to the PVRP case, amongst them a new relatedness measure improved with regard to (client speci c) side constraints.
- Milk Run Design: Definitions, Concepts and Solution ApproachesInfoDetails
Anne Meyer, 2015
Efficient inbound networks in the European automotive industry rely on a set of different transport concepts including milk runs - understood as regularly scheduled pickup tours. The complexity of designing such a mixed network makes decision support necessary: In this thesis we provide definitions, mathematical models and a solution method for the Milk Run Design problem and introduce indicators assessing the performance of established milk runs in relation to alternative transport concepts.
Export Suchergebnis .bib
Telefon: +49 721 9654-318
Fax: +49 721 9654-319