Robust And Online Large Scale Optimization

Scheduled transportation networks give rise to very complex and large-scale networkoptimization problems requiring innovative solution techniques and ideas from mathematical optimization and theoretical computer science. Examples of scheduled transportation include bus, ferry, airline, and railway networks, with the latter being a prime application domain that provides a fair amount of the most complex and largest instances of such optimization problems. Scheduled transport optimization deals with planning and scheduling problems over several time horizons, and substantial progress has been made for strategic planning and scheduling problems in all transportation domains. This state-of-the-art survey presents the outcome of an open call for contributions asking for either research papers or state-of-the-art survey articles. We received 24 submissions that underwent two rounds of the standard peer-review process, out of which 18 were finally accepted for publication. The volume is organized in four parts: Robustness and Recoverability, Robust Timetabling and Route Planning, Robust Planning Under Scarce Resources, and Online Planning: Delay and Disruption Management.

This book addresses the uncertainties of wind power modeled as interval numbers and assesses the physical modeling and methods for interval power flow, interval economic dispatch and interval robust economic dispatch. In particular, the optimization models are set up to address these topics and the state-of-the-art methods are employed to efficiently solve the proposed models. Several standard IEEE test systems as well as real-world large-scale Polish power systems have been tested to verify the effectiveness of the proposed models and methods. These methods can be further applied to other research fields that are involved with uncertainty.

Die effiziente und nachhaltige Ausgestaltung der rettungsdienstlichen Infrastruktur zur Sicherstellung einer hohen kommunalen Versorgungsqualität stellt eine komplexe Planungsaufgabe dar. Insbesondere Fragestellungen der Standortplanung für Rettungswachen und Rettungsmittel (z.B. RTWs) sind in einem dynamischen und durch Unsicherheit geprägten Umfeld für die rechtzeitige Versorgung in Notfallsituationen von entscheidender Bedeutung. In dieser Arbeit werden innovative Optimierungsmodelle vorgestellt, die einerseits optimale Standortentscheidung für Rettungsmittel auf einer taktischen Ebene unter Berücksichtigung dynamischer Umwelteinflüsse und unsicherer Nachfrage bestimmen. Andererseits wird die strategische Systemanpassung und Weiterentwicklung einer rettungsdienstlichen Infrastruktur unter Berücksichtigung unsicherer zukünftiger Entwicklungen bestimmt. Hierzu wird auf Methoden des Operations Research und insbesondere der robusten Optimierung zurückgegriffen. Die vorgestellten Modelle erlauben die Analyse komplexer Entscheidungssituationen sowie die Bestimmung optimaler Handlungsalternativen. Hierdurch wird eine effektive Entscheidungsunterstützung zur Planung der kommunalen Notfallversorgung gegeben.

Nature-inspired algorithms have a great popularity in the current scientific community, being the focused scope of many research contributions in the literature year by year. The rationale behind the acquired momentum by this broad family of methods lies on their outstanding performance evinced in hundreds of research fields and problem instances. This book gravitates on the development of nature-inspired methods and their application to stochastic, dynamic and robust optimization. Topics covered by this book include the design and development of evolutionary algorithms, bio-inspired metaheuristics, or memetic methods, with empirical, innovative findings when used in different subfields of mathematical optimization, such as stochastic, dynamic, multimodal and robust optimization, as well as noisy optimization and dynamic and constraint satisfaction problems.

This book promotes the use of mathematical optimization and operations research methods in rail transportation. The editors assembled thirteen contributions from leading scholars to present a unified voice, standardize terminology, and assess the state-of-the-art. There are three main clusters of articles, corresponding to the classical stages of the planning process: strategic, tactical, and operational. These three clusters are further subdivided into five parts which correspond to the main phases of the railway network planning process: network assessment, capacity planning, timetabling, resource planning, and operational planning. Individual chapters cover: Simulation Capacity Assessment Network Design Train Routing Robust Timetabling Event Scheduling Track Allocation Blocking Shunting Rolling Stock Crew Scheduling Dispatching Delay Propagation

This book provides a broad coverage of the recent advances in robustness analysis in decision aiding, optimization, and analytics. It offers a comprehensive illustration of the challenges that robustness raises in different operations research and management science (OR/MS) contexts and the methodologies proposed from multiple perspectives. Aside from covering recent methodological developments, this volume also features applications of robust techniques in engineering and management, thus illustrating the robustness issues raised in real-world problems and their resolution within advances in OR/MS methodologies. Robustness analysis seeks to address issues by promoting solutions, which are acceptable under a wide set of hypotheses, assumptions and estimates. In OR/MS, robustness has been mostly viewed in the context of optimization under uncertainty. Several scholars, however, have emphasized the multiple facets of robustness analysis in a broader OR/MS perspective that goes beyond the traditional framework, seeking to cover the decision support nature of OR/MS methodologies as well. As new challenges emerge in a “big-data'” era, where the information volume, speed of flow, and complexity increase rapidly, and analytics play a fundamental role for strategic and operational decision-making at a global level, robustness issues such as the ones covered in this book become more relevant than ever for providing sound decision support through more powerful analytic tools.

This book constitutes the proceedings of the 18th Annual European Symposium on Algorithms, held in Liverpool, UK in September 2010.

This book constitutes the thoroughly refereed post-proceedings of the 9th International Workshop on Approximation and Online Algorithms, WAOA 2011, held in Saarbrücken, Germany, in September 2011. The 21 papers presented were carefully reviewed and selected from 48 submissions. The volume also contains an extended abstract of the invited talk of Prof. Klaus Jansen. The Workshop on Approximation and Online Algorithms focuses on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications in a wide variety of fields. Topics of interest for WAOA 2011 were: algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, parameterized complexity, randomization techniques and scheduling problems.