We will review some of the major results in random graphs and some of the more challenging open problems. We will cover algorithmic and structural questions. We will touch on newer models, including those related to the WWW.

Random graphs

Praise for the Third Edition: "This is one of the best books available. Its excellent organizational structure allows quick reference to specific models and its clear presentation . . . solidifies the understanding of the concepts being presented."IIE Transactions on Operations EngineeringThoroughly revised and expanded to reflect the latest developments in the field, Fundamentals of Queueing Theory, Fourth Edition continues to present the basic statistical principles that are necessary to analyze the probabilistic nature of queues. Rather than presenting a narrow focus on the subject, this update illustrates the wide-reaching, fundamental concepts in queueing theory and its applications to diverse areas such as computer science, engineering, business, and operations research.This update takes a numerical approach to understanding and making probable estimations relating to queues, with a comprehensive outline of simple and more advanced queueing models. Newly featured topics of the Fourth Edition include:Retrial queuesApproximations for queueing networksNumerical inversion of transformsDetermining the appropriate number of servers to balance quality and cost of serviceEach chapter provides a self-contained presentation of key concepts and formulae, allowing readers to work with each section independently, while a summary table at the end of the book outlines the types of queues that have been discussed and their results. In addition, two new appendices have been added, discussing transforms and generating functions as well as the fundamentals of differential and difference equations. New examples are now included along with problems that incorporate QtsPlus software, which is freely available via the book's related Web site.With its accessible style and wealth of real-world examples, Fundamentals of Queueing Theory, Fourth Edition is an ideal book for courses on queueing theory at the upper-undergraduate and graduate levels. It is also a valuable resource for researchers and practitioners who analyze congestion in the fields of telecommunications, transportation, aviation, and management science.

Fundamentals of Queueing Theory

tions. Bootstrap has found many applications in engineering field, including artificial neural networks, biomedical engineering, environmental engineering, image processing, and radar and sonar signal processing. Basic concepts of the bootstrap are summarized in each section as a step-by-step algorithm for ease of implementation. Most of the applications are taken from the signal processing literature. The principles of the bootstrap are introduced in Chapter 2. Both the nonparametric and parametric bootstrap procedures are explained. Babu and Singh (1984) have demonstrated that in general, these two procedures behave similarly for pivotal (Studentized) statistics. The fact that the bootstrap is not the solution for all of the problems has been known to statistics community for a long time; however, this fact is rarely touched on in the manuscripts meant for practitioners. It was first observed by Babu (1984) that the bootstrap does not work in the infinite variance case. Bootstrap Techniques for Signal Processing explains the limitations of bootstrap method with an example. I especially liked the presentation style. The basic results are stated without proofs; however, the application of each result is presented as a simple step-by-step process, easy for nonstatisticians to follow. The bootstrap procedures, such as moving block bootstrap for dependent data, along with applications to autoregressive models and for estimation of power spectral density, are also presented in Chapter 2. Signal detection in the presence of noise is generally formulated as a testing of hypothesis problem. Chapter 3 introduces principles of bootstrap hypothesis testing. The topics are introduced with interesting real life examples. Flow charts, typical in engineering literature, are used to aid explanations of the bootstrap hypothesis testing procedures. The bootstrap leads to second-order correction due to pivoting; this improvement in the results due to pivoting is also explained. In the second part of Chapter 3, signal processing is treated as a regression problem. The performance of the bootstrap for matched filters as well as constant false-alarm rate matched filters is also illustrated. Chapters 2 and 3 focus on estimation problems. Chapter 4 introduces bootstrap methods used in model selection. Due to the inherent structure of the subject matter, this chapter may be difficult for nonstatisticians to follow. Chapter 5 is the most impressive chapter in the book, especially from the standpoint of statisticians. It provides real data bootstrap applications to illustrate the theory covered in the earlier chapters. These include applications to optimal sensor placement for knock detection and land-mine detection. The authors also provide a MATLAB toolbox comprising frequently used routines. Overall, this is a very useful handbook for engineers, especially those working in signal processing.

Probability and Random Processes

In the last four decades the container as an essential part of a unit-load-concept has achieved undoubted importance in international sea freight transportation. With ever increasing containerization the number of seaport container terminals and competition among them have become quite remarkable. Operations are nowadays unthinkable without effective and efficient use of information technology as well as appropriate optimization (operations research) methods. In this paper we describe and classify the main logistics processes and operations in container terminals and present a survey of methods for their optimization.

Container terminal operation and operations research — a classification and literature review

https://www.cirrelt.ca/DocumentsTravail/CIRRELT-2011-62.pdf

A review of dynamic vehicle routing problems

