41,775 research outputs found

    Constructing Sobol' sequences with better two-dimensional projections

    No full text
    Direction numbers for generating Sobol' sequences that satisfy the so-called Property A in up to 1111 dimensions have previously been given in Joe and Kuo [ACM Trans. Math. Software, 29 (2003), pp. 49–57]. However, these Sobol' sequences may have poor two-dimensional projections. Here we provide a new set of direction numbers alleviating this problem. These are obtained by treating Sobol' sequences in d dimensions as (t, d)-sequences and then optimizing the t-values of the two-dimensional projections. Our target dimension is 21201

    Misuse of Kuo–Eliassen equation in studies of the climatological mean meridional circulation

    No full text
    The Kuo–Eliassen equation provides the mean meridional circulation that must be present for the axisymmetric component of a flow forced by heat and momentum sources to remain balanced as it evolves. It does not tell us whether or not the flow is steady. Using this equation to explain how the mean meridional circulation is perturbed due to a change in thermal or momentum forcing, including the forcing due to large-scale eddies, requires a division of the forcing into prescribed and reactive parts and, most importantly, a physical theory for the latter. It should not be used without explicit discussion of the assumptions being made about the reactive component of the forcing and justification for the choice being made.National Science Foundation (NSF)Depto. de Física de la Tierra y AstrofísicaFac. de Ciencias FísicasTRUEpu

    Multi-compartment waste collection vehicle routing problem with bin washer

    Get PDF
    This paper introduces a new variant of the Multi-Compartment Waste Collection Problem (MCWCP), which we call the MC-WCP with Bin Washer (MC-WCP-BW). The problem involves a fleet of compressed refuse collection trucks equipped with a bin washer, which compresses each waste type in the corresponding compartment of the vehicle. The vehicles can also wash the bins. Separation sites and water refilling stations are considered in the problem. A subset of the bins must be washed when emptied, which is not mandatory for the others. The problem is modeled using a mixed-integer linear programming formulation incorporating multiple visits to separation sites and water refilling stations. An efficient Hybrid Variable Neighborhood Search (HVNS) algorithm is developed and evaluated on a set of instances from the literature and newly generated instances. Computational experiments show that our proposed algorithm can identify solutions of better quality in a shorter computational time, as compared with the current state-of-the-art algorithms. The potential benefits of the compaction operation under several scenarios are also examined via extensive analyses
    corecore