Search results for "routing"
showing 10 items of 587 documents
Comparative Analyses between the Zero-Inertia and Fully Dynamic Models of the Shallow Water Equations for Unsteady Overland Flow Propagation
2018
The shallow water equations are a mathematical tool widely applied for the simulation of flow routing in rivers and floodplains, as well as for flood inundation mapping. The interest of many researchers has been focused on the study of simplified forms of the original set of equations. One of the most commonly applied simplifications consists of neglecting the inertial terms. The effects of such a choice on the outputs of the simulations of flooding events are controversial and are an important topic of debate. In the present paper, two numerical models recently proposed for the solution of the complete and zero-inertia forms of the shallow water equations, are applied to several unsteady f…
On automatic algorithm configuration of vehicle routing problem solvers
2019
Many of the algorithms for solving vehicle routing problems expose parameters that strongly influence the quality of obtained solutions and the performance of the algorithm. Finding good values for these parameters is a tedious task that requires experimentation and experience. Therefore, methods that automate the process of algorithm configuration have received growing attention. In this paper, we present a comprehensive study to critically evaluate and compare the capabilities and suitability of seven state-of-the-art methods in configuring vehicle routing metaheuristics. The configuration target is the solution quality of eight metaheuristics solving two vehicle routing problem variants.…
Convergence Analysis of Extended Kalman Filter for Sensorless Control of Induction Motor
2015
This paper deals with convergence analysis of the extended Kalman filters (EKFs) for sensorless motion control systems with induction motor (IM). An EKF is tuned according to a six-order discrete-time model of the IM, affected by system and measurement noises, obtained by applying a first-order Euler discretization to a six-order continuous-time model. Some properties of the discrete-time model have been explored. Among these properties, the observability property is relevant, which leads to conditions that can be directly linked with the working conditions of the machine. Starting from these properties, the convergence of the stochastic state estimation process, in mean square sense, has b…
Time-Dependent Multiple Depot Vehicle Routing Problem on Megapolis Network under Wardrop's Traffic Flow Assignment
2018
In this work multiple depot vehicle routing problem is considered in case of variable travel times between nodes on a metropolis network. This variant of the classic multiple depot vehicle routing problem is motivated by the fact that in urban contexts variable traffic conditions play an essential role and can not be ignored in order to perform a realistic optimization. Time-travel matrices corresponding to each period of planning horizon were formed by solving the traffic assignment problem in conjunction with shortest path problem. Routing problem instances include from 20 to 100 customers randomly chosen from a road network of Saint-Petersburg. The results demonstrate that taking into ac…
Analysis of the Effects of Reservoir Operating Scenarios on Downstream Flood Damage Risk Using an Integrated Monte Carlo Modelling Approach
2023
The aim of this study is to analyse the effects of reservoir operating scenarios, for flood damage evaluation downstream of a dam, using a Monte Carlo bivariate modelling chain. The proposed methodology involves a stochastic procedure to calculate flood hydrographs and the evaluation of the consequent flood inundation area by applying a 2D hydraulic model. These results are used to estimate the inundation risk and, as consequence, the relative damage evaluation under different water level conditions in an upstream reservoir. The modelling chain can be summarized as follows: single synthetic stochastic rainfall event generation by using a Monte Carlo procedure through a bivariate copulas ana…
Towards CCTV-aware Routing and Navigation for Privacy, Anonymity, and Safety - Feasibility Study in Jyväskylä
2021
AbstractIn order to withstand the ever-increasing invasion of privacy by CCTV cameras and technologies, on par CCTV-aware solutions must exist that provide privacy, safety, and cybersecurity features. We argue that a first important step towards such CCTV-aware solutions must be a mapping system (e.g., Google Maps, OpenStreetMap) that provides both privacy and safety routing and navigation options. Unfortunately, to the best of our knowledge, there are no mapping nor navigation systems that support CCTV-privacy and CCTV-safety routing options. At the same time, in order to move the privacy vs. safety debate related to CCTV surveillance cameras from purely subjective to data-driven and evide…
Metaheuristics meet metamodels : a modeling language and a product line architecture for route optimization systems
2011
New Invariant Domain Preserving Finite Volume Schemes for Compressible Flows
2021
We present new invariant domain preserving finite volume schemes for the compressible Euler and Navier–Stokes–Fourier systems. The schemes are entropy stable and preserve positivity of density and internal energy. More importantly, their convergence towards a strong solution of the limit system has been proved rigorously in [9, 11]. We will demonstrate their accuracy and robustness on a series of numerical experiments.
Parallel Genetic Solution for Multiobjective MDO
1997
Publisher Summary This chapter reviews a multiobjective, multidisciplinary design optimization of two-dimensional airfoil designs. The control points on leading and trailing edges remain fixed, and the y-coordinates of the other control points are allowed to change during the optimization process. The grid for the Euler solver depends continuously and smoothly on the design parameters. The number of nodes and elements in the mesh might vary according to design because the meshes for the Helmholtz solver are done using the local fitting. The computations are made on an IBM SP2 parallel computer using high-performance switch and the MPICH message-passing library. As gradients are not required…
Exact extension of the DIRECT algorithm to multiple objectives
2019
The direct algorithm has been recognized as an efficient global optimization method which has few requirements of regularity and has proven to be globally convergent in general cases. direct has been an inspiration or has been used as a component for many multiobjective optimization algorithms. We propose an exact and as genuine as possible extension of the direct method for multiple objectives, providing a proof of global convergence (i.e., a guarantee that in an infinite time the algorithm becomes everywhere dense). We test the efficiency of the algorithm on a nonlinear and nonconvex vector function. peerReviewed