Search results for: F. Härtl

Items from 1 to 20 out of 130 results

article

A machine learning approach for flow shop scheduling problems with alternative resources, sequence-dependent setup times, and blocking

Frank Benda, Roland Braune, Karl F. Doerner, Richard F. Hartl

OR Spectrum > 2019 > 41 > 4 > 871-893

In proposing a machine learning approach for a flow shop scheduling problem with alternative resources, sequence-dependent setup times, and blocking, this paper seeks to generate a tree-based priority rule in terms of a well-performing decision tree (DT) for dispatching jobs. Furthermore, generating a generic DT and RF that yields competitive results for instance scenarios that structurally differ...

article

Leveraging single‐objective heuristics to solve bi‐objective problems: Heuristic box splitting and its application to vehicle routing

Piotr Matl, Richard F. Hartl, Thibaut Vidal

Networks > 73 > 4 > 382 - 400

After decades of intensive research on the vehicle routing problem (VRP), many highly efficient single‐objective heuristics exist for a multitude of VRP variants. But when new side‐objectives emerge—such as service quality, workload balance, pollution reduction, consistency—the prevailing approach has been to develop new, problem‐specific, and increasingly complex multiobjective (MO) methods. Yet...

article

The cost of incentive compatibility in auction‐based mechanisms for carrier collaboration

Margaretha Gansterer, Richard F. Hartl, Rudolf Vetschera

Networks > 73 > 4 > 490 - 514

Collaboration has been one of the important trends in vehicle routing. A typical mechanism to enable carrier collaboration is to use combinatorial auctions, where requests are not traded individually but are combined into bundles. Previous literature on carrier collaboration has focused on issues such as bundle formation or winner determination, typically assuming truthfulness of all agents and absence...

article

The two-region multi-depot pickup and delivery problem

Adria Soriano, Margaretha Gansterer, Richard F. Hartl

OR Spectrum > 2018 > 40 > 4 > 1077-1108

Logistics networks are constantly evolving such that new and more varied structures arise and need to be studied. Carriers are aiming for opportunities to save costs by efficient planning. Motivated by this, we define the two-region multi-depot pickup and delivery problem. A region in this setting refers to an area where customers and depots are located. We differentiate two kinds of requests depending...

article

Emerging and innovative OR applications: a special issue in honor of Walter J. Gutjahr

Immanuel Bomze, Karl F. Dörner, Richard F. Hartl, Ulrike Leopold-Wildburger, more

Central European Journal of Operations Research > 2018 > 26 > 2 > 259-263

article

Centralized bundle generation in auction-based collaborative transportation

Margaretha Gansterer, Richard F. Hartl

OR Spectrum > 2018 > 40 > 3 > 613-635

In horizontal collaborations, carriers form coalitions in order to perform parts of their logistics operations jointly. By exchanging transportation requests among each other, they can operate more efficiently and in a more sustainable way. This exchange of requests can be organized through combinatorial auctions, where collaborators submit requests for exchange to a common pool. The requests in the...

article

Comments on: Disruption management in vehicle routing and scheduling for road freight transport: a review

Karl F. Doerner, Richard F. Hartl

TOP > 2018 > 26 > 1 > 21-24

This comment refers to the invited paper available at https://doi.org/10.1007/s11750-018-0469-4.

article

Physikalische Therapie bei chronischen Beschwerden im Lenden-Becken-Hüft-Bereich

F. Hartl

Manuelle Medizin > 2018 > 56 > 1 > 30-35

Hintergrund Muskuloskeletale Beschwerden werden meist durch selbstverstärkende Kreisläufe auf körperlicher, psychischer und sozialer Ebene verursacht, die durch Rückkopplung zur Eskalation führen. Behandlungsziel Ziel ist es, das gestörte Regelsystem an den optimalen Mittelwert heranzuführen, die selbstverstärkende Rückkopplung Symptom–Einstellungsstörung–Symptom zu dämpfen, durch therapeutische...

article

Exact solutions for the collaborative pickup and delivery problem

Margaretha Gansterer, Richard F. Hartl, Philipp E. H. Salzmann

Central European Journal of Operations Research > 2018 > 26 > 2 > 357-371

