In this paper, we discuss a numerical approach for the simulation of a model for supply chains based on both ordinary and partial differential equations. Such a methodology foresees differential quadrature rules and a Picard-like recursion. In its former version, it was proposed for the solution of ordinary differential equations and is here extended to the case of partial differential equations. The outcome is a final non-recursive scheme, which uses matrices and vectors, with consequent advantages for the determination of the local error. A test case shows that traditional methods give worse approximations with respect to the proposed formulation
12 April 2012 in European Journal of Applied Mathematics
The aim of this work is to present a technique for the optimisation of emergency vehicles travel times on assigned paths when critical situations, such as car accidents, occur. Using a fluid-dynamic model for the description of car density evolution, the attention is focused on a decentralised approach reducing to simple junctions with two incoming roads and two outgoing ones (junctions of 2 × 2 type). We assume the redirection of cars at junctions is possible and choose a cost functional that describes the asymptotic average velocity of emergency vehicles. Fixing an incoming road and an outgoing road for the emergency vehicle, we determine the local distribution coefficients that maximise such functional at a single junction. Then we use the local optimal coefficients at each node of the network. The overall traffic evolution is studied via simulations, both for simple junctions or cascade networks, evaluating global performances when optimal parameters on the network are used.
A multi-server queueing system with two types of requests and preemptive priority of one type is considered as a model of a cell of a cognitive radio system under practical suggestions about the arrival flows. A hysteresis type strategy for server reservation is suggested to mitigate the effect of interruption of service of low priority requests. Under the arbitrarily fixed values of the sets of the thresholds defining this strategy, the behavior of the system is described by a level-dependent multi-dimensional Markov chain. Formulas for computation of values of performance characteristics of the system are derived. Numerical examples illustrating the dependence of the main performance characteristics on the thresholds defining the strategy of control and the numerical solution of the problem of the optimal choice of the thresholds are reported.
We deal with an algorithm that, once origin and destination are fixed, individuates the route that permits to reach the destination in the shortest time, respecting an assigned maximal travel time, and with risks measure below a given threshold. A fluid dynamic model for road networks, according to initial car densities on roads and traffic coefficients at junctions, forecasts the future traffic evolution, giving dynamical weights to a constrained 𝐾 shortest path algorithm. Simulations are performed on a case study to test the efficiency of the proposed procedure.