Experimental Investigation of TARMAX Model for Modeling of Hydrodynamic Forces on Cylinder-like Structures

A new approach that models lift and drag hydrodynamic force signals operating over cylindrical structures was developed and validated. This approach is based on stochastic auto regressive moving average with exogenous (ARMAX) input and its time-varying form, TARMAX. Model structure selection and parameter estimation were discussed while considering the validation stage. In this paper, the cylindrical structure was considered as a dynamic system with an incoming water wave and resulting forces as the input a...     

A multiobjective chance constrained programming model for supplier selection under uncertainty

Risk management is an inherent part of supplier selection. While companies are enjoying the benefits of outsourcing, risks brought by this practice should be taken into account in the process of decision making. This paper presents a multiobjective stochastic sequential supplier allocation model to help in supplier selection under uncertainty. Demand for products, capacities at suppliers as well as transportation and other variable costs are the main sources of uncertainty and are modeled using probability distributions. Disruptions are exogenous events and the model provides proactive mitigation strategies against disruptions by assigning backup suppliers who can be used in case of a default at a primary supplier. When there is no disruption, the model’s solution is an optimal supplier order assignment, considering operational risks.     

A frequency-based maritime container assignment model

This paper transfers the classic frequency-based transit assignment method of Spiess and Florian to containers demonstrating its promise as the basis for a global maritime container assignment model. In this model, containers are carried by shipping lines operating strings (or port rotations) with given service frequencies. An origin–destination matrix of full containers is assigned to these strings to minimize sailing time plus container dwell time at the origin port and any intermediate transhipment ports. This necessitated two significant model extensions. The first involves the repositioning of empty containers so that a net outflow of full containers from any port is balanced by a net inflow of empty containers, and vice versa. As with full containers, empty containers are repositioned to minimize the sum of sailing and dwell time, with a facility to discount the dwell time of empty containers in recognition of the absence of inventory. The second involves the inclusion of an upper limit to the maximum number of container moves per unit time at any port. The dual variable for this constraint provides a shadow price, or surcharge, for loading or unloading a container at a congested port. Insight into the interpretation of the dual variables is given by proposition and proof. Model behaviour is illustrated by a simple numerical example. The paper concludes by considering the next steps toward realising a container assignment model that can, amongst other things, support the assessment of supply chain vulnerability to maritime disruptions.     

A single-period analysis of a two-echelon inventory system with dependent supply uncertainty

Disruptions and random supplies have been important sources of uncertainty that should be considered in the design and control of supply chains. There have been many real world examples in which a single catastrophic event has simultaneously degraded the capabilities of several suppliers leading to considerable erosion of profits and goodwill for a company. However, the literature on analytical models that account for the dependence nature of disruptions and its impact on supply chain performance is sparse.In this paper, we consider an m-manufacturer, 1-retailer, newsvendor inventory system with stochastically dependent manufacturing capacities, caused by random disruptions that may simultaneously inflict damages to the capacities of the manufacturers. We develop the structural/analytical properties of key performance measures and optimal inventory policies for the multi-source and assembly inventory systems. We show that stochastic dependence in disruptions can have opposite effects on system performance in the multi-source and assembly systems. While risk diversification is preferred in the multi-source system, risk concentration is preferred in the assembly system. Our results also suggest that, if the retailer ignores the effect of dependent disruptions, then in the multi-source structure, it would underestimate the cost, overestimate the fill rate, and order more units than the optimum; however, in the assembly structure, the opposite would happen. We perform a comprehensive numerical study to validate our analytical results and generate useful managerial and operational insights for effective risk management of supply chains in the presence of dependent supply uncertainty.     

Competition and disruption in a dynamic urban supply chain

Rapid changes and complexities in business environments have stressed the importance of interactions between partners and competitors, leading supply chains to become the most important element of contemporary business environments. There is a concomitant need for foresight in describing supply chain performance in all operating environments, including those involving punctuated disruptions. Furthermore, the urban metropolis is now widely recognized to be an environment which is especially vulnerable to supply chain disruptions and for which integrated supply chain decisions can produce very substantial net benefits. Accordingly, this paper presents a dynamic supply chain network model formulated as a differential variational inequality; the model is fashioned to allow consideration of supply chain disruption threats to producers, freight carriers, and retail enterprises. The DVI is solved using a fixed-point algorithm, and a simple numerical example, introduced to illustrate how the impacts of supply chain disruptions may be quantified, is presented.     

