Systems in Der Verkehrszentrale Einer Fluggesellschaft

Total Page:16

File Type:pdf, Size:1020Kb

Systems in Der Verkehrszentrale Einer Fluggesellschaft Entwicklung und Einsatz eines Entscheidungsunterstützungs- systems in der Verkehrszentrale einer Fluggesellschaft Vom Fachbereich Rechts- und Wirtschaftswissenschaften der Technischen Universität Darmstadt zur Erlangung des akademischen Grades Doctor rerum politicarum (Dr. rer. pol.) genehmigte Dissertation von Sebastian Heger Erstgutachter: Prof. Dr. Dr. h.c. mult. Hans-Christian Pfohl Zweitgutachterin: Jun.–Prof. Dr. Anne Lange Darmstadt — 2018 Fachbereich Rechts- und Wirtschaftswissenschaften Supply Chain- und Netzwerkmanagement Heger, Sebastian: Entwicklung und Einsatz eines Entscheidungsunterstützungssystems in der Verkehrszentrale einer Fluggesellschaft Darmstadt, Technische Universität Darmstadt Tag der mündlichen Prüfung: 05.07.2018 Jahr der Veröffentlichung: 2018 (TUprints) Bitte zitieren Sie dieses Dokument als: URN: urn:nbn:de:tuda-tuprints-76367 URL: http://tuprints.ulb.tu-darmstadt.de/id/eprint/7636 Dieses Dokument wird bereitgestellt von tuprints, E-Publishing-Service der TU Darmstadt http://tuprints.ulb.tu-darmstadt.de [email protected] Die Veröffentlichung steht unter folgender Creative Commons Lizenz: Namensnennung — Nicht-kommerziell — Keine Bearbeitung 4.0 International https://creativecommons.org/licenses/by-nc-nd/4.0/ Zusammenfassung Faktoren wie Globalisierung, Liberalisierung und verbesserte Produktionsfaktoren fungieren in den letzten Jahrzehnten als Treiber für ein kontinuierliches Wachstum im kommerziellen Luft- verkehr. Dementsprechend ist auch die Steuerung des operativen Betriebes der einzelnen Flugge- sellschaften durch ihre Verkehrszentralen immer komplexer und aufwändiger geworden. Störer- eignisse und deren Auswirkungen treffen die im starken Wettbewerb stehenden Fluggesellschaf- ten heute härter denn je zuvor, so dass ein dringender Bedarf zur besseren Unterstützung von Entscheidungen innerhalb der Verkehrszentrale zur Reduktion von zusätzlichen Kosten existiert. Im Rahmen der vorliegenden Arbeit werden methodische Ansätze diskutiert, um die bisher über- wiegend theoretisch existierenden und kaum genutzten Entscheidungsunterstützungssysteme zu praxistauglichen Systemen auszubauen. Insbesondere aus technologischer und funktionaler Sicht sind trotz der intensiven Forschung in den letzten 30 Jahren keine großen Veränderungen zu re- gistrieren, da Annahmen über die unternehmerische Praxis regelmäßig zu sehr vereinfacht und zu wenig verallgemeinert werden. Durch die vorliegende Arbeit werden die Aufgaben, Organisationsgestaltung sowie Informations- und Kommunikationssysteme innerhalb der Verkehrszentrale systematisch dargestellt. Sowohl die Identifikation von Handlungsoptionen sowie den Rahmenbedingungen und dem Zusammen- spiel einzelner Akteure sind von zentraler Bedeutung, um zu verstehen, wie Funktionsbereiche und Entscheider ihre täglichen Aufgaben erfüllen. Aufbauend auf diesen Erkenntnissen werden relevante Anwendungsfälle und Anforderungen abgeleitet. Gerade die Vielzahl möglicher Modelle und Algorithmen aus dem Bereich der mathematischen Optimierung, welche bereits durch die Forschungsarbeiten thematisiert worden sind, werden er- neut durch diese Arbeit bewertet und weiterführend analysiert. Denn nur allgemeingültige und flexible Ansätze können dabei unterschiedlichen Fluggesellschaften mit möglichst geringen An- passungen adressieren. Die Ergebnisse dieser Arbeit stützen sich zum großen Teil auf den Erkenntnissen, die im Rahmen eines vierjährigen Forschungsprojektes mit einem aus mehreren verschiedenen Fluggesellschaf- ten bestehenden Konzern erarbeitet wurden. Im Rahmen der Kooperation ist als Ergebnis ein praxistaugliches Entscheidungsunterstützungssystem auf Basis dieser Arbeit entstanden, welches sich bereits parallel in zwei Verkehrszentralen des Forschungspartners im produktiven Betrieb be- findet. Damit das Tool für weitere Fluggesellschaften innerhalb des Konzerns einfach ausgerollt werden kann, wurde die Optimierungslogik soweit wie möglich mittels eines Geschäftsregel- Managementsystems entkoppelt. I Abstract Factors such as globalization, liberalization and improved production factors have been driving continuous growth in commercial air transport in recent decades. Accordingly, the management of operations by the airlines’ operations control centers has become increasingly complex and costly. Since today’s highly competitive airlines are more severely affected by disruptive events and their effects than ever before, there is an urgent need for better decision support within the operations control centers to reduce additional costs. Within the scope of this work, methodological approaches are discussed to extend the decision support systems, which up to now are mainly a theoretical construct and have hardly been used, to be established as practical systems. Despite intensive research over the last 30 years, there have been no major changes from a technological and functional point of view. Primarily respon- sible is that assumptions about business practices are regularly simplified and less generalized. This paper systematically presents the tasks, organizational design and information and commu- nication systems existing within the operations control centers. The identification of options for action and the framework conditions as well as the interaction of individual actors are necessary to understand how functional areas and decision-makers fulfill their daily tasks. Based on these findings, relevant use cases and requirements are derived. Especially the variety of possible models and algorithms from the field of mathematical optimi- zation, that have already been addressed by the research work, are reinvestigated and further analyzed. This is a necessary step because only universal and flexible approaches can address different airlines with as few adjustments as possible. The results of this work are mainly based on the findings of a four-year research project, which was carried out together with a group of several different airlines. As part of this cooperation, a practical decision support system based on this work has been developed, which is already in productive environment in two operations control centers of the research partner. To make it easy for other airlines within the group to roll out the tool, the optimization logic was decoupled as far as possible using a business rule management system. II Danksagung Zuerst möchte ich meinem Doktorvater Herrn Prof. Dr. Dr. h.c. mult. Hans-Christian Pfohl für das große Vertrauen in meine Arbeit, insbesondere im Rahmen der Forschungskooperation, herzlich danken. Durch dieses Vertrauen konnte ich mir einen reichhaltigen Erfahrungs- und Wissensschatz in den verschiedenen Themen des Luftverkehrs aufbauen. Meiner Korreferentin Frau Jun.–Prof. Dr. Anne Lange danke ich sehr für das stets umfangreiche Feedback zu den ein- zelnen Zwischenständen der Forschungsarbeit. Die Gespräche und die Anregungen haben mich stets zu motivieren gewusst. Meinem früheren Bürokollegen Ulrich Berbner bin ich für die Un- terstützung dankbar, damit ich mich als Neuling an der TU Darmstadt schnell einleben konnte. Außerdem stand er mir bei der Bearbeitung der anfangs fachfremden Themen stets bei Seite. Einen großen Dank geht an alle Mitarbeiter des Forschungspartners, deren unermüdliche Un- terstützung und zielgerichtete Zusammenarbeit den Grundstein für diese Arbeit gelegt haben. Besonders danke ich dabei Projektleiter Torsten, der stets für einen kontinuierlichen Fortschritt im Projekt sorgte, meine Arbeit immer zu Schätzen wusste und mit größter Unterstützung auch das Unmögliche für mich möglich machte. Meinen größten Respekt zolle ich den Mitarbeitern der Verkehrszentralen. Insbesondere möchte ich Maren und Klaus hervorheben, die für mei- ne umfangreichen Fragen und Ideen stets Rede und Antwort standen. Für die fruchtbare Zu- sammenarbeit im Bereich der mathematischen Optimierung möchte ich mich auch bei Markus bedanken, dessen Meinung, Fachwissen und Rat ich bereits zu Beginn des Projektes sehr zu schät- zen gelernt habe. Des Weiteren danke ich Axel, Günter, Jürgen, Jörg, Robert und Stefan aus der IT für die umfangreiche Unterstützung bei den technischen Fragen und organisatorischen Aufgaben. Großer Dank gebührt auch meinem Arbeitgeber, der M2P Consulting GbmH, für die Wertschät- zung meiner Arbeit und das Einräumen der zusätzlichen Zeit, damit die Ergebnisse dieser Arbeit auch fertig zu Papier gebracht werden konnten. Besonders hervorheben möchte ich das IT-Team bestehend aus Armin Berres, Bernd Noll, Frank Morbitzer und Max Winterstein für ihren Einsatz und Beitrag zur technischen Ausgestaltung der Ergebnisse. Darüber hinaus möchte ich mich bei meiner Familie, insbesondere bei meinen Eltern Renate und Reinhard Heger herzlich bedanken, die mir zur Bewältigung der Arbeit stets den nötigen Rückhalt gegeben haben. Ein ganz besonderer Dank geht an meinen Bruder Alexander Heger, der mich bei der Korrektur mit seiner ganzen Zeit und Motivation unermüdlich unterstützte. Diese Arbeit widme ich meiner Partnerin Marina Rothenbücher und unserem gemeinsamen Sohn Lars, die während der Anfertigung der Arbeit mit mir durch dick und dünn gegangen sind. Leider hatte ich in den letzten Jahren viel zu selten und zu wenig Zeit für gemeinsame Aktivitäten, was jetzt unbedingt nachgeholt werden muss. III Inhaltsverzeichnis Abkürzungsverzeichnis VII Abbildungsverzeichnis IX Tabellenverzeichnis XI 1 Einleitung 1 1.1 Problemstellung . .2 1.2 Zielsetzung . .4 1.3 Aufbau der Arbeit . .5 2 Die Verkehrszentrale: Mittelpunkt des operativen Managements 7 2.1 Aufgaben der Verkehrszentrale
Recommended publications
  • Case Management Task Assignment Using Optaplanner
    Masaryk University Faculty of Informatics Case Management Task Assignment Using OptaPlanner Master’s Thesis Bc. Marián Macik Brno, Fall 2016 Replace this page with a copy of the official signed thesis assignment anda copy of the Statement of an Author. Declaration Hereby I declare that this paper is my original authorial work, which I have worked out on my own. All sources, references, and literature used or excerpted during elaboration of this work are properly cited and listed in complete reference to the due source. Bc. Marián Macik Advisor: Mgr. Marek Grác, Ph.D. i Acknowledgement Here I would like to thank my family, friends and colleagues for their support during the work on this thesis. Moreover, I thank my consul- tant, Mgr. Ivo Bek, for guiding me during my work and for helping me overcome issues experienced when writing this thesis. I would also like to thank my advisor, Mgr. Marek Grác, Ph.D., for his help regarding the text of the thesis and for his advice in initial stages of the work. Finally, I would especially like to thank Maciej Swiderski for his help with the configuration of jBPM engine and Geoffrey De Smet for his help with OptaPlanner. ii Abstract The aim of the thesis is to analyse, design and implement a module for automated task assignment by integrating jBPM engine and Op- taPlanner. The thesis describes case management, its difference from business process management and their notations. After that, jBPM engine together with OptaPlanner are explained. In the second half of the thesis, the actual implementation and prototype application are presented, including the performance tests in different OptaPlanner configurations and scenarios.
    [Show full text]
  • Vrpsolver: a Generic Exact Solver for Vehicle Routing and Related Problems
    VRPSolver: a Generic Exact Solver for Vehicle Routing and Related Problems Eduardo Uchoa Departamento de Engenharia de Produ¸c~ao Universidade Federal Fluminense Niter´oi- RJ, Brasil SPOC20 { School on Advanced BCP Tools { Paris A Generic Exact Solver for VRP Vehicle Routing Problem (VRP) One of the most widely studied in Combinatorial Optimization: +7,500 works published only in 2018 (Google Scholar), mostly heuristics Direct application in the real systems that distribute goods and provide services. Optimized routes can: save a lot of money reduce the environmental impacts of transportation SPOC20 { School on Advanced BCP Tools { Paris A Generic Exact Solver for VRP Example: In 2017, Amazon spent USD 21.7B in shipping, 14.2% of its net sales. As customers demand quicker service, this percentage is growing! SPOC20 { School on Advanced BCP Tools { Paris A Generic Exact Solver for VRP Vehicle Routing Problem (VRP) Reflecting the variety of real transportation systems, VRP literature is spread into hundreds of variants. For example, there are variants that consider: Vehicle capacities, Time windows, Heterogeneous fleets, Multiple depots, Split delivery, pickup and delivery, backhauling, Arc routing (Ex: garbage collection), etc, etc. Articles describing new variants appear every week SPOC20 { School on Advanced BCP Tools { Paris A Generic Exact Solver for VRP Outline of the presentation Part I - Advances on Exact CVRP algorithms Review of the advances in the last 15 years Part II - From CVRP to other classic VRP variants Part III - A Generic
    [Show full text]
  • A New Approach for Solving the Disruption in Vehicle Routing Problem During the Delivery a Comparative Analysis of VRP Meta-Heuristics
    Master of Science in Computer Science May 2020 A New Approach for Solving the Disruption in Vehicle Routing Problem During the Delivery A Comparative Analysis of VRP Meta-Heuristics Sai Chandana Kaja Faculty of Computing, Blekinge Institute of Technology, 371 79 Karlskrona, Sweden This thesis is submitted to the Faculty of Computing at Blekinge Institute of Technology in partial fulfillment of the requirements for the degree of Master of Science in Computer Science. The thesis is equivalent to 20 weeks of full-time studies. I declare that I am the sole author of this thesis and have not used any sources other than those listed in the bibliography and identified as references. I further declare that I have not submitted this thesis at any other institution to obtain a degree. Contact Information: Author(s): Sai Chandana Kaja E-mail: [email protected] University advisor: Dr. Julia Sidorova Department of Computer Science Blekinge Institute of Technology, Karlskrona, Sweden Faculty of Computing Internet : www.bth.se Blekinge Institute of Technology Phone : +46 455 38 50 00 SE–371 79 Karlskrona, Sweden Fax : +46 455 38 50 57 Abstract Context. The purpose of this research paper is to describe a new approach for solving the disruption in the vehicle routing problem (DVRP) which deals with the disturbance that will occur unexpectedly within the distribution area when executing the original VRP plan. The paper then focuses further on the foremost common and usual problem in real-time scenarios i.e., vehicle-breakdown part. Therefore, the research needs to be accomplished to deal with these major dis- ruption in routing problems in transportation.
    [Show full text]
  • School of Science and Engineering Capstone Report
    School of Science and Engineering Capstone Report Applications of the Vehicle Routing Problem to Logistics Optimization Submitted in: Fall 2017 Written By: RIDA ELBOUSTANI Supervised by: Dr. Abderrazak Elboukili & Dr. Ilham Kissani Table of Contents List of Acronyms and Abbreviations .......................................................................................... 5 List of figures ................................................................................................................................. 6 Acknowledgements ....................................................................................................................... 7 Abstract .......................................................................................................................................... 8 Introduction ................................................................................................................................... 9 Scope of the Project: .................................................................................................................. 9 STEEPLE Analysis: ................................................................................................................ 10 SWOT Analysis: ...................................................................................................................... 11 Literature Review ....................................................................................................................... 12 Overview of the Vehicle Routing Problem ...........................................................................
    [Show full text]
  • Technical Program
    TECHNICAL PROGRAM Wednesday, 9:00-10:30 Wednesday, 11:00-12:40 WA-01 WB-01 Wednesday, 9:00-10:30 - 1a. Europe a Wednesday, 11:00-12:40 - 1a. Europe a Opening session - Plenary I. Ljubic Planning and Operating Metropolitan Passenger Transport Networks Stream: Plenaries and Semi-Plenaries Invited session Stream: Traffic, Mobility and Passenger Transportation Chair: Bernard Fortz Invited session Chair: Oded Cats 1 - From Game Theory to Graph Theory: A Bilevel Jour- ney 1 - Frequency and Vehicle Capacity Determination using Ivana Ljubic a Dynamic Transit Assignment Model In bilevel optimization there are two decision makers, commonly de- Oded Cats noted as the leader and the follower, and decisions are made in a hier- The determination of frequencies and vehicle capacities is a crucial archical manner: the leader makes the first move, and then the follower tactical decision when planning public transport services. All meth- reacts optimally to the leader’s action. It is assumed that the leader can ods developed so far use static assignment approaches which assume anticipate the decisions of the follower, hence the leader optimization average and perfectly reliable supply conditions. The objective of this task is a nested optimization problem that takes into consideration the study is to determine frequency and vehicle capacity at the network- follower’s response. level while accounting for the impact of service variations on users In this talk we focus on new branch-and-cut (B&C) algorithms for and operator costs. To this end, we propose a simulation-based op- dealing with mixed-integer bilevel linear programs (MIBLPs).
    [Show full text]
  • Handbook of Good Practice
    www.interreg-danube.eu/Smart-Factory-Hub DOCUMENT TITLE: HANDBOOK OF GOOD PRACTICE Project: Improving RD and business policy conditions for transnational cooperation in the manufacturing industry Acronym: Smart Factory Hub Work package WP4: Improving Knowledge Base Activity A 4.2: Good practice handbook tool Deliverable D 4.2.3: Handbook tool report Date of issue 29.12.2017 Document issued by UTCN Contributors PTP, HAMAG, USTUTT, PRO, UWB, SCCI, PBN, BICT, CCIS Version xx.x Number of Pages 243 Dissemination level PU Public PP Restricted to other Programme participants RE Restricted to a group specified by the consortium CO Confidential, only for members of the consortium X Project co-funded by European Union funds (ERDF, IPA) www.interreg-danube.eu/Smart-Factory-Hub TARGET GROUP ASSESSMENT Has this deliverable addressed any of the target group indicated in the application form? Yes / No If yes, please describe the involvement of each individual target group in the table below. Number Target group reached by the Description of target group involvement deliverable SME 5x SME which provide data for good practice Regional public authority National public authority Higher education and research Business support organisation Project co-funded by European Union funds (ERDF, IPA) Page: 2/243 www.interreg-danube.eu/Smart-Factory-Hub CONTENT 1 Introduction ......................................................................................................................... 6 2 About SFH Project .............................................................................................................
    [Show full text]
  • Prescriptive Analytics for Business Leaders
    PRESCRIPTIVE ANALYTICS FOR BUSINESS LEADERS PETER BULL CARLOS CENTURION SHANNON KEARNS ERIC KELSO NARI VISWANATHAN PRESCRIPTIVE ANALYTICS: FOR BUSINESS LEADERS 1 PRESCRIPTIVE ANALYTICS FOR BUSINESS LEADERS BY PETER BULL, CARLOS CENTURION, SHANNON KEARNS, ERIC KELSO AND NARI VISWANATHAN EXPLORE: • THE DIFFERENT APPROACHES TO PRESCRIPTIVE ANALYTICS • THE TRANSFORMATIONAL VALUE IT BRINGS TO BUSINESS LEADERS • HOW TO DETERMINE IF YOUR COMPANY IS READY FOR PRESCRIPTIVE • A STEP-WISE APPROACH TO FINDING YOUR FIRST USE CASE AND GETTING STARTED • SOME REAL-WORLD, CROSS-INDUSTRY APPLICATIONS 2 FOREWORD FOREWORD BY ANDRE BOISVERT With over 35 years in the technology industry, leadership roles at IBM, Oracle and SAS Institute, Inc., and a co-founder of the world’s most popular commercial open source business intelligence platforms (Pentaho Corporation), Andre Boisvert is a thought-leader in the business analytics space. He serves on multiple boards, including servings as River Logic’s Board Vice Chairman and Senior Advisor. More and more, business leaders are becoming responsible for understanding how to appropriately leverage business analytics to drive value, both within their business unit as well as companywide. Simply being familiar with the types of business analytics is no longer enough, however; leaders must familiarize themselves with the kinds of problems for which each type of analytics is best suited. Prescriptive analytics is no exception to this. A recent report by Gartner stated the following: “Prescriptive analytics is moving beyond its core community of operations research and management science professionals and becoming increasingly embedded in business applications.” (Hare, J., Swinehart, H., Woodward, A., Forecast Snapshot: Prescriptive Analytics, Worldwide, 2017, Gartner Inc., May 3 2017.) Deemed the most transformational form of advanced analytics, it’s crucial that business leaders understand the value that can be drawn from prescriptive analytics and take responsibility for driving initiatives.
    [Show full text]
  • Specifying Local Search Neighborhoods from a Constraint Satisfaction Problem Structure
    Specifying Local Search Neighborhoods from a Constraint Satisfaction Problem Structure Mateusz Sla_zy´nski´ 1, Salvador Abreu2, and Grzegorz J. Nalepa1 1 AGH University of Science and Technology, Krakow, Poland fmslaz, [email protected] 2 University of Evora´ and LISP, Evora,´ Portugal [email protected] Abstract Neighborhood operators play a crucial role in defining effec- tive Local Search solvers, allowing one to limit the explored search space and prune the fitness landscape. Still, there is no accepted formal repre- sentation of such operators: they are usually modeled as algorithms in a procedural language, lacking in compositionality and readability. In this paper we propose a new formalization capable of representing several neighborhood operators, thereby eschewing the need to code these in a full Turing complete language. The expressiveness of our proposal stems from a rich problem representation, as used in Constraint Programming models. We compare our system to competing approaches and show a clear increment in expressiveness. 1 Introduction Local Search is a family of heuristic algorithms, typically used to find approxi- mate solutions for hard optimization problems. The common core of those meth- ods consists in finding an initial sub-optimal solution (called configuration in the rest of the paper) and iteratively replacing it with similar configurations, called neighbors. There is a vast body of research on the exploration methods, called metaheuristics, focused mostly on escaping local optima and finding novel configurations. While metaheuristics vary in their performance, they are generic enough to be applicable to many different problems. Various algorithmic configu- ration methods can be used to tune their parameters without human interaction.
    [Show full text]
  • Data Science and Analytics Diploma
    DATA SCIENCE AND ANALYTICS DIPLOMA The Data and Predictive Analytics Center, RIT New York “The world’s most valuable resource is no longer oil, but data” The Economist PROGRAM OVERVIEW & OBJECTIVES PROGRAM METHODOLOGY With data now one of the world's most valuable resources, analysis of large quantities of data is Modules are designed to use the most practical approach to deliver a highly sought after skill-set. RIT Dubai's Professional Diploma in Data Science is a the material, using the most eective learning techniques. multidisciplinary program intended for professionals in diverse elds, including nance, retail, Participants can expect the following during the course of the science, engineering or manufacturing, who need to analyze Big Data; data which is so large in program: volume and variety that it is not amenable to processing or analysis using traditional database and software techniques. Lecture modules delivered by subject matter experts. Use of cutting edge tools on various topics covered in the program. Students studying the professional diploma will: Access to a research repository on the subject. Study how to explore and manage large datasets being generated and used in the modern Discussion of case studies. world. Class room activities. Project work. Be introduced to practical techniques used in exploratory data analysis and mining including data preparation, visualization, statistics for understanding data, and grouping and prediction techniques. PROGRAM MODULES & TIMINGS Present approaches used to store, retrieve, and manage data in the real world including Four modules - Three days each traditional database systems, query languages, and data integrity and quality. Duration: October, 2017 - January, 2018 Study how to use big data analytics to reach data-driven decision making.
    [Show full text]
  • Windowed Planning)
    OptaPlanner User Guide Version 6.0.0.Beta1 by The OptaPlanner team [http://www.optaplanner.org/community/team.html] ........................................................................................................................................ ix 1. Planner introduction .................................................................................................... 1 1.1. What is OptaPlanner? ......................................................................................... 1 1.2. What is a planning problem? ............................................................................... 3 1.2.1. A planning problem is NP-complete .......................................................... 3 1.2.2. A planning problem has (hard and soft) constraints .................................... 3 1.2.3. A planning problem has a huge search space ............................................ 4 1.3. Download and run the examples ......................................................................... 4 1.3.1. Get the release zip and run the examples ................................................. 4 1.3.2. Run the examples in an IDE (IntelliJ, Eclipse, NetBeans) ............................ 6 1.3.3. Use OptaPlanner with Maven, Gradle, Ivy, Buildr or ANT ............................ 6 1.3.4. Build OptaPlanner from source ................................................................. 7 1.4. Status of OptaPlanner ......................................................................................... 7 1.5. Compatibility ......................................................................................................
    [Show full text]
  • Book of Abstracts
    Workshop of the EURO Working Group on Vehicle Routing and Logistics optimization (VeRoLog) 2-5 Jun 2019 Seville Spain Table of contents Handling Vehicle Relocation Through Layered graphs, Alain Quilliot [et al.]... 13 Predictive dynamic relocations in carsharing systems implementing complete jour- ney reservations, Martin Repoux [et al.]....................... 14 Comparing centralized and decentralized repositioning strategies for ride-sharing applications, Martin Pouls [et al.]........................... 15 The pickup and delivery problem with online transfers, for the next generation of public transport, Paul Bouman [et al.]........................ 16 Optimized real-time management for on-demand ride sharing services., Zahra Ghandeharioun [et al.]................................. 17 The effect of spatial and temporal flexibility on the profitability of one-way electric carsharing systems, Burak Boyaci [et al.]....................... 18 Dynamic Multimodal Freight Routing using a Co-Simulation Optimization Ap- proach, Maged Dessouky [et al.]............................ 19 A Large Multiple-Neighborhood Search for Order Management in Attended Home Deliveries, Jarmo Haferkamp [et al.]......................... 20 Booking of loading/unloading areas, Andrea Mor [et al.].............. 21 An Enhanced Branch and Price Algorithm for the Time-Dependent Vehicle Rout- ing Problem with Time Windows, Gonzalo Lera Romero [et al.].......... 22 A Branch-and-Price Solution Approach for Electric Vehicle Routing Problems with Time Windows, Ece Naz Duman [et al.].................... 23 Optimizing Omni-Channel Fulfillment with Store Transfers, Joydeep Paul [et al.] 24 Approximate dynamic programming for multi-period taxi dispatching, Felix Goet- zinger [et al.]...................................... 25 1 The electric fleet transition problem, Samuel Pelletier [et al.]........... 26 Heuristic approach to solve a tandem truck-dron logistic delivery problem, Pedro L. Gonzalez-R [et al.].................................
    [Show full text]
  • Introduction to Optimization with Applications in Astronomy and Astrophysics
    Title : will be set by the publisher Editors : will be set by the publisher EAS Publications Series, Vol. ?, 2016 INTRODUCTION TO OPTIMIZATION WITH APPLICATIONS IN ASTRONOMY AND ASTROPHYSICS St´ephaneCanu1, R´emiFlamary2 and David Mary2 Abstract. This chapter aims at providing an introduction to numeri- cal optimization with some applications in astronomy and astrophysics. We provide important preliminary definitions that will guide the reader towards different optimization procedures. We discuss three families of optimization problems and describe numerical algorithms allowing, when this is possible, to solve these problems. For each family, we present in detail simple examples and more involved advanced exam- ples. As a final illustration, we focus on two worked-out examples of optimization applied to astronomical data. The first application is a supervised classification of RR-Lyrae stars. The second one is the de- noising of galactic spectra formulated by means of sparsity inducing models in a redundant dictionary. 1 Optimization in astronomy and astrophysics Optimization can be sketched as the art of finding a `best compromise'. This is a two-step art. The first step translates the problem, the desired objective and possibly some constraints into a mathematical form. The second step finds the best compromise that can be achieved within the framework defined by the first step. In Astrophysics, the information of interest can rarely be observed directly. A first reason for this is that raw data like time series or astronomical images (galaxies, nebulae, cosmological microwave background,...) are only exploitable once corrected for various distortions1 (foreground nuisances sources, atmospheric perturbations, limited resolution of the telescope, instrumental noise sources, etc.).
    [Show full text]