1. Trang chủ
  2. » Kinh Doanh - Tiếp Thị

Dynamic perspectives on managerial decision making

518 123 0

Đang tải... (xem toàn văn)

Tài liệu hạn chế xem trước, để xem đầy đủ mời bạn chọn Tải xuống

THÔNG TIN TÀI LIỆU

Cấu trúc

  • Contents

  • Introduction

    • 1 Economic Dynamics

    • 2 Firm Management

    • 3 Appendix

    • References

  • Part I Economic Dynamics

    • Dynamic Drug Policy: Optimally Varying the Mix of Treatment, Price-Raising Enforcement, and Primary Prevention Over Time

      • 1 Introduction

      • 2 The Model

        • 2.1 Clarifying Some Common Misconceptions

        • 2.2 Model Structure

        • 2.3 Mathematical Formulation

        • 2.4 Parameters

      • 3 Base Case Analysis

      • 4 Sensitivity Analysis

        • 4.1 Sensitivity Analysis Concerning the Strength of Prevention

        • 4.2 Sensitivity Analysis with Respect to Treatment Effectiveness

        • 4.3 Sensitivity Analysis with Respect to Initiation Exponent α

        • 4.4 Sensitivity Analysis Concerning the Social Cost per Gram Consumed

        • 4.5 Sensitivity Analysis Concerning the Lower Limit on the Number of Users

      • 5 Discussion

      • Appendix: Optimality Conditions

      • References

    • Economics of Talent: Dynamics and Multiplicity of Equilibria

      • 1 Introduction

        • 1.1 Importance of the Topic

        • 1.2 Goals

        • 1.3 Literature Survey

      • 2 A Model of Talent and Market Access

        • 2.1 Economics of Art

        • 2.2 Economics of a Writer

        • 2.3 Model Formulation

        • 2.4 Optimality Conditions

      • 3 Numerical Examples and Equilibria Types

        • 3.1 The Case of Unique Equilibrium

        • 3.2 Skiba Threshold

        • 3.3 Bifurcation Analysis

        • 3.4 Policy Implications

      • 4 Additional Complexity of Art

        • 4.1 Market Interactions

        • 4.2 Market Access

        • 4.3 Economics of Theater

        • 4.4 Applications and Extensions

      • 5 Conclusions and Policy Implications

      • Appendix

        • Vector Field Structure and Jacobian

        • Network Effect on Market: Social Influence Versus Normal Preferences

      • References

    • Skiba Phenomena in Markov Perfect Equilibria of Asymmetric Differential Games

      • 1 Introduction

      • 2 The Model

      • 3 Equilibrium Analysis

      • 4 General Discussion and Conclusions

      • References

    • A Dynamic Advertising Game with Market Growth

      • 1 Introduction

      • 2 Literature Review

      • 3 A Differential Advertising Game

      • 4 Nash Equilibrium Advertising Strategies

      • 5 Conclusions

      • Appendix

      • References

    • Managerial Delegation in a Dynamic Renewable Resource Oligopoly

      • 1 Introduction

      • 2 The Model

      • 3 The Linear Feedback Solution

      • 4 Nonlinear Feedback Equilibria

      • 5 Concluding Remarks

      • References

    • Optimal Growth with Polluting Waste and Recycling

      • 1 Introduction

      • 2 Model

      • 3 Analysis

      • 4 Numerical Example

      • 5 Conclusion

      • References

    • Handling the Complexity of Predator-Prey Systems: Managerial Decision Making in Urban Economic Development and Sustainable Harvesting

      • 1 Introduction

      • 2 Predator-Prey Models and Their Applications

      • 3 A Predator-Prey System Approach for Urban Environmental Problems

        • 3.1 UED Case Study for Graz, Austria: Empirical Data and Selection of Suitable Indicators

        • 3.2 The Predator-Prey Model for Urban Economic Development

      • 4 Experimental Case Study on Optimal Harvesting

        • 4.1 The Setup of the Experiments

        • 4.2 Results and Discussion

      • 5 Discussion and Conclusions

      • Appendix

      • References

    • On Optimal Harvesting in Age-Structured Populations

      • 1 Introduction

      • 2 Model Formulation and Preliminaries

      • 3 An Analytic Approach

      • 4 Periodic Optimal Fishing: Numerical Results

      • 5 The Case of Non-selective Fishing

      • 6 Final Discussion

      • References

    • Maximizing Female Labor Force Participation in a StationaryPopulation

      • 1 Introduction

      • 2 The Model

      • 3 Analytical Solution

      • 4 Numerical Solution for τ=0.19

      • 5 Sensitivity Analysis

      • 6 Conclusion

      • References

    • Multiplicity of Balanced Growth Paths in an Endogenous Growth Model with Elastic Labor Supply

      • 1 Introduction

      • 2 Model Formulation

      • 3 Results

      • References

    • Fiscal and Monetary Policies in a Monetary Union: Conflict or Cooperation?

      • 1 Introduction

      • 2 Nonlinear Dynamic Tracking Games

      • 3 The MUMOD1 Model

      • 4 Simulation Results

        • 4.1 Effects of a Negative Symmetric Demand-Side Shock

        • 4.2 Effects of a Negative Demand-Side Shock in the Core

        • 4.3 Effects of a Negative Demand-Side Shock in the Periphery

      • 5 Concluding Remarks

      • References

    • On the Optimal Trade-Off Between Fire Power and Intelligence in a Lanchester Model

      • 1 Introduction

      • 2 The Model

      • 3 Simplified Model

        • 3.1 Analysis

        • 3.2 Numerical Example

      • 4 Conclusions and Extensions

      • References

    • Drivers of the Change in Social Welfare in European Countries

      • 1 Introduction

      • 2 Assessing the Social Welfare and Drivers of Social Welfare Change Over Time

        • 2.1 Social Welfare with Unrestricted Weights

        • 2.2 Social Welfare with Restricted Weights

        • 2.3 Drivers of Social Welfare Change

      • 3 Conclusions

      • Annex

      • References

  • Part II Firm Management

    • Organizational Nimbleness and Operational Policies: The Case of Optimal Control of Maintenance Under Uncertainty

      • 1 Introduction

      • 2 Background

      • 3 The Model

      • Notation:

        • 3.1 The KS Formulation (A Single Machine Problem)

        • 3.2 Extended KS Model (Chain of Machines Over Time)

          • 3.2.1 Interrelated Replacement-Maintenance Optimization

          • 3.2.2 Solving for Optimal Tj

          • 3.2.3 Solving the Rest of the Problem

        • 3.3 Features of the Extended KS Model

      • 4 Properties of the Extended KS Model

        • 4.1 Relative Magnitudes of f(j)

        • 4.2 Sign of the Shadow Price and Its Derivative: λ(t)≤0 and (t)≥0

          • 4.2.1 λ(t)≤0

          • 4.2.2 (t)≥0

        • 4.3 Profile of u(t) Over Time

          • 4.3.1 Variation of u(t) for τ=≤t<τ+1

          • 4.3.2 Jumps in the Intensity of Maintenance: Deviation from the Policy of Non-Increasing u(t)

      • 5 The Case of the Nimblest Organization

        • 5.1 Finite Horizon Problems

        • 5.2 Infinite Horizon Problems with Instantaneous Replacements

      • 6 A Numerical Illustration

      • 7 Summary and Conclusion

      • Appendix 1: Optimal Policies with a Positive Integrand in the Objective Function

      • Appendix 2: Yj,t1,K,0≥Yj,t2,K,0ift1≤t2

      • References

    • Safety Stocks in Centralized and Decentralized Supply Chains Under Different Types of Random Yields

      • 1 Safety Stocks in Supply Chains

      • 2 Supply Chains with Random Yields

        • 2.1 Types of Yield Randomness

        • 2.2 Optimization in Centralized and Decentralized Supply Chains

          • 2.2.1 Centralized Supply Chain

          • 2.2.2 Decentralized Supply Chain

          • 2.2.3 Yield Types and Safety Stock Properties

      • 3 Safety Stocks under SP Yield

        • 3.1 Centralized Supply Chain

        • 3.2 Decentralized Supply Chain

      • 4 Safety Stocks under BI Yield

        • 4.1 Centralized Supply Chain

        • 4.2 Decentralized Supply Chain

      • 5 Safety Stocks under IG Yield

        • 5.1 Centralized Supply Chain

        • 5.2 Decentralized Supply Chain

      • 6 Insights and Future Research

      • References

    • Dynamic Pricing Under Economic Ordering and Strategic Customers with Forward Buying and Postponement

      • 1 Introduction and Motivation

      • 2 Model Assumptions

      • 3 Optimal Discount and Order Quantity

      • 4 Numerical Illustrations

      • 5 Conclusions

      • References

    • The Effect of Remanufacturability of End-of-Use Returns on the Optimal Intertemporal Production Decisions of a Newsvendor

      • 1 Introduction and Related Work

      • 2 The Model

        • 2.1 Timeline of the Model

        • 2.2 Model Formulation

        • 2.3 Optimal Supply Strategy for Product Generation 2

        • 2.4 Optimal Supply Strategy for Product Generation 1

        • 2.5 Comparison of this Optimal Strategy with the Heuristics from ReimannLechner2012

      • 3 Numerical Analysis

      • 4 Conclusion

      • Appendix

      • References

    • Comparing Modeling Approaches for the Multi-Level Capacitated Lot-Sizing and Scheduling Problem

      • 1 Introduction

      • 2 Literature Review

      • 3 Model Formulations

        • 3.1 Overview

        • 3.2 Basic Notation

        • 3.3 Small-Bucket Models

        • 3.4 Big-Bucket Models (MLCLSP)

        • 3.5 Mixed Models (GLSPMS)

        • 3.6 Comparison of Model Characteristics

      • 4 Computational Results

        • 4.1 Test Instances

        • 4.2 Results

      • 5 Conclusions

      • References

    • Hybrid Metaheuristics for Project Scheduling and Staffing, Considering Project Interruptions and Labor Contracts

      • 1 Introduction

      • 2 Literature Review

      • 3 Problem Formulations

        • 3.1 Model Formulation MIP-II

        • 3.2 MIP-II Model

          • 3.2.1 Project Scheduling Example, MIP-II Formulation

        • 3.3 Model Extension MIP-P

          • 3.3.1 Project Scheduling Example, MIP-P Formulation

        • 3.4 Model Extension MIP-SP

      • 4 Heuristic Solution Methods

        • 4.1 MIP-P Solution Method

        • 4.2 MIP-SP Solution Method

      • 5 Computational Experiments

      • 6 Results

        • 6.1 Comparison of Model Extensions: Solution Value, and Solution Gap

        • 6.2 Comparison of Model Extensions: Solution Time, Solution Gap, and Solvability

        • 6.3 Heuristic Solution of MIP-P

        • 6.4 Heuristic Solution of MIP-SP

      • 7 Conclusion and Outlook

      • References

    • From Incomplete Information to Strict Rankings: Methods to Exploit Probabilistic Preference Information

      • 1 Introduction

      • 2 Decision Making Under Incomplete Information

      • 3 Model Formulation

        • 3.1 Models Based on Rank Acceptability Indices

        • 3.2 Models Based on Pairwise Winning Indices

      • 4 Computational Study

        • 4.1 Overview

        • 4.2 Benchmark Models

        • 4.3 Measurement and Parameter Settings

      • 5 Results

      • 6 Discussion, Conclusions and Future Research

      • References

    • The After-Effects of Fear-Inducing Public Service Announcements

      • 1 Introduction

      • 2 Effects of Public Service Announcements on Evaluations of Other Advertisements

        • 2.1 Advertisers' Influence Over Commercial Scheduling

        • 2.2 Hypotheses Development

      • 3 Method

      • 4 Results

        • 4.1 Pre-Study

        • 4.2 Study 1

        • 4.3 Study 2

      • 5 Discussion

      • References

    • Decision Support for Strategic Disaster Management: First Release of a Wiki

      • 1 Introduction

      • 2 Taxonomy for the Strategic Context of Disaster Management

        • 2.1 Emergency Management Environment

        • 2.2 Disaster Definition

          • 2.2.1 Disaster Types

          • 2.2.2 Extent of Event

          • 2.2.3 Vulnerability

          • 2.2.4 Disaster Risk

        • 2.3 Decision Making

          • 2.3.1 Stakeholders

          • 2.3.2 Decision Making Levels

          • 2.3.3 Command and Control Systems

          • 2.3.4 Decision Support Systems

        • 2.4 Emergency Management Cycle

        • 2.5 Related Interventions and Resources

      • 3 Glossary Terms for the Strategic Context of Disaster Management

      • 4 Conclusion and Further Research

      • References

    • Overview of Optimization Problems in Electric Car-Sharing System Design and Management

      • 1 Introduction

      • 2 Strategic and Tactical Problems

        • 2.1 Location of Stations

          • 2.1.1 Location of Charging Stations for Ecar-Sharing Systems

          • 2.1.2 Location of Charging Stations for Privately Owned Cars

          • 2.1.3 Location of Stations for Electric Taxi Cabs

          • 2.1.4 Location of Stations for Non-Electric Car-Sharing Systems

          • 2.1.5 Summary, Open Problems and Possible Research Directions

        • 2.2 Allocation of Vehicles to Existing Stations

          • 2.2.1 Summary, Open Problems and Possible Research Directions

      • 3 Operational Problems

        • 3.1 Relocation of Vehicles for Multiple-Stations Car-Sharing

          • 3.1.1 User-Based Strategies

          • 3.1.2 Operator-Based Strategies

          • 3.1.3 Summary, Open Problems and Possible Research Directions

        • 3.2 Battery Swap

          • 3.2.1 Summary, Open Problems and Possible Research Directions

        • 3.3 Electric Vehicle Shortest Path Problems

          • 3.3.1 Summary, Open Problems and Possible Research Directions

        • 3.4 Electric Vehicle Routing Problem

          • 3.4.1 Summary, Open Problems and Possible Research Directions

      • 4 Conclusions

      • References

    • The Golf Tourist Problem

      • 1 Introduction

      • 2 Literature Review

      • 3 Problem Formulation

      • 4 Solution Methods

        • 4.1 Bi-objective Branch-and-Bound

        • 4.2 ε-Constraint Framework

        • 4.3 Aggregate Solving

      • 5 Computational Study

        • 5.1 Data

        • 5.2 Instances

        • 5.3 A Note on the ε-Constraint

        • 5.4 Results

      • 6 Conclusion and Future Work

      • References

    • Twenty Years of Vehicle Routing in Vienna

      • 1 Introduction

      • 2 Basic Variants

        • 2.1 CVRP

          • 2.1.1 Model

          • 2.1.2 Contribution of Richard F. Hartl and His Team

        • 2.2 VRP with Loading Constraints

        • 2.3 Multi-Objective VRP

      • 3 Generalizations

        • 3.1 Time Windows

          • 3.1.1 Model Extensions

          • 3.1.2 Contribution of Richard F. Hartl and His Team

        • 3.2 Pickup and Delivery

          • 3.2.1 Model Extensions

          • 3.2.2 Contribution of Richard F. Hartl and His Team

        • 3.3 Periodic VRP

          • 3.3.1 Model Extensions

          • 3.3.2 Contribution of Richard F. Hartl and His Team

      • 4 Further Routing Problems

        • 4.1 Arc Routing

        • 4.2 Orienteering

        • 4.3 Covering Tour

      • 5 Conclusion

      • List of Acronyms

      • References

  • Part III Appendix

    • Achilles and the Theory of Games

      • Hyginus Mythographus FABULA XCVI. ACHILLES

Nội dung

Dynamic Modeling and Econometrics in Economics and Finance 22 Herbert Dawid Karl F. Doerner Gustav Feichtinger Peter M. Kort Andrea Seidl Editors Dynamic Perspectives on Managerial Decision Making Essays in Honor of Richard F Hartl Dynamic Modeling and Econometrics in Economics and Finance Volume 22 Editors Stefan Mittnik Ludwig Maximillian University Munich Munich, Germany Willi Semmler Bielefeld University Bielefeld, Germany and New School for Social Research New York, USA More information about this series at http://www.springer.com/series/5859 Herbert Dawid • Karl F Doerner • Gustav Feichtinger • Peter M Kort • Andrea Seidl Editors Dynamic Perspectives on Managerial Decision Making Essays in Honor of Richard F Hartl 123 Editors Herbert Dawid Department of Business Administration and Economics and Center for Mathematical Economics Bielefeld University Bielefeld, Germany Karl F Doerner Department of Business Administration University of Vienna Vienna, Austria Gustav Feichtinger Institute of Statistics and Mathematical Methods in Economics Vienna University of Technology Vienna, Austria Peter M Kort Department of Econometrics and Operations Research & CentER Tilburg University Tilburg, The Netherlands Andrea Seidl Department of Business Administration University of Vienna Vienna, Austria ISSN 1566-0419 ISSN 2363-8370 (electronic) Dynamic Modeling and Econometrics in Economics and Finance ISBN 978-3-319-39118-2 ISBN 978-3-319-39120-5 (eBook) DOI 10.1007/978-3-319-39120-5 Library of Congress Control Number: 2016945568 © Springer International Publishing Switzerland 2016 This work is subject to copyright All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed The use of general descriptive names, registered names, trademarks, service marks, etc in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made Printed on acid-free paper This Springer imprint is published by Springer Nature The registered company is Springer International Publishing AG Switzerland Contents Introduction Herbert Dawid, Karl F Doerner, Gustav Feichtinger, Peter M Kort, and Andrea Seidl Part I Economic Dynamics Dynamic Drug Policy: Optimally Varying the Mix of Treatment, Price-Raising Enforcement, and Primary Prevention Over Time Jonathan P Caulkins and Gernot Tragler Economics of Talent: Dynamics and Multiplicity of Equilibria Yuri Yegorov, Franz Wirl, Dieter Grass, and Andrea Seidl Skiba Phenomena in Markov Perfect Equilibria of Asymmetric Differential Games Herbert Dawid, Michel Y Keoula, and Peter M Kort 11 37 63 A Dynamic Advertising Game with Market Growth Steffen Jørgensen and Simon Pierre Sigué 77 Managerial Delegation in a Dynamic Renewable Resource Oligopoly Luca Lambertini 93 Optimal Growth with Polluting Waste and Recycling 109 Raouf Boucekkine and Fouad El Ouardighi Handling the Complexity of Predator-Prey Systems: Managerial Decision Making in Urban Economic Development and Sustainable Harvesting 127 Birgit Bednar-Friedl, Doris A Behrens, Dieter Grass, Olivia Koland, and Ulrike Leopold-Wildburger On Optimal Harvesting in Age-Structured Populations 149 Anton O Belyakov and Vladimir M Veliov v vi Contents Maximizing Female Labor Force Participation in a Stationary Population 167 Elke Moser, Alexia Prskawetz, Gustav Feichtinger, and Bilal Barakat Multiplicity of Balanced Growth Paths in an Endogenous Growth Model with Elastic Labor Supply 189 Gerhard Sorger Fiscal and Monetary Policies in a Monetary Union: Conflict or Cooperation? 201 Dmitri Blueschke and Reinhard Neck On the Optimal Trade-Off Between Fire Power and Intelligence in a Lanchester Model 217 A.J Novák, G Feichtinger, and G Leitmann Drivers of the Change in Social Welfare in European Countries 233 Mikuláš Luptáˇcik, Eduard Nežinský, and Martin Lábaj Part II Firm Management Organizational Nimbleness and Operational Policies: The Case of Optimal Control of Maintenance Under Uncertainty 253 Ali Dogramaci and Suresh Sethi Safety Stocks in Centralized and Decentralized Supply Chains Under Different Types of Random Yields 279 Karl Inderfurth Dynamic Pricing Under Economic Ordering and Strategic Customers with Forward Buying and Postponement 301 Stefan Minner The Effect of Remanufacturability of End-of-Use Returns on the Optimal Intertemporal Production Decisions of a Newsvendor 313 Marc Reimann Comparing Modeling Approaches for the Multi-Level Capacitated Lot-Sizing and Scheduling Problem 333 Christian Almeder Hybrid Metaheuristics for Project Scheduling and Staffing, Considering Project Interruptions and Labor Contracts 349 Thomas Felberbauer, Karl F Doerner, and Walter J Gutjahr From Incomplete Information to Strict Rankings: Methods to Exploit Probabilistic Preference Information 379 Rudolf Vetschera Contents vii The After-Effects of Fear-Inducing Public Service Announcements 395 Udo Wagner, Claus Ebster, Lisa Eberhardsteiner, and Madeleine Prenner Decision Support for Strategic Disaster Management: First Release of a Wiki 413 Marion Rauner, Helmut Niessner, Lisa Sasse, Kristina Tomic, Karen Neville, Andrew Pope, and Sheila O’Riordan Overview of Optimization Problems in Electric Car-Sharing System Design and Management 441 Georg Brandstätter, Claudio Gambella, Markus Leitner, Enrico Malaguti, Filippo Masini, Jakob Puchinger, Mario Ruthmair, and Daniele Vigo The Golf Tourist Problem 473 Fabien Tricoire, Sophie N Parragh, and Margaretha Gansterer Twenty Years of Vehicle Routing in Vienna 491 Karl F Doerner, Alexander Kiefer, and David Wolfinger Part III Appendix Achilles and the Theory of Games 523 Alexander Mehlmann Introduction Herbert Dawid, Karl F Doerner, Gustav Feichtinger, Peter M Kort, and Andrea Seidl In the Introduction to their seminal 1986 book on Optimal Control Feichtinger and Hartl paraphrase Joseph Schumpeter’s famous quote that dealing with capitalist economies without taking into account dynamics is like Hamlet without the prince of Denmark A similar statement certainly applies also to the analysis of firm behavior Dynamic aspects are of crucial importance for almost any area of managerial decision making Firms are exposed to changing market environments and technological landscapes and can actively influence these developments among others through marketing activities or by investing in the development of product innovations or of new technologies On an operational level firms face challenging dynamic planning problems when designing their production processes, supply chains and distribution logistics All these different dynamic challenges gave rise to highly active areas of research, but there are very few scholars who have been H Dawid Department of Business Administration and Economics and Center for Mathematical Economics, Bielefeld University, Bielefeld, Germany e-mail: hdawid@wiwi.uni-bielefeld.de K.F Doerner • A Seidl Department of Business Administration, University of Vienna, Vienna, Austria e-mail: karl.doerner@univie.ac.at; andrea.seidl@univie.ac.at G Feichtinger Institute of Statistics and Mathematical Methods in Economics, Vienna University of Technology, Vienna, Austria e-mail: gustav.feichtinger@tuwien.ac.at P.M Kort Department of Econometrics and Operations Research & CentER, Tilburg University, Tilburg, The Netherlands Department of Economics, University of Antwerp, Antwerp, Belgium e-mail: Kort@uvt.nl © Springer International Publishing Switzerland 2016 H Dawid et al (eds.), Dynamic Perspectives on Managerial Decision Making, Dynamic Modeling and Econometrics in Economics and Finance 22, DOI 10.1007/978-3-319-39120-5_1 H Dawid et al able to make contributions to research on managerial decision making in several of these operational and strategic domains Richard F Hartl is one of them His highly influential research covers domains ranging from daily operational challenges like Vehicle Routing and Scheduling (e.g Bullnheimer et al 1999a; Kovacs et al 2015) to dynamic advertising strategies (e.g Feichtinger et al 1994) and strategic decisions of firms like those concerning capital investments in different technologies (e.g Feichtinger et al 2006) However, not only the breadth of the areas of research to which Richard Hartl has contributed is impressive, but also the methodological diversity of his work Most notably, his work bridges two methodological camps which in Economics and Management typically are strongly separated: those working with dynamic optimization methods, like optimal control theory, mainly relying on analytical findings and those employing meta-heuristics, mainly relying on computational analysis Richard Hartl has not only heavily used both approaches in his work, but has also made important methodological contributions With respect to optimal control theory he has for example provided an influential result on the monotonicity of optimal paths in problems with one-dimensional state-space (Hartl 1987) and has been among the pioneers systematically studying optimal solutions in higherdimensional control problems with multiple stable steady states (e.g Haunschmied et al 2003) Furthermore, books and surveys co-authored by Richard Hartl (e.g Feichtinger and Hartl 1986; Hartl et al 1995) have contributed strongly to the diffusion of advanced optimal control techniques in Economics and Management In the area of meta-heuristics he has contributed to the development of improved versions of algorithms, in particular ant systems (e.g Bullnheimer et al 1999b), variable neighbourhood search (e.g Polacek et al 2004) and adaptive large neighbourhood search (e.g Kovacs et al 2012) for rich vehicle routing problems Published research is only one channel through which Richard F Hartl had impact on the profession The second important channel is personal interaction as supervisor, co-author and colleague The size of the network of co-authors (to which also all five Editors of this book belong) and the impressive number of former students or assistants of Richard Hartl who have launched a successful academic career clearly illustrates that also in this respect he has been highly effective The aim of this volume is to pay tribute to these achievements of Richard F Hartl It collects contributions from co-authors, (present or former) colleagues and friends which are as versatile as the work of Richard Hartl both with respect to topics and methodology The common denominator of the papers is that (almost) all of them deal with dynamic problems in Economics and Management The volume is divided in the two parts, • Economic Dynamics • Firm Management which are distinguished according to the level of aggregation of the phenomenon under consideration, covering the aggregate level and the firm level 512 K.F Doerner et al List of Acronyms 2D 2E-VRP 2L-CVRP 3D 3L-CVRP ACO ACS ALNS ARC AS B&B B&C CARP ConVRP CTP CVRP CVRPRB D-Ants DARP DP DSDARP DVRP E-FSMVRPTW Two Dimensional Adaptive -Constraint Method Two-Echelon Vehicle Routing Problem Two-Dimensional Loading Capacitated Vehicle Routing Problem Three Dimensional Adaptive -Constraint Method Three-Dimensional Loading Capacitated Vehicle Routing Problem Ant Colony Optimization Ant Colony System Adaptive Large Neighborhood Search Austrian Red Cross Ant System Branch-and-Bound Branch and Cut Capacitated Arc Routing Problem Consistent Vehicle Routing Problem Covering Tour Problem Capacitated Vehicle Routing Problem Capacitated Vehicle Routing Problem with Route Balancing Decomposition Ants Dial-A-Ride Problem Dynamic Programming Dynamic and Stochastic Dial-A-Ride Problem Dynamic Vehicle Routing Problems Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations GenConVRP Generalized Consistent Vehicle Routing Problem GVNS General Variable Neighborhood Search HDARP Dial-A-Ride Problem with Heterogeneous Users and Vehicles HDARPD Heterogeneous Dial-A-Ride Problem with Driver-Related Constraints IRP Inventory Routing Problem LNS Large Neighborhood Search MA Memetic Algorithm MDLNS Multi-Directional Large Neighborhood Search MDVRP Multi-Depot Vehicle Routing Problem MDVRPTW Multi-Depot Vehicle Routing Problem with Time Windows MIP Mixed Integer Programming MO-DARP Multi-Objective Dial-A-Ride Problem MOGenConVRP Multi-Objective Generalized Consistent Vehicle Routing Problem MPA Multiple Plan Approach MP-VRP Multi-Pile Vehicle Routing Problem MSA Multiple Scenario Approach MuPOPTW Multi-Period Orienteering Problem with Multiple Time Windows MVPPDP Multi Vehicle Profitable Pickup and Delivery Problem NSGA-II Nondominated Sorting Genetic Algorithm II OP Orienteering Problem OVRP Open Vehicle Routing Problem OVRPTW Open Vehicle Routing Problem with Time Windows PDP Pickup and Delivery Problem PDTSP Pickup and Delivery Travelling Salesman Problem Pickup and Delivery Vehicle Routing Problem PDVRP PR Path Relinking PTP Profitable Tour Problem Twenty Years of Vehicle Routing in Vienna PTSP PVRP PVRP-IF SA SbAS SDVRP SRLTP S-VNS TALNS TDVRPTW TOP TS TSP VLNS VNS VRP VRPB VRPBTW VRPmiTW VRPPD VRPTW 513 Periodic Travelling Salesman Problem Periodic Vehicle Routing Problem Periodic Vehicle Routing Problem with Intermediate Facilities Simulated Annealing Savings-based Ant System Split Delivery Vehicle Routing Problem Single Route Lateral Transshipment Problem Stochastic Variable Neighborhood Search Template-Based Adaptive Large Neighborhood Search Time-Dependent Vehicle Routing Problem with Time Windows Team Orienteering Problem Tabu Search Travelling Salesman Problem Very Large Neighborhood Search Variable Neighborhood Search Vehicle Routing Problems Vehicle Routing Problem with Backhauls Vehicle Routing Problem with Backhauls and Time Windows Vehicle Routing Problem with Multiple Interdependent Time Windows Vehicle Routing Problems with Pickup and Deliveries Vehicle Routing Problem with Time Windows References Archetti, C., Doerner, K F., & Tricoire, F (2013) A heuristic algorithm for the free newspaper delivery problem European Journal of Operational Research, 230(2), 245–257 Balseiro, S R., Loiseau, I., & Ramonet, J (2011) An ant colony algorithm hybridized with insertion heuristics for the time dependent vehicle routing problem with time windows Computers and Operations Research, 38(6), 954–966 Bektas, T., Repoussis, P P., & Tarantilis, C D (2014) Dynamic vehicle routing problems Vehicle Routing: Problems, Methods, and Applications, 18, 299–347 Beltrami, E J., & Bodin, L D (1974) Networks and vehicle routing for municipal waste collection Networks, 4(1), 65–94 Bent, R W., & Van Hentenryck, P (2004) Scenario-based planning for partially dynamic vehicle routing with stochastic customers Operations Research, 52(6), 977–987 Bertazzi, L., Savelsbergh, M., & Speranza, M (2008) Inventory routing In B L Golden, S Raghavan, & E A Wasil (Eds.), The vehicle routing problem: Latest advances and new challenges Operations research/computer science interfaces series (Vol 43, pp 49–72) New York: Springer US Braekers, K., Hartl, R F., Parragh, S N., & Tricoire, F (2016) A bi-objective home care scheduling problem: Analyzing the trade-off between costs and client inconvenience European Journal of Operational Research, 248(2), 428–443 Bräysy, O., & Gendreau, M (2005a) Vehicle routing problem with time windows, Part I: Route construction and local search algorithms Transportation Science, 39(1), 104–118 Bräysy, O., & Gendreau, M (2005b) Vehicle routing problem with time windows, Part II: Metaheuristics Transportation Science, 39(1), 119–139 Breunig, U., Schmid, V., Hartl, R F., & Vidal, T (2015) A fast large neighbourhood based heuristic for the two-echelon vehicle routing problem Manuscript submitted for publication Bullnheimer, B., Hartl, R F., & Strauss, C (1999a) Applying the ant system to the vehicle routing problem In S Voß, S Martello, I Osman, & C Roucairol (Eds.), Meta-heuristics (pp 285– 296) New York: Springer US 514 K.F Doerner et al Bullnheimer, B., Hartl, R F., & Strauss, C (1999b) An improved ant system algorithm for the vehicle routing problem Annals of Operations Research, 89, 319–328 Bullnheimer, B., Hartl, R F., & Strauss, C (1999c) A new rank based version of the ant system - a computational study Central European Journal for Operations Research and Economics 7(1), 25–38 Caris, A., Macharis, C., & Janssens, G K (2013) Decision support in intermodal transport: A new research agenda Computers in Industry, 64(2), 105–112 Chao, I M., Golden, B L., & Wasil, E A (1995) An improved heuristic for the period vehicle routing problem Networks, 26(1), 25–44 Chao, I M., Golden, B L., & Wasil, E A (1996a) A fast and effective heuristic for the orienteering problem European Journal of Operational Research, 88(3), 475–489 Chao, I M., Golden, B L., & Wasil, E A (1996b) The team orienteering problem European Journal of Operational Research, 88(3), 464–474 Christofides, N., & Beasley, J E (1984) The period routing problem Networks, 14(2), 237–256 Christofides, N., Mingozzi, A., & Toth, P (1979) The vehicle routing problem In N Christofides, A Mingozzi, P Toth, & C Sandi (Eds.), Combinatorial optimization (pp 315–338) Chichester: Wiley Clarke, G., & Wright, J W (1964) Scheduling of vehicles from a central depot to a number of delivery points Operations Research, 12(4), 568–581 Cordeau, J F (2006) A branch-and-cut algorithm for the dial-a-ride problem Operations Research, 54(3), 573–586 Cordeau, J F., Gendreau, M., & Laporte, G (1997) A tabu search heuristic for periodic and multidepot vehicle routing problems Networks, 30(2), 105–119 Cordeau, J F., & Laporte, G (2003) A tabu search heuristic for the static multi-vehicle dial-a-ride problem Transportation Research Part B: Methodological, 37(6), 579–594 Cordeau, J F., Laporte, G., & Mercier, A., et al (2001) A unified tabu search heuristic for vehicle routing problems with time windows Journal of the Operational Research Society, 52(8), 928– 936 Crevier, B., Cordeau, J F., & Laporte, G (2007) The multi-depot vehicle routing problem with inter-depot routes European Journal of Operational Research, 176(2), 756–773 Current J R (1981) Multiobjective design of transportation networks Ph D thesis, The Johns Hopkins University Dantzig, G B., & Ramser, J H (1959) The truck dispatching problem Management Science, 6, 80–91 Dawid, H., Doerner, K F., Hartl, R F., Reimann, M (2002) Ant systems to solve operational problems In H Dawid, K F Doerner, G Dorffner, T Fent, M, Feurstein, R F Hartl, M Mild, M Natter, M Reimann, & A Taudes (Eds.), Quantitative models of learning organizations Interdisciplinary studies in economics and management (pp 63–94) Vienna: Springer Vienna Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II IEEE Transactions on Evolutionary Computation, 6(2), 182–197 Desaulniers, G., Madsen, O B G., & Røpke, S (2014) The vehicle routing problem with time windows In P Toth & D Vigo (Eds.), Vehicle routing: Problems, methods, and applications (2nd ed.) MOS - SIAM series on optimization (pp 119–160) Philadelphia: SIAM - Society for Industrial and Applied Mathematics Doerner, K F., Fuellerer, G., Hartl, R F., Gronalt, M., & Iori, M (2007) Metaheuristics for the vehicle routing problem with loading constraints Networks, 49(4), 294–307 Doerner, K F., Gronalt, M., Hartl, R F., Kiechle, G., & Reimann, M (2008a) Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows Computers & Operations Research, 35(9), 3034–3048 Doerner, K F., Gronalt, M., Hartl, R F., Reimann, M., Strauss, C., & Stummer, M (2002) Savingsants for the vehicle routing problem In S Cagnoni, J Gottlieb, E Hart, M Middendorf, & G Raidl (Eds.), Applications of evolutionary computing Lecture notes in computer science (Vol 2279, pp 11–20) Berlin: Springer Twenty Years of Vehicle Routing in Vienna 515 Doerner, K F., Gutjahr, W J., Hartl, R F., & Lulli, G (2008b) Stochastic local search procedures for the probabilistic two-day vehicle routing problem In A Fink, & F Rothlauf (Eds.), Advances in computational intelligence in transport, logistics, and supply chain management Studies in computational intelligence (Vol 144, pp 153–168) Berlin: Springer Doerner, K F., & Hartl, R F (2008) Health care logistics, emergency preparedness, and disaster relief: New challenges for routing problems with a focus on the Austrian situation In B L Golden, S Raghavan, & E A Wasil (Eds.), The vehicle routing problem: Latest advances and new challenges Operations research/computer science interfaces (Vol 43, pp 527–550) New York: Springer US Doerner, K F., Hartl, R F., Benkner, S., & Lucka, M (2006) Parallel cooperative savings based ant colony optimization - multiple search and decomposition approaches Parallel Processing Letters, 16(3), 351–369 Doerner, K F., Hartl, R F., Kiechle, G., Lucka, M., & Reimann, M (2004) Parallel ant systems for the capacitated vehicle routing problem In J Gottlieb & G Raidl (Eds.), Evolutionary computation in combinatorial optimization Lecture notes in computer science (Vol 3004, pp 72–83) Berlin: Springer Doerner, K F., Hartl, R F., & Lucka, M (2005) A parallel version of the D-Ant algorithm for the vehicle routing problem Parallel Numerics, 5, 109–118 Doerner, K F., Hartl, R F., & Reimann, M (2001) Cooperative ant colonies for optimizing resource allocation in transportation In E Boers (Ed.), Applications of evolutionary computing Lecture notes in computer science (Vol 2037, pp 70–79) Berlin: Springer Doerner, K F., Hartl, R F., & Reimann, M (2003) Competants for problem solving - the case of full truckload transportation Central European Journal of Operations Research, 11(2), 115– 141 Dorigo, M., & Gambardella, L M (1997) Ant colony system: A cooperative learning approach to the traveling salesman problem IEEE Transactions on Evolutionary Computation, 1(1), 53–66 Dorigo, M., Maniezzo, V., & Colorni, A (1996) Ant system: Optimization by a colony of cooperating agents IEEE Transactions on Systems, Man, and Cybernetics - Part B, 26(1), 29– 41 Dorigo, M., & Stützle, T (2010) Ant colony optimization: Overview and recent advances In M Gendreau & J Y Potvin (Eds.), Handbook of metaheuristics International series in operations research & management science (Vol 146, pp 227–263) New York: Springer US Eilon, S., Watson-Gandy, C D T., & Christofides, N (1971) Distribution management: mathematical modelling and practical analysis London: Griffin Feillet, D., & Dejax, P., & Gendreau, M (2005) Traveling salesman problems with profits Transportation Science, 39(2), 188–205 Fisher, M L (1994) Optimal solution of vehicle routing problems using minimum k-trees Operations Research, 42(4), 626–642 Fuellerer, G., Doerner, K F., Hartl, R F., & Iori, M (2009) Ant colony optimization for the two-dimensional loading vehicle routing problem Computers & Operations Research, 36(3), 655–673 Fuellerer, G., Doerner, K F., Hartl, R F., & Iori, M (2010) Metaheuristics for vehicle routing problems with three-dimensional loading constraints European Journal of Operational Research, 201(3), 751–759 Gansterer, M., Kücüktepe, M., & Hartl, R F (2015) The multi vehicle profitable pickup and delivery problem Manuscript submitted for publication Gélinas, S., Desrochers, M., Desrosiers, J., & Solomon, M M (1995) A new branching strategy for time constrained routing problems with application to backhauling Annals of Operations Research, 61(1), 91–109 Gendreau, M., Iori, M., Laporte, G., & Martello, S (2006) A tabu search algorithm for a routing and container loading problem Transportation Science, 40(3), 342–350 Gendreau, M., Laporte, G., & Semet, F (1997) The covering tour problem Operations Research, 45(4), 568–576 516 K.F Doerner et al Gendreau, M., & Potvin, J Y (2010) Tabu search In M Gendreau & J Y Potvin (Eds.), Handbook of metaheuristics International series in operations research & management science (Vol 146, pp 41–59) New York: Springer US Glover, F (1986) Future paths for integer programming and links to artificial intelligence Computers & Operations Research, 13(5), 533–549 Applications of Integer Programming Glover, F., & Laguna, M (1997) Tabu search Norwell, MA: Kluwer Academic Publishers Golden, B L., Raghavan, R., & Wasil, E A (Eds.) (2008) The vehicle routing problem: Latest advances and new challenges New York: Springer Golden, B L., Wasil, E A., Kelly, J P., & Chao, I M (1998) The impact of metaheuristics on solving the vehicle routing problem: Algorithms, problem sets, and computational results In Fleet management and logistics (pp 33–56) New York: Springer US Golden, B L., & Wong, R T (1981) Capacitated arc routing problems Networks, 11(3), 305–315 Gronalt, M., Hartl, R F., & Reimann, M (2003) New savings based algorithms for time constrained pickup and delivery of full truckloads European Journal of Operational Research, 151(3), 520–535 Groër, C., Golden, B L., & Wasil, E A (2009) The consistent vehicle routing problem Manufacturing & Service Operations Management, 11(4), 630–643 Gussmagg-Pfliegl, E., Tricoire, F., Doerner, K F., Hartl, R F., & Irnich, S (2011) Heuristics for a real-world mail delivery problem In C Di Chio, A Brabazon, G Di Caro, R Drechsler, M Farooq, J Grahl, G Greenfield, C Prins, J Romero, G Squillero, E Tarantino, A Tettamanzi, N Urquhart, & A Uyar (Eds.), Applications of evolutionary computation Lecture notes in computer science (Vol 6625, pp 481–490) Berlin: Springer Gutjahr, W J., Katzensteiner, S., & Reiter, P (2007) A VNS algorithm for noisy problems and its application to project portfolio analysis In J Hromkoviˇc R Královiˇc, M Nunkesser, & P Widmayer (Eds.), Stochastic algorithms: Foundations and applications Lecture notes in computer science (Vol 4665, pp 93–104) Berlin: Springer Hansen, P., Mladenovi´c, N., Brimberg, J., & Pérez, J A M (2010) Variable neighborhood search In M Gendreau & J Y Potvin (Eds.), Handbook of Metaheuristics, International series in operations research & management science (Vol 146, pp 61–86) New York: Springer US Hartl, R F., & Romauch, M (2013) The influence of routing on lateral transhipment In R Moreno-Díaz, F Pichler, & A Quesada-Arencibia (Eds.), Computer aided systems theory - EUROCAST 2013 Lecture notes in computer science (Vol 8111, pp 267–275) Berlin: Springer Hartl, R F., & Romauch, M (2016) Notes on the single route lateral transhipment problem Journal of Global Optimization, 65(1), 57–82 Hemmelmayr, V C., Doerner, K F., & Hartl, R F (2009a) A variable neighborhood search heuristic for periodic routing problems European Journal of Operational Research, 195(3), 791–802 Hemmelmayr, V C., Doerner, K F., Hartl, R F., & Rath, S (2013) A heuristic solution method for node routing based solid waste collection problems Journal of Heuristics 19(2), 129–156 Hemmelmayr, V C., Doerner, K F., Hartl, R F., & Savelsbergh, M W P (2009b) Delivery strategies for blood products supplies OR Spectrum, 31(4), 707–725 Hemmelmayr, V C., Doerner, K F., Hartl, R F., & Savelsbergh, M W P (2010) Vendor managed inventory for environments with stochastic product usage European Journal of Operational Research, 202(3), 686–695 Hemmelmayr, V C., Doerner, K F., Hartl, R F., & Vigo, D (2014) Models and algorithms for the integrated planning of bin allocation and vehicle routing in solid waste management Transportation Science, 48(1), 103–120 Hiermann, G., Puchinger, J., Ropke, S., & Hartl, R F (2016) The electric fleet size and mix vehicle routing problem with time windows and recharging stations European Journal of Operational Research, 252(3), 995–1018 Ichoua, S., & Gendreau, M., & Potvin, J -Y (2003) Vehicle dispatching with time-dependent travel times European Journal of Operational Research, 144(2), 379–396 Twenty Years of Vehicle Routing in Vienna 517 Iori, M (2004) Metaheuristic algorithms for combinatorial optimization problems Ph.D thesis, University of Bologna Jacobs-Blecha, C D., & Goetschalckx, M (1992) The vehicle routing problem with backhauls: Properties and solution algorithms Material Handling Research Center, Georgia Institute of Technology Jozefowiez, N., Semet, F., & Talbi, E G (2002) Parallel and hybrid models for multi-objective optimization: Application to the vehicle routing problem In J Guervós, P Adamidis, H G Beyer, H P Schwefel, & J L Fernández-Villacañas (Eds.), Parallel problem solving from nature - PPSN VII Lecture notes in computer science (Vol 2439, pp 271–280) Berlin: Springer Karp, R M (1972) Reducibility among combinatorial problems In R E Miller & J W Thatcher (Eds.), Complexity of computer computations The IBM research symposia series (pp 85–103) New York: Plenum Press Kiechle, G., Doerner, K F, Gendreau, M., & Hartl, R F (2009) Waiting strategies for regular and emergency patient transportation In B Fleischmann, K H Borgwardt R Klein, & A Tuma (Eds.), Operations research proceedings 2008 (pp 271–276) Berlin: Springer Kirkpatrick, S., Gelatt, C D., & Vecchi, M P (1983) Optimization by simulated annealing Science, 220(4598), 671–680 Knight, K W., & Hofer, J P (1968) Vehicle scheduling with timed and connected calls: A case study OR, 19(3), 299–310 Kovacs, A A., Golden, B L., Hartl, R F., & Parragh, S N (2015) The generalized consistent vehicle routing problem Transportation Science, 49(4), 796–816 Kovacs, A A., Golden, B L., Hartl, R F., & Parragh, S N (2014b) Vehicle routing problems in which consistency considerations are important: A survey Networks, 64(3), 192–213 Kovacs, A A., Parragh, S N., Doerner, K F., & Hartl, R F (2012) Adaptive large neighborhood search for service technician routing and scheduling problems Journal of Scheduling, 15(5), 579–600 Kovacs, A A., Parragh, S N., & Hartl, R F (2014c) A template-based adaptive large neighborhood search for the consistent vehicle routing problem Networks, 63(1), 60–81 Kovacs, A A., Parragh, S N., & Hartl, R F (2015) The multi-objective generalized consistent vehicle routing problem European Journal of Operational Research, 247(2), 441–458 Kritzinger, S., Tricoire, F., Doerner, K F., & Hartl, R F (2011) Variable neighborhood search for the time-dependent vehicle routing problem with soft time windows In C Coello (Ed.), Learning and intelligent optimization Lecture notes in computer science (Vol 6683, pp 61– 75) Berlin: Springer Kritzinger, S., Doerner, K F., Hartl, R F., Kiechle, G., Stadler, H., & Manohar, S S (2012) Using traffic information for time-dependent vehicle routing Procedia - Social and Behavioral Sciences, 39, 217–229 Kritzinger, S., Doerner, K F., Tricoire, F., & Hartl, R F (2015a) Adaptive search techniques for problems in vehicle routing, Part I: A survey Yugoslav Journal of Operations Research, 25(1), 3–31 Kritzinger, S., Doerner, K F., Tricoire, F., & Hartl, R F (2015b) Adaptive search techniques for problems in vehicle routing, Part II: A numerical comparison Yugoslav Journal of Operations Research, 25(2), 169–184 Kritzinger, S., Tricoire, F., Doerner, K F., Hartl, R F., & Stützle, T (2014) A unified framework for routing problems with a fixed fleet size Manuscript submitted for publication Laporte, G (2009) Fifty years of vehicle routing Transportation Science, 43(4), 408–416 Li, F., Golden, B L., & Wasil, E A (2007) The open vehicle routing problem: Algorithms, largescale test problems, and computational results Computers and Operations Research, 34(10), 2918–2930 Liu, F H., & Shen, S Y (1999) The fleet size and mix vehicle routing problem with time windows The Journal of the Operational Research Society, 50(7), 721–732 Lokin, F C J (1979) Procedures for travelling salesman problems with additional constraints European Journal of Operational Research, 3(2), 135–141 518 K.F Doerner et al Mladenovi´c, N., & Hansen, P (1997) Variable neighborhood search Computers & Operations Research, 24(11), 1097–1100 Moscato, P., & Cotta, C (2010) A modern introduction to memetic algorithms In M Gendreau, J Y Potvin (Eds.), Handbook of metaheuristics International series in operations research & management science (Vol 146, pp 141–183) New York: Springer US Mu, Q., Fu, Z., Lysgaard, J., & Eglese, R W (2011) Disruption management of the vehicle routing problem with vehicle breakdown Journal of the Operational Research Society, 62(4), 742–749 Nikolaev, A G., & Jacobson, S H (2010) Simulated annealing In M Gendreau & J Y Potvin (Eds.), Handbook of metaheuristics International series in operations research & management science (Vol 146, pp 1–39) New York: Springer US Nolz, P C., Doerner, K F., Gutjahr, W J., & Hartl, R F (2010a) A bi-objective metaheuristic for disaster relief operation planning In C Coello Coello, C Dhaenens, & L Jourdan (Eds.), Advances in multi-objective nature inspired computing Studies in computational intelligence (Vol 272, pp 167–187) Berlin: Springer Nolz, P C., Doerner, K F., & Hartl, R F (2010b) Water distribution in disaster relief International Journal of Physical Distribution & Logistics Management, 40(8/9), 693–708 Nolz, P C., Semet, F., & Doerner, K F (2011) Risk approaches for delivering disaster relief supplies OR Spectrum, 33(3), 543–569 Ostertag, A., Doerner, K F., & Hartl, R F (2008) A variable neighborhood search integrated in the popmusic framework for solving large scale vehicle routing problems In M Blesa, C Blum, C Cotta, A Fernández, J Gallardo, A Roli, & M Sampels (Eds.), Hybrid metaheuristics Lecture notes in computer science (Vol 5296, pp 29–42) Berlin: Springer Ostertag, A., Doerner, K F., Hartl, R F., Taillard, É D., & Waelti, P (2009) Popmusic for a real-world large-scale vehicle routing problem with time windows Journal of The Operational Research Society, 60(7), 934–943 Parragh, S N (2009) Ambulance routing problems with rich constraints and multiple objectives Ph.D thesis, University of Vienna Parragh, S N (2011) Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem Transportation Research Part C: Emerging Technologies 19(5), 912–930 Parragh, S N., Cordeau, J F., Doerner, K F., & Hartl, R F (2012) Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints OR Spectrum, 34(3), 593– 633 Parragh, S N., Doerner, K F., & Hartl, R F (2008a) A survey on pickup and delivery problems Part I: Transportation between customers and depot Journal für Betriebswirtschaft, 58(1), 21– 51 Parragh, S N., Doerner, K F., & Hartl, R F (2008b) A survey on pickup and delivery problems Part II: Transportation between pickup and delivery locations Journal für Betriebswirtschaft, 58(2), 81–117 Parragh, S N., Doerner, K F., & Hartl, R F (2010a) Demand responsive transportation In J J Cochran, L A Cox, P Keskinocak, J P Kharoufeh, & J C Smith (Eds.), Wiley encyclopedia of operations research and management science New York: Wiley Parragh, S N., Doerner, K F., & Hartl, R F (2010b) Variable neighborhood search for the dial-aride problem Computers & Operations Research, 37(6), 1129–1138 Parragh, S N., Doerner, K F., Hartl, R F., & Gandibleux, X (2009) A heuristic two-phase solution approach for the multi-objective dial-a-ride problem Networks, 54, 227–242 Parragh, S N., & Schmid, V (2013) Hybrid column generation and large neighborhood search for the dial-a-ride problem Computers & Operations Research, 40(1), 490–497 Pasia, J M., Doerner, K F., Hartl, R F., & Reimann, M (2007) A population-based local search for solving a bi-objective vehicle routing problem In C Cotta & J van Hemert (Eds.), Evolutionary computation in combinatorial optimization Lecture notes in computer science (Vol 4446, pp 166–175) Berlin: Springer Twenty Years of Vehicle Routing in Vienna 519 Pisinger, D., & Ropke, S (2010) Large neighborhood search In M Gendreau & J Y Potvin (Eds.), Handbook of metaheuristics International series in operations research & management science (Vol 146, pp 399–419) New York: Springer US Polacek, M., Benkner, S., Doerner, K F., & Hartl, R F (2008a) A cooperative and adaptive variable neighborhood search for the multi depot vehicle routing problem with time windows BuR - Business Research, 1(2), 207–218 Polacek, M., Doerner, K F., Hartl, R F., Kiechle, G., & Reimann, M (2007) Scheduling periodic customer visits for a traveling salesperson European Journal of Operational Research, 179(3), 823–837 Polacek, M., Doerner, K F., Hartl, R F., & Maniezzo, V (2008b) A variable neighborhood search for the capacitated arc routing problem with intermediate facilities Journal of Heuristics, 14(5), 405–423 Polacek, M., Hartl, R F., Doerner, K F., & Reimann, M (2004) A variable neighborhood search for the multi depot vehicle routing problem with time windows Journal of Heuristics, 10(6), 613–627 Pullen, H G M., & Webb, M H J (1967) A computer application to a transport scheduling problem The Computer Journal, 10(1), 10–13 Reimann, M., Doerner, K F., & Hartl, R F (2002a) Insertion based ants for vehicle routing problems with backhauls and time windows In M Dorigo, G Di Caro, & M Sampels (Eds.), Ant algorithms Lecture notes in computer science (Vol 2463, pp 135–148) Berlin: Springer Reimann, M., Doerner, K F., & Hartl, R F (2003) Analyzing a unified ant system for the VRP and some of its variants In G Raidl, S Cagnoni, J J R Cardalda, D W Corne, J Gottlieb, & A Guillot (Eds.), Applications of evolutionary computing Lecture notes in computer science (Vol 2611, pp 300–310) Berlin: Springer Reimann, M., Doerner, K F., & Hartl, R F (2004) D-Ants: Savings based ants divide and conquer the vehicle routing problem Computers & Operations Research, 31(4), 563–591 Reimann, M., Stummer, M., & Doerner, K F (2002b) A savings based ant system for the vehicle routing problem In Proceedings of the Genetic and Evolutionary Computation Conference, GECCO ’02 (pp 1317–1326) San Francisco, CA: Morgan Kaufmann Publishers Inc Reimann, M., & Ulrich, H (2006) Comparing backhauling strategies in vehicle routing using ant colony optimization Central European Journal of Operations Research, 14(2), 105–123 Resende, M G C., Ribeiro, C C., Glover, F., & Martí, R (2010) Scatter search and path-relinking: Fundamentals, advances, and applications In M Gendreau & J Y Potvin (Eds.), Handbook of metaheuristics International series in operations research & management science (Vol 146, pp 87–107) New York: Springer US Ritzinger, U., Puchinger, J., & Hartl, R F (2014) Dynamic programming based metaheuristics for the dial-a-ride problem Annals of Operations Research, 236(2), 341–358 Ritzinger, U., Puchinger, J., & Hartl, R F (2016) A survey on dynamic and stochastic vehicle routing problems International Journal of Production Research, 54(1), 215–231 Ropke, S., & Pisinger, D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows Transportation Science, 40(4), 455–472 Russell, R., & Igo, W (1979) An assignment routing problem Networks, 9(1), 1–17 Russell, R A., & Gribbin, D (1991) A multiphase approach to the period routing problem Networks, 21(7), 747–765 Schilde, M., Doerner, K F., & Hartl, R F (2011) Metaheuristics for the dynamic stochastic diala-ride problem with expected return transports Computers & Operations Research, 38(12), 1719–1730 Schilde, M., Doerner, K F., & Hartl, R F (2014) Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem European Journal of Operational Research, 238(1), 18–30 Schilde, M., Doerner, K F., Hartl, R F., & Kiechle, G (2009) Metaheuristics for the bi-objective orienteering problem Swarm Intelligence, 3(3), 179–201 520 K.F Doerner et al Schmid, V., Doerner, K F., Hartl, R F., & Salazar-González, J J (2010) Hybridization of very large neighborhood search for ready-mixed concrete delivery problems Computers & Operations Research, 37(3), 559–574 Schmid, V., Doerner, K F., Hartl, R F., Savelsbergh, M W P., & Stoecher, W (2009) A hybrid solution approach for ready-mixed concrete delivery Transportation Science, 43(1), 70–85 Schneider, M., Stenger, A., & Goeke, D (2014) The electric vehicle-routing problem with time windows and recharging stations Transportation Science, 48(4), 500–520 Shaw, P (1998) Using constraint programming and local search methods to solve vehicle routing problems In M Maher & J F Puget (Eds.), Principles and practice of constraint programming - CP98 Lecture notes in computer science (Vol 1520, pp 417–431) Berlin: Springer Solomon, M M (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints Operations Research, 35(2), 254–265 Steadie, S M., Dellaert, N P., Nuijten, W., Van Woensel, T., & Raoufi, R (2014) Multimodal freight transportation planning: A literature review European Journal of Operational Research 233(1), 1–15 Strodl, J., Doerner, K F., Tricoire, F., & Hartl, R F (2010) On index structures in hybrid metaheuristics for routing problems with hard feasibility checks: An application to the 2dimensional loading vehicle routing problem In M Blesa, C Blum, G Raidl, A Roli, & M Sampels (Eds.), Hybrid metaheuristics Lecture notes in computer science (Vol 6373, pp 160–173) Berlin: Springer Toth, P., & Vigo, D (2001a) An overview of vehicle routing problems In P Toth & D Vigo (Eds.), The vehicle routing problem (pp 1–26) Philadelphia: Society for Industrial and Applied Mathematics Toth, P., & Vigo, D (Eds.) (2001b) The vehicle routing problem Philadelphia: Society for Industrial and Applied Mathematics Toth, P., & Vigo, D (Eds.) (2014) Vehicle routing Philadelphia: Society for Industrial and Applied Mathematics Tricoire, F (2012) Multi-directional local search Computers & Operations Research, 39(12), 3089–3101 Tricoire, F., Doerner, K F., Hartl, R F., & Iori, M (2011) Heuristic and exact algorithms for the multi-pile vehicle routing problem OR Spectrum, 33(4), 931–959 Tricoire, F., Romauch, M., Doerner, K F., & Hartl, R F (2010) Heuristics for the multi-period orienteering problem with multiple time windows Computers & Operations Research, 37(2), 351–367 Tricoire, F., Romauch, M., Doerner, K F., & Hartl, R F (2013) Addendum: Addendum to “heuristics for the multi-period orienteering problem with multiple time windows” Computers & Operations Research, 40(5), 1516–1519 Tsiligirides, T (1984) Heuristic methods applied to orienteering The Journal of the Operational Research Society, 35(9), 797–809 Part III Appendix Achilles and the Theory of Games Alexander Mehlmann Abstract This small note offers a “tongue-in-cheek” route to some game theoretical facets of Greek mythology By using an apocryphal bilingual poem as well as mathematical arguments, we finally explain how Ulysses succeeded in detecting Achilles among the daughters of Lykomedes Explanatory Notes From the vast treasury of heroic sagas commonly written by life itself, only a single one could be truly narrated about Richard Hartl Did he or did he not vegetate, disguised as a mathematician, in the academic ruins of an ancient Viennese university, before being finally unmasked as a management scientist by the cunning tenure committee at the Otto von Guericke University Magdeburg? As his former roommate in Vienna I could easily enumerate all his countless weak points However, due to the lack of blackmailing tendencies, I will rather remain silent by flatteringly describing him as a profane variant of Achilles, the son of Peleus Up to now the story of Achilles and his exposure did definitely not belong to the canon of education in mathematics or even business administration and one could argue that its unexpected popping out at the centralized Austrian school leaving examination would certainly generate more causalities than the Trojan war as a whole This follows from the deplorable fact, that the reception of heroic sagas has been left, in a quite uncritical manner, mainly to linguists, philosophers, and mythologists, instead of entrusting it to the only discipline fit to reveal the truth behind myths: mathematics Each reader, inclined to fully understand the narrative of Achilles and his exposure without using a Latin dictionary, will either have to rely on Wikipedia (searching for “Achilles on Skyros”) or abandon all prosaic versions by following the A Mehlmann ( ) TU Wien, Institute of Statistics and Mathematical Methods in Economics, Wiedner Hauptstr / E105, 1040 Wien, Austria e-mail: alexander.mehlmann@tuwien.ac.at © Springer International Publishing Switzerland 2016 H Dawid et al (eds.), Dynamic Perspectives on Managerial Decision Making, Dynamic Modeling and Econometrics in Economics and Finance 22, DOI 10.1007/978-3-319-39120-5_27 523 524 A Mehlmann interpretation subsequently offered by a lighthearted and polyglot (German and English) piece of poetry, the validity of which is finally and convincingly proved by means of a game theoretic model Hyginus Mythographus FABULA XCVI ACHILLES Thetis Nereis cum sciret Achillem filium suum, quem ex Peleo habebat, si ad Troiam expugnandam isset, periturum, commendavit eum in insulam Scyron ad Lycomedem regem, quem ille inter virgines filias habitu femineo servabat nomine mutato; nam virgines Pyrrham nominarunt, quoniam capillis flavis fuit et Graece rufum pyrrhon dicitur Achivi autem cum rescissent ibi eum occultari, ad regem Lycomeden oratores miserunt qui rogarent ut eum adjutorium Danais mitteret Rex cum negaret apud se esse, potestatem eis fecit ut in regia quaererent Qui cum intellegere non possent quis esset eorum, Ulixes in regio vestibulo munera feminea posuit, in quibus clipeum et hastam, et subito tubicinem jussit canere armorumque crepitum et clamorem fieri iussit Achilles hostem arbitrans adesse vestem muliebrem dilaniavit atque clipeum et hastam arripuit Ex hoc est cognitus suasque operas Argivis promisit et milites Myrmidones Die Entlarvung des Achilles1 Im ganzen Universe Kennt man die rechte Ferse Als meinen wunden Punkt Dem Sohne des Laertes Fiel ein was Unerhörtes Danach als Hinterlist Es hat stets Mama Thetis, Was halt a patzn Gfrett is, Vom Tod im Krieg geunkt Er brachte von Mykene Die beispiellos mondäne Gewandung aus Batist Am Hof des Lykomedes Vernaschte ich schon jedes Von seinen Töchterlein Mit Fibeln disponibel Aus Elfenbein (sensibel Erjagt in Côte d’Ivoire) Im Frauenoberkleide Aus Wolle, nicht aus Seide, Da steckt’ ich nur zum Schein Von Troja bis nach Delphi Fehlt wohl in keinem Selfie Ein solches Accessoire Als die Achäer kamen, Da trafen sie nur Damen Und keinen Sagenheld Wenn Mädchen es erblicken Ob Fürstinnen, ob Zicken Schrei’n sie im Modewahn This lyric gem belongs to an apocryphal collection of mathematical ballads: Alexander Mehlmann, Mathematische Moritaten, CreateSpace Independent Publishing Platform, 2016 Achilles and the Theory of Games 525 Bei Schlachtlärm kreischen Misses (Das wusste auch Ulysses) Und geben Fersengeld Gewillt dies anzubringen, Ließ ich den Kehlklopf klingen Im schallenden Päan Die Griechen kehrten wieder Mit Weibertand und Flieder Samt Waffengarnitur Jedoch die blöden Miezen Im Glauben mich zu schützen, Vollführten keinen Ton Bestrebt mich einzukreisen, Taucht auf am kalten Eisen Ein Fingerabdruck nur Als Spottgestalt der Mode Besingt mich kein Rhapsode Dann bliesen sie Fanfaren, Um endlich zu erfahren Wer nun Achilles sei Drum auf nach Ilion! Doch keine von den Schnecken Griff nach den Eisenstecken Und tanzte aus der Reih The exposure of Achilles2 Aside from sex appeal I also have a heel Well known as my weak spot Then Penelope’s man Designed a cunning plan To catch the guy disguised As mother Thetis said, “Live as a girl instead; In Troy it’s bad to rot.” He brought as dastard lure A piece of fine couture In Argos highly prized At Lykomedes’ court I did myself comport By sleeping with his girls Emblazoned with a brooch Of ivory (to poach In Côte d’Ivoire for free) I loved it just to pose Disguised in womens’ clothes And wearing costly pearls Each maiden would shout out (In madness without doubt) For this accessory Fluent in ancient Greek, Ulysses came to seek A hero for the war According to this thought I started all for naught An ancient battle roar A roughly adequate translation of the German language poem printed on the previous page (see: Alexander Mehlmann, Mathematische Moritaten, CreateSpace Independent Publishing Platform, 2016) 526 A Mehlmann The only thing he found Confined to this compound: Nine girls and nothing more But echo came there none (Ulysses having fun Rolled laughing on the floor.) He briskly came then back With womens’ bric a brac Concealing sword and spear A hero to protect, That’s why chicks did defect Oppressing any sound Since his detection test Needs choices to be guessed And anything to fear To quit as laughing stock, Let’s take the Trojan walk A blare of clarion (A bit Wagnerian) Did scare the pants of all And get my mortal wound! But no one from the nine Did as a hoplite shine By answering the call In the original variant of the story (see Hyginus Mythographus for a short Latin summary) the reason why Achilles is exposed seems to contradict any game theoretic rule Disguised as one of the daughters of king Lykomedes, Achilles is revealing itself to Odysseus, by picking a weapon from the gifts offered, as soon as the alarming sound of a clarion, indicating danger, is heard This behavior is, however, counterintuitive Achilles’ strategy should not in fact be distinguishable from the presumed behaviour of the king’s daughters Thus the cunning plan of Odysseus (Ulysses for the Latin aficionado) is from the first doomed to failure The second variant, which is both more erudite and poetical valuable than the original story, can be consistently modelled as an extensive game (see Fig above) Ulysses will only be able to expose Achilles, if his behaviour is fully distinguishable from the reaction shown by the daughters of Lykomedes Since any collusion between our hero and the Lykomädis (i.e Lykomedes-girls) is strictly excluded, the only reasonable equilibrium will let Achilles oscillate his vocal fold (P) with probability 0:5, whereas the chicks will equiprobable remain silent (S) Since both coordination and repetition are excluded, the pure equilibria P; P/ and S; S/, which would be preferred by standard textbooks of game theory, have to remain out for consideration Achilles and the Theory of Games 527 Ulysses P S P Ulysses Lykomă adis e (−1, −1, −1) v (+1, +2, +1) e (−1, −2, +1) v (+1, +1, −2) Achilles Ulysses e (−1, −2, +2) v (+1, +1, +1) e (−1, −1, −2) v (+1, +2, −1) S P S Ulysses Fig Achilles and his game tree Final Comment Due to the lack of space and the banishment of this contribution to the appendix, all necessary deductions will remain undone We will leave them over as a last homework assignment to Richard Hartl, who is enjoyned to work out the details in ancient Greek and to deliver the results at his retirement festivity ... gernot.tragler@tuwien.ac.at © Springer International Publishing Switzerland 2016 H Dawid et al (eds.), Dynamic Perspectives on Managerial Decision Making, Dynamic Modeling and Econometrics in Economics and Finance 22,... make a decision Decision makers are often not able to provide precise preference information, which is required to solve a multicriteria decision problem Thus, many methods of decision making. .. Decision Making, Dynamic Modeling and Econometrics in Economics and Finance 22, DOI 10.1007/978-3-319-39120-5_1 H Dawid et al able to make contributions to research on managerial decision making in

Ngày đăng: 20/01/2020, 14:19

TỪ KHÓA LIÊN QUAN

TÀI LIỆU CÙNG NGƯỜI DÙNG

TÀI LIỆU LIÊN QUAN