Search results for "Mathematica"
showing 10 items of 7971 documents
A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems
2002
In this paper we develop and compare several heuristic methods for solving the general two-dimensional cutting stock problem. We follow the Gilmore-Gomory column generation scheme in which at each iteration a new cutting pattern is obtained as the solution of a subproblem on one stock sheet. For solving this subproblem, in addition to classical dynamic programming, we have developed three heuristic procedures of increasing complexity, based on GRASP and Tabu Search techniques, producing solutions differing in quality and in time requirements. In order to obtain integer solutions from the fractional solutions of the Gilmore-Gomory process, we compare three rounding procedures, rounding up, t…
In-Depth Analysis of Pricing Problem Relaxations for the Capacitated Arc-Routing Problem
2015
Recently, Bode and Irnich [Bode C, Irnich S (2012) Cut-first branch-and-price-second for the capacitated arc-routing problem. Oper. Res. 60(5):1167–1182] presented a cut-first branch-and-price-second algorithm for solving the capacitated arc-routing problem (CARP). The fundamental difference to other approaches for exactly solving the CARP is that the entire algorithm works directly on the typically sparse underlying graph representing the street network. This enables the use of highly efficient dynamic programming-based pricing algorithms to solve the column-generation subproblem also known as the pricing problem. The contribution of this paper is the in-depth analysis of the CARP pricing…
The Capacitated Arc Routing Problem: Lower bounds
1992
In this paper, we consider the Capacitated Arc Routing Problem (CARP), in which a fleet of vehicles, based on a specified vertex (the depot) and with a known capacity Q, must service a subset of the edges of a graph, with minimum total cost and such that the load assigned to each vehicle does not exceed its capacity. New lower bounds are developed for this problem, producing at least as good results as the already existing ones. Three of the proposed lower bounds are obtained from the resolution of a minimum cost perfect matching problem. The fourth one takes into account the vehicle capacity and is computed using a dynamic programming algorithm. Computational results, in which these bounds…
Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem
2015
A dynamic time window relates to two operations that must be executed within a given time meaning that the difference between the points in time when the two operations are performed is bounded from above. The most prevalent context of dynamic time windows is when precedence is given for the two operations so that it is a priori specified that one operation must take place before the other. A prominent vehicle routing problem with dynamic time windows and precedence is the dial-a-ride problem (DARP), where user-specified transportation requests from origin to destination points must be serviced. The paper presents a new branch-and-cut-and-price solution approach for the DARP, the prototypi…
Trading off accuracy for efficiency by randomized greedy warping
2016
Dynamic Time Warping (DTW) is a widely used distance measure for time series data mining. Its quadratic complexity requires the application of various techniques (e.g. warping constraints, lower-bounds) for deployment in real-time scenarios. In this paper we propose a randomized greedy warping algorithm for finding similarity between time series instances. We show that the proposed algorithm outperforms the simple greedy approach and also provides very good time series similarity approximation consistently, as compared to DTW. We show that the Randomized Time Warping (RTW) can be used in place of DTW as a fast similarity approximation technique by trading some classification accuracy for ve…
Application of a non linear local analysis method for the problem of mixed convection instability
2007
Abstract We consider the problem of laminar mixed convection flow between parallel, vertical and uniformly heated plates where the governing dimensionless parameters are the Prandtl, Rayleigh and Reynolds numbers. Using the method based on the centre manifold theorem which was derived from the general theory of dynamical systems, we reduce a three-dimensional simplified model of ordinary differential amplitude equations emanating from the original Navier-Stokes system of the problem in the vicinity of a trivial stationary solution. We have found that when the forcing parameter, the Rayleigh number, increases beyond the critical value Ra s , the stationary solution is a pitchfork bifurcation…
ATTRACTORS FOR A LATTICE DYNAMICAL SYSTEM GENERATED BY NON-NEWTONIAN FLUIDS MODELING SUSPENSIONS
2010
In this paper we consider a lattice dynamical system generated by a parabolic equation modeling suspension flows. We prove the existence of a global compact connected attractor for this system and the upper semicontinuity of this attractor with respect to finite-dimensional approximations. Also, we obtain a sequence of approximating discrete dynamical systems by the implementation of the implicit Euler method, proving the existence and the upper semicontinuous convergence of their global attractors.
Attractors of stochastic lattice dynamical systems with a multiplicative noise and non-Lipschitz nonlinearities
2012
AbstractIn this paper we study the asymptotic behavior of solutions of a first-order stochastic lattice dynamical system with a multiplicative noise.We do not assume any Lipschitz condition on the nonlinear term, just a continuity assumption together with growth and dissipative conditions, so that uniqueness of the Cauchy problem fails to be true.Using the theory of multi-valued random dynamical systems we prove the existence of a random compact global attractor.
A wavelet-based tool for studying non-periodicity
2010
This paper presents a new numerical approach to the study of non-periodicity in signals, which can complement the maximal Lyapunov exponent method for determining chaos transitions of a given dynamical system. The proposed technique is based on the continuous wavelet transform and the wavelet multiresolution analysis. A new parameter, the \textit{scale index}, is introduced and interpreted as a measure of the degree of the signal's non-periodicity. This methodology is successfully applied to three classical dynamical systems: the Bonhoeffer-van der Pol oscillator, the logistic map, and the Henon map.
Analytical properties of horizontal visibility graphs in the Feigenbaum scenario
2012
Time series are proficiently converted into graphs via the horizontal visibility (HV) algorithm, which prompts interest in its capability for capturing the nature of different classes of series in a network context. We have recently shown [1] that dynamical systems can be studied from a novel perspective via the use of this method. Specifically, the period-doubling and band-splitting attractor cascades that characterize unimodal maps transform into families of graphs that turn out to be independent of map nonlinearity or other particulars. Here we provide an in depth description of the HV treatment of the Feigenbaum scenario, together with analytical derivations that relate to the degree di…