In this study we investigate the decision problem of a central authority in pickup and delivery carrier collaborations. Customer requests are to be redistributed among participants, such that the total cost is minimized. We formulate the problem as multi-depot traveling salesman problem with pickups and deliveries. We apply three well-established exact solution approaches and compare their performance...

article

Preface: Special issue on the VeRoLog 2015 conference

Karl F. Doerner, Richard Eglese, Richard F. Hartl, Jakob Puchinger

Networks > 69 > 3 > 239 - 240

article

A VNS approach to multi-location inventory redistribution with vehicle routing

Belma Turan, Stefan Minner, Richard F. Hartl

Computers & Operations Research > 2017 > 78 > C > 526-536

This paper analyzes a two-echelon inventory problem with uncertain demand, where perishable products are distributed from a central warehouse to retail stores. To better deal with uncertainty, we propose a model in which, at a certain point in time during the operation time window, transshipments between retail stores are allowed in order to re-balance the inventories. The model captures the following...

article

Interaction of pricing, advertising and experience quality: A dynamic analysis

Jonathan P. Caulkins, Gustav Feichtinger, Dieter Grass, Richard F. Hartl, more

European Journal of Operational Research > 2017 > 256 > 3 > 877-885

For certain goods or services, the quality of the product can be assessed by customers only after consumption. We determine the optimal time paths for pricing, advertising and quality for a profit-maximizing firm facing demand that is influenced both by this experience quality as well as by advertising. In particular, there may exist two optimal trajectories separated by an indifference threshold...

article

On the generalization of constraint programming and boolean satisfiability solving techniques to schedule a resource-constrained project consisting of multi-mode jobs

Alexander Schnell, Richard F. Hartl

Operations Research Perspectives > 2017 > 4 > C > 1-11

In our paper, we analyze new exact approaches for the multi-mode resource-constrained project scheduling (MRCPSP) problem with the aim of makespan minimization. For the single-mode RCPSP (SRCPSP) recent exact algorithms combine a Branch and Bound algorithm with principles from Constraint Programming (CP) and Boolean Satisfiability Solving (SAT). We extend the above principles for the solution of MRCPSP...

chapter

Solving a Bi-objective Flowshop Scheduling Problem by Pareto-Ant Colony Optimization

Joseph M. Pasia, Richard F. Hartl, Karl F. Doerner

Lecture Notes in Computer Science > Ant Colony Optimization and Swarm Intelligence > A Comparison of Particle Swarm Optimization Algorithms Based on Run-Length Distributions > 294-305

In this paper we investigate the performance of pareto ant colony optimization (PACO) in solving a bi-objective permutation flowshop problem. We hybridize this technique by incorporating path relinking (PR) in four different ways. Several test instances are used to test the effectiveness of the different approaches. Computational results show that hybridizing PACO with PR improves the performance...

chapter

A Variable Neighborhood Search Integrated in the POPMUSIC Framework for Solving Large Scale Vehicle Routing Problems

Alexander Ostertag, Karl F. Doerner, Richard F. Hartl

Lecture Notes in Computer Science > Hybrid Metaheuristics > 29-42

This paper presents a heuristic approach based on the POPMUSIC framework for solving large scale Multi Depot Vehicle Routing Problems with Time Windows derived from real world data. A Variable Neighborhood Search is used as the optimizer in the POPMUSIC framework. POPMUSIC is a new decomposition approach for large scale problems. We compare our method with a pure VNS approach and a Memetic Algorithm...

article

The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations

Gerhard Hiermann, Jakob Puchinger, Stefan Ropke, Richard F. Hartl

European Journal of Operational Research > 2016 > 252 > 3 > 995-1018

Due to new regulations and further technological progress in the field of electric vehicles, the research community faces the new challenge of incorporating the electric energy based restrictions into vehicle routing problems. One of these restrictions is the limited battery capacity which makes detours to recharging stations necessary, thus requiring efficient tour planning mechanisms in order to...

article

The multi-vehicle profitable pickup and delivery problem

Margaretha Gansterer, Murat Küçüktepe, Richard F. Hartl

OR Spectrum > 2017 > 39 > 1 > 303-319