I Optimal Control for Ordinary Differential Equations.- Sensitivity Analysis and Real-Time Optimization of Parametric Nonlinear Programming Problems.- Sensitivity Analysis and Real-Time Control of Parametric Optimal Control Problems Using Boundary Value Methods.- Sensitivity Analysis and Real-Time Control of Parametric Optimal Control Problems Using Nonlinear Programming Methods.- Sensitivity Analysis and Real-Time Control of a Container Crane under State Constraints.- Real-Time Control of an Industrial Robot under Control and State Constraints.- Real-Time Optimal Control of Shape Memory Alloy Actuators in Smart Structures.- Real-Time Solutions for Perturbed Optimal Control Problems by a Mixed Open- and Closed-Loop Strategy.- Real-Time Optimization of DAE Systems.- Real-Time Solutions of Bang-Bang and Singular Optimal Control Problems.- Conflict Avoidance During Landing Approach Using Parallel Feedback Control.- II Optimal Control for Partial Differential Equations.- Optimal Control Problems with a First Order PDE System - Necessary and Sufficient Optimality Conditions.- Optimal Control Problems for the Nonlinear Heat Equation.- Fast Optimization Methods in the Selective Cooling of Steel.- Real-Time Optimization and Stabilization of Distributed Parameter Systems with Piezoelectric Elements.- Instantaneous Control of Vibrating String Networks.- Modelling, Stabilization, and Control of Flow in Networks of Open Channels.- Optimal Control of Distributed Systems with Break Points.- to Model Based Optimization of Chemical Processes on Moving Horizons.- Multiscale Concepts for Moving Horizon Optimization.- Real-Time Optimization for Large Scale Processes: Nonlinear Model Predictive Control of a High Purity Distillation Column.- Towards Nonlinear Model-Based Predictive Optimal Control of Large-Scale Process Models with Application to Air Separation Plants.- IV Delay Differential Equations in Medical Decision Support Systems.- Differential Equations with State-Dependent Delays.- Biomathematical Models with State-Dependent Delays for Granulocytopoiesis.- Stochastic Optimization for Operating Chemical Processes under Uncertainty.- A Multistage Stochastic Programming Approach in Real-Time Process Control.- Optimal Control of a Continuous Distillation Process under Probabilistic Constraints.- Adaptive Optimal Stochastic Trajectory Planning.- Stochastic Optimization Methods in Robust Adaptive Control of Robots.- Multistage Stochastic Integer Programs: An Introduction.- Decomposition Methods for Two-Stage Stochastic Integer Programs.- Modeling of Uncertainty for the Real-Time Management of Power Systems.- Online Scheduling of Multiproduct Batch Plants under Uncertainty.- VIII Combinatorial Online Planning in Transportation.- Combinatorial Online Optimization in Real Time.- Online Optimization of Complex Transportation Systems.- Stowage and Transport Optimization in Ship Planning.- IX Real-Time Annealing in Image Segmentation.- Basic Principles of Annealing for Large Scale Non-Linear Optimization.- Multiscale Annealing and Robustness: Fast Heuristics for Large Scale Non-linear Optimization.- Author Index.

/pdf/online-optimization-of-large-scale-systems-28jh67sa5z.pdf

Online optimization of large scale systems

We consider the frequency assignment (broadcast scheduling) problem for packet radio networks. Such networks are naturally modeled by graphs with a certain geometric structure. The problem of broadcast scheduling can be cast as a variant of the vertex coloring problem (called the distance-2 coloring problem) on the graph that models a given packet radio network. We present efficient approximation algorithms for the distance-2 coloring problem for various geometric graphs including those that naturally model a large class of packet radio networks. The class of graphs considered include (r, s)-civilized graphs, planar graphs, graphs with bounded genus, etc.

Models and approximation algorithms for channel assignment in radio networks

We consider the following online dial-a-ride problem (OLDARP): Objects are to be transported between points in a metric space. Transportation requests arrive online, specifying the objects to be transported and the corresponding source and destination. These requests are to be handled by a server which starts its work at a designated origin and which picks up and drops objects at their sources and destinations. The server can move at constant unit speed. After the end of its service the server returns to its start in the origin. The goal of OLDARP is to come up with a transportation schedule for the server which finishes as early as possible, i.e., which minimizes the makespan. We analyze several competitive algorithms for OLDARP and establish tight competitiveness results. The first two algorithms, REPLAN and IGNORE are very simple and natural: REPLAN completely discards its (preliminary) schedule and recomputes a new one when a new request arrives. IGNORE always runs a (locally optimal) schedule for a set of known requests and ignores all new requests until this schedule is completed. We show that both strategies, REPLAN and IGNORE, are 5/2-competitive. We then present a somewhat less natural strategy SMARTSTART, which in contrast to the other two strategies may leave the server idle from time to time although unserved requests are known. The SMARTSTART-algorithm has an improved competitive ratio of 2, which matches our lower bound.

Online dial-a-ride problems : Minimizing the completion time

On the minimum label spanning tree problem

We consider the following online dial-a-ride problem (OLDARP): Objects are to be transported between points in a metric space. Transportation requests arrive online, specifying the objects to be transported and the corresponding source and destination. These requests are to be handled by a server which starts its work at a designated origin and which picks up and drops objects at their sources and destinations. The server can move at constant unit speed. After the end of its service the server returns to its start in the origin. The goal of OLDARP is to come up with a transportation schedule for the server which finishes as early as possible, i.e., which minimizes the makespan.

We analyze several competitive algorithms for OLDARP and establish tight competitiveness results. The first two algorithms, REPLAN and IGNORE are very simple and natural: REPLAN completely discards its (preliminary) schedule and recomputes a new one when a new request arrives. IGNORE always runs a (locally optimal) schedule for a set of known requests and ignores all new requests until this schedule is completed. We show that both strategies, REPLAN and IGNORE, are 5/2-competitive. We then present a somewhat less natural strategy SMARTSTART, which in contrast to the other two strategies may leave the server idle from time to time although unserved requests are known. The SMARTSTART-algorithm has an improved competitive ratio of 2, which matches our lower bound.

Sven O. Krumke

Papers

Online optimization of large scale systems

Models and approximation algorithms for channel assignment in radio networks

Online dial-a-ride problems : Minimizing the completion time

On the minimum label spanning tree problem

Online Dial-a-Ride Problems: Minimizing the Completion Time