Search results for "SIMULATION"
showing 10 items of 5095 documents
Further experiences on unsteady seepage flow
1973
The present paper describes the results of a study on the unsteady flow in a horizontal homogeneous filter, which is accomplished when the level of the reservoir that recharges the filter is instantly drawn up. This study was carried out at the University of Palermo Institute of Hydraulics as a part of a research program concerning artificial recharge of ground water and the geotechnical problems involving the stability of porous media subject to the variations of surrounding pressures. A numerical procedure, aiming at solving the equation of Boussinesq by a finite difference method, was adopted and an electronic computer was used. A Hele-Shaw filter model was used to carry out several expe…
A branch-and-cut algorithm for the Orienteering Arc Routing Problem
2016
[EN] In arc routing problems, customers are located on arcs, and routes of minimum cost have to be identified. In the Orienteering Arc Routing Problem (OARP),in addition to a set of regular customers that have to be serviced, a set of potential customers is available. From this latter set, customers have to be chosen on the basis of an associated profit. The objective is to find a route servicing the customers which maximize the total profit collected while satisfying a given time limit on the route.In this paper, we describe large families of facet-inducing inequalities for the OARP and present a branch-and-cut algorithm for its solution. The exact algorithm embeds a procedure which builds…
Matheuristics for the irregular bin packing problem with free rotations
2017
[EN] We present a number of variants of a constructive algorithm able to solve a wide variety of variants of the Two-Dimensional Irregular Bin Packing Problem (2DIBPP). The aim of the 2DIBPP is to pack a set of irregular pieces, which may have concavities, into stock sheets (bins) with fixed dimensions in such a way that the utilization is maximized. This problem is inspired by a real application from a ceramic company in Spain. In addition, this problem arises in other industries such as the garment industry or ship building. The constructive procedure presented in this paper allows both free orientation for the pieces, as in the case of the ceramic industry, or a finite set of orientation…
Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems
2018
Abstract For the exact solution of many types of vehicle-routing problems, column-generation based algorithms have become predominant. The column-generation subproblems are then variants of the shortest-path problem with resource constraints which can be solved well with dynamic-programming labeling algorithms. For vehicle-routing problems with a pickup-and-delivery structure, the strongest known dominance between two labels requires the delivery triangle inequality (DTI) for reduced costs to hold. When the direction of labeling is altered from forward labeling to backward labeling, the DTI requirement becomes the pickup triangle inequality (PTI). DTI and PTI cannot be guaranteed at the sam…
Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem
2016
Abstract The Obnoxious p-Median problem consists in selecting a subset of p facilities from a given set of possible locations, in such a way that the sum of the distances between each customer and its nearest facility is maximized. The problem is NP -hard and can be formulated as an integer linear program. It was introduced in the 1990s, and a branch and cut method coupled with a tabu search has been recently proposed. In this paper, we propose a heuristic method – based on the Greedy Randomized Adaptive Search Procedure, GRASP, methodology – for finding approximate solutions to this optimization problem. In particular, we consider an advanced GRASP design in which a filtering mechanism avo…
On Mathematical Modelling of Metals Distribution in Peat Layers
2014
In this paper we consider averaging and finite difference methods for solving the 3-D boundary-value problem in multilayered domain. We consider the metals Fe and Ca concentration in the layered peat blocks. Using experimental data the mathematical model for calculation of concentration of metals in different points in peat layers is developed. A specific feature of these problems is that it is necessary to solve the 3-D boundary-value problems for elliptic type partial differential equations (PDEs) of second order with piece-wise diffusion coefficients in the layered domain. We develop here a finite-difference method for solving of a problem of one, two and three peat blocks with periodica…
One- and multi-locus multi-allele selection models in a random environment
1979
We deduce conditions for stochastic local stability of general perturbed linear stochastic difference equations widely applicable in population genetics. The findings are adapted to evaluate the stability properties of equilibria in classical one- and multi-locus multi-allele selection models influenced by random temporal variation in selection intensities. As an example of some conclusions and biological interpretations we analyse a special one-locus multi-allele model in more detail.
EXPERIMENTAL PROPAGATION FAILURE IN A NONLINEAR ELECTRICAL LATTICE
2004
We consider an experimental setup, modeling the FitzHugh–Nagumo equation without recovery term and composed of a nonlinear electrical network made up of discrete bistable cells, resistively coupled. In the first place, we study experimentally the propagation of topological fronts in the continuum limit where the analytical solution can be obtained. We show that experimental results match the theoretical predictions. The discrete case is then investigated theoretically and in the lattice, emphasizing the pinning of traveling waves.
The Multiple Multidimensional Knapsack with Family-Split Penalties
2021
Abstract The Multiple Multidimensional Knapsack Problem with Family-Split Penalties (MMdKFSP) is introduced as a new variant of both the more classical Multi-Knapsack and Multidimensional Knapsack Problems. It reckons with items categorized into families and where if an individual item is selected to maximize the profit, all the items of the same family must be selected as well. Items belonging to the same family can be assigned to different knapsacks; however, in this case, split penalties are incurred. This problem arises in resource management of distributed computing contexts and Service Oriented Architecture environments. An exact algorithm based on the exploitation of a specific combi…
A penalty-based finite element interface technology
2002
Abstract An effective and robust interface element technology able to connect independently modeled finite element subdomains is presented. This method has been developed using the penalty constraints and allows coupling of finite element models whose nodes do not coincide along their common interface. Additionally, the present formulation leads to a computational approach that is very efficient and completely compatible with existing commercial software. A significant effort has been directed toward identifying those model characteristics (element geometric properties, material properties and loads) that most strongly affect the required penalty parameter, and subsequently to developing si…