The transportation industry expanded rapidly in a highly competitive environment. Logistics companies with insufficient volume of transport capacities are forced to make a selection of customers that they can integrate efficiently into their tours. This is of particular relevance in the pickup and delivery market, where shipments from several different customers can be moved on the same vehicle. In...

chapter

Stochastic Local Search Procedures for the Probabilistic Two-Day Vehicle Routing Problem

Karl F. Doerner, Walter J. Gutjahr, Richard F. Hartl, Guglielmo Lulli

Studies in Computational Intelligence > Advances in Computational Intelligence in Transport, Logistics, and Supply Chain Management > Vehicle Routing > 153-168

Summary This chapter is motivated by the study of a real-world application on blood delivery. The Austrian Red Cross (ARC), a non-profit organization, is in charge of delivering blood to hospitals on their request. To reduce their operating costs through higher flexibility, the ARC is interested in changing the policy of delivering blood products. Therefore it wants to provide two different types...

chapter

Heuristics for a Real-World Mail Delivery Problem

Elisabeth Gussmagg-Pfliegl, Fabien Tricoire, Karl F. Doerner, Richard F. Hartl, more

Lecture Notes in Computer Science > Applications of Evolutionary Computation > EvoTRANSLOG Contributions > 481-490

We are solving a mail delivery problem by combining exact and heuristic methods. The problem is a tactical routing problem as routes for all postpersons have to be planned in advance for a period of several months. As for many other routing problems, the task is to construct a set of feasible routes serving each customer exactly once at minimum cost. Four different modes (car, moped, bicycle, and...

chapter

SavingsAnts for the Vehicle Routing Problem

Karl Doerner, Manfred Gronalt, Richard F. Hartl, Marc Reimann, more

Lecture Notes in Computer Science > Applications of Evolutionary Computing > EvoCOP Talks > 11-20

In this paper we propose a hybrid approach for solving vehicle routing problems. The main idea is to combine an Ant System (AS) with a problem specific constructive heuristic, namely the well known Savings algorithm. This difiers from previous approaches, where the subordinate heuristic was the Nearest Neighbor algorithm initially proposed for the TSP. We compare our approach with some other classic,...

Publication date

Set your own date range

Content availability

Available (128)
None (2)

Publication type

article (105)
book (25)

INFONA - science communication portal

Search results for: F. Härtl

A machine learning approach for flow shop scheduling problems with alternative resources, sequence-dependent setup times, and blocking

Leveraging single‐objective heuristics to solve bi‐objective problems: Heuristic box splitting and its application to vehicle routing

The cost of incentive compatibility in auction‐based mechanisms for carrier collaboration

The two-region multi-depot pickup and delivery problem

Emerging and innovative OR applications: a special issue in honor of Walter J. Gutjahr

Centralized bundle generation in auction-based collaborative transportation

Comments on: Disruption management in vehicle routing and scheduling for road freight transport: a review

Physikalische Therapie bei chronischen Beschwerden im Lenden-Becken-Hüft-Bereich

Exact solutions for the collaborative pickup and delivery problem

Preface: Special issue on the VeRoLog 2015 conference

A VNS approach to multi-location inventory redistribution with vehicle routing

Interaction of pricing, advertising and experience quality: A dynamic analysis

On the generalization of constraint programming and boolean satisfiability solving techniques to schedule a resource-constrained project consisting of multi-mode jobs

Solving a Bi-objective Flowshop Scheduling Problem by Pareto-Ant Colony Optimization

A Variable Neighborhood Search Integrated in the POPMUSIC Framework for Solving Large Scale Vehicle Routing Problems

The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations

The multi-vehicle profitable pickup and delivery problem

Stochastic Local Search Procedures for the Probabilistic Two-Day Vehicle Routing Problem

Heuristics for a Real-World Mail Delivery Problem

SavingsAnts for the Vehicle Routing Problem

Filter options

Publication date

Content availability

Publication type

Publication language

Keywords

Data set

Journal

INFONA - science communication portal

Search results for: F. Härtl

Add recipient

Sending message cancelled

Are you sure you want to cancel sending this message?

Send message

Filter options

Publication date

Date range setting

Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.

Content availability

Publication type

Publication language

Keywords

Data set

Journal

Reporting an error / abuse

Sending the report failed

Accessibility options