Congestion tolling in the bottleneck model with heterogeneous values of time

When analysing the effects of transport policies it is important to adequately control for heterogeneity: previous studies note that ignoring heterogeneity biases the estimated welfare effects of tolling. This paper examines the effects of tolling, in a bottleneck model, with a continuously distributed value of time. With homogeneous users, first-best public tolling has no effect on prices. With heterogeneity it does: low values of time lose, and high values of time gain. The average congestion externality decreases with the heterogeneity in the value of time. Consequently, the welfare gain of first-best tolling also decreases. The more heterogeneous the value of time is, the lower the relative efficiency of a public pay-lane. This finding contrasts with the previous literature. Earlier studies, using static flow congestion, conclude that the relative efficiency increases with this type of heterogeneity. With more heterogeneity in the value of time, the relative efficiency of a private pay-lane is also lower, while that of a public time-invariant toll is higher. Our results suggest that the welfare gains of different tolling schemes are affected differently by heterogeneity. Further, the impact of heterogeneity on the effects of a policy also depends on the type of congestion considered.     

Approximate network loading and dual-time-scale dynamic user equilibrium

In this paper we present a dual-time-scale formulation of dynamic user equilibrium (DUE) with demand evolution. Our formulation belongs to the problem class that Pang and Stewart (2008) refer to as differential variational inequalities. It combines the within-day time scale for which route and departure time choices fluctuate in continuous time with the day-to-day time scale for which demand evolves in discrete time steps. Our formulation is consistent with the often told story that drivers adjust their travel demands at the end of every day based on their congestion experience during one or more previous days. We show that analysis of the within-day assignment model is tremendously simplified by expressing dynamic user equilibrium as a differential variational inequality. We also show there is a class of day-to-day demand growth models that allow the dual-time-scale formulation to be decomposed by time-stepping to yield a sequence of continuous time, single-day, dynamic user equilibrium problems. To solve the single-day DUE problems arising during time-stepping, it is necessary to repeatedly solve a dynamic network loading problem. We observe that the network loading phase of DUE computation generally constitutes a differential algebraic equation (DAE) system, and we show that the DAE system for network loading based on the link delay model (LDM) of Friesz et al. (1993) may be approximated by a system of ordinary differential equations (ODEs). That system of ODEs, as we demonstrate, may be efficiently solved using traditional numerical methods for such problems. To compute an actual dynamic user equilibrium, we introduce a continuous time fixed-point algorithm and prove its convergence for effective path delay operators that allow a limited type of nonmonotone path delay. We show that our DUE algorithm is compatible with network loading based on the LDM and the cell transmission model (CTM) due to Daganzo (1995). We provide a numerical example based on the much studied Sioux Falls network.     

A generic class of first order node models for dynamic macroscopic simulation of traffic flows

Node models for macroscopic simulation have attracted relatively little attention in the literature. Nevertheless, in dynamic network loading (DNL) models for congested road networks, node models are as important as the extensively studied link models. This paper provides an overview of macroscopic node models found in the literature, explaining both their contributions and shortcomings. A formulation defining a generic class of first order macroscopic node models is presented, satisfying a list of requirements necessary to produce node models with realistic, consistent results. Defining a specific node model instance of this class requires the specification of a supply constraint interaction rule and (optionally) node supply constraints. Following this theoretical discussion, specific macroscopic node model instances for unsignalized and signalized intersections are proposed. These models apply an oriented capacity proportional distribution of the available supply over the incoming links of a node. A computationally efficient algorithm to solve the node models exactly is included.     

Schedule-based transit assignment model with vehicle capacity and seat availability

In this paper, we propose a new schedule-based equilibrium transit assignment model that differentiates the discomfort level experienced by sitting and standing passengers. The notion of seat allocation has not been considered explicitly and analytically in previous schedule-based frameworks. The model assumes that passengers use strategies when traveling from their origin to their destination. When loading a vehicle, standing on-board passengers continuing to the next station have priority to get available seats and waiting passengers are loaded on a First-Come-First-Serve (FCFS) principle. The stimulus of a standing passenger to sit increases with his/her remaining journey length and time already spent on-board. When a vehicle is full, passengers unable to board must wait for the next vehicle to arrive. The equilibrium conditions can be stated as a variational inequality involving a vector-valued function of expected strategy costs. To find a solution, we adopt the method of successive averages (MSA) that generates strategies during each iteration by solving a dynamic program. Numerical results are also reported to show the effects of our model on the travel strategies and departure time choices of passengers.