Search results for " rando"

Reactive GRASP for the strip-packing problem

2008

This paper presents a greedy randomized adaptive search procedure (GRASP) for the strip packing problem, which is the problem of placing a set of rectangular pieces into a strip of a given width and infinite height so as to minimize the required height. We investigate several strategies for the constructive and improvement phases and several choices for critical search parameters. We perform extensive computational experiments with well-known instances which have been previously reported, first to select the best alternatives and then to compare the efficiency of our algorithm with other procedures. The results show that the GRASP algorithm outperforms recently reported metaheuristics.

GRASP and path relinking for the matrix bandwidth minimization

2004

In this article we develop a greedy randomized adaptive search procedure (GRASP) for the problem of reducing the bandwidth of a matrix. This problem consists of finding a permutation of the rows and columns of a given matrix, which keeps the nonzero elements in a band that is as close as possible to the main diagonal. The proposed method may be coupled with a Path Relinking strategy to search for improved outcomes. Empirical results indicate that the proposed GRASP implementation compares favourably to classical heuristics. GRASP with Path Relinking is also found to be competitive with a recently published tabu search algorithm that is considered one of the best currently available for band…

Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization

2015

We propose several new hybrid heuristics for the differential dispersion problem, the best of which consists of a GRASP with sampled greedy construction with variable neighborhood search for local improvement. The heuristic maintains an elite set of high-quality solutions throughout the search. After a fixed number of GRASP iterations, exterior path relinking is applied between all pairs of elite set solutions and the best solution found is returned. Exterior path relinking, or path separation, a variant of the more common interior path relinking, is first applied in this paper. In interior path relinking, paths in the neighborhood solution space connecting good solutions are explored betwe…

Methods cooperation for multiresolution motion estimation

2002

For a medical application, we are interested in an estimation of optical flow on a patient's face, particularly around the eyes. Among the methods of optical flow estimation, gradient estimation and block matching are the main methods. However, the gradient-based approach can only be applied for small displacements (one or two pixels). Gener- ally, the process of block matching leads to good results only if the searching strategy is judiciously selected. Our approach is based on a Markov random field model, combined with an algorithm of block match- ing in a multiresolution scheme. The multiresolution approach allows de- tection of a large range of speeds. The large displacements are detect…

Using Fourier local magnitude in adaptive smoothness constraints in motion estimation

2007

Like many problems in image analysis, motion estimation is an ill-posed one, since the available data do not always sufficiently constrain the solution. It is therefore necessary to regularize the solution by imposing a smoothness constraint. One of the main difficulties while estimating motion is to preserve the discontinuities of the motion field. In this paper, we address this problem by integrating the motion magnitude information obtained by the Fourier analysis into the smoothness constraint, resulting in an adaptive smoothness. We describe how to achieve this with two different motion estimation approaches: the Horn and Schunck method and the Markov Random Field (MRF) modeling. The t…

Incremental bipartite drawing problem

2001

Abstract Layout strategies that strive to preserve perspective from earlier drawings are called incremental. In this paper we study the incremental arc crossing minimization problem for bipartite graphs. We develop a greedy randomized adaptive search procedure (GRASP) for this problem. We have also developed a branch-and-bound algorithm in order to compute the relative gap to the optimal solution of the GRASP approach. Computational experiments are performed with 450 graph instances to first study the effect of changes in grasp search parameters and then to test the efficiency of the proposed procedure. Scope and purpose Many information systems require graphs to be drawn so that these syst…

Randomized heuristics for the Capacitated Clustering Problem

2017

In this paper, we investigate the adaptation of the Greedy Randomized Adaptive Search Procedure (GRASP) and Iterated Greedy methodologies to the Capacitated Clustering Problem (CCP). In particular, we focus on the effect of the balance between randomization and greediness on the performance of these multi-start heuristic search methods when solving this NP-hard problem. The former is a memory-less approach that constructs independent solutions, while the latter is a memory-based method that constructs linked solutions, obtained by partially rebuilding previous ones. Both are based on the combination of greediness and randomization in the constructive process, and coupled with a subsequent l…

2022

This study quantifies the causal effect of birth weight on cardiovascular biomarkers in adulthood using the Cardiovascular Risk in Young Finns Study (YFS). We apply a multivariable Mendelian randomization (MVMR) method that provides a novel approach to improve inference in causal analysis based on a mediation framework. The results show that birth weight is linked to triglyceride levels (β = -0.294; 95% CI [-0.591, 0.003]) but not to low-density lipoprotein (LDL) cholesterol levels (β = 0.007; 95% CI [-0.168, 0.183]). The total effect of birth weight on triglyceride levels is partly offset by a mediation pathway linking birth weight to adult BMI (β = 0.111; 95% CI [-0.013, 0.234]). The nega…

Chemotherapy for advanced gastric cancer

2017

Background Gastric cancer is the fifth most common cancer worldwide. In "Western" countries, most people are either diagnosed at an advanced stage, or develop a relapse after surgery with curative intent. In people with advanced disease, significant benefits from targeted therapies are currently limited to HER-2 positive disease treated with trastuzumab, in combination with chemotherapy, in first-line. In second-line, ramucirumab, alone or in combination with paclitaxel, demonstrated significant survival benefits. Thus, systemic chemotherapy remains the mainstay of treatment for advanced gastric cancer. Uncertainty remains regarding the choice of the regimen. Objectives To assess the effica…

Riesz fractional integrals and complex fractional moments for the probabilistic characterization of random variables

2012

Abstract The aim of this paper is the probabilistic representation of the probability density function (PDF) or the characteristic function (CF) in terms of fractional moments of complex order. It is shown that such complex moments are related to Riesz and complementary Riesz integrals at the origin. By invoking the inverse Mellin transform theorem, the PDF or the CF is exactly evaluated in integral form in terms of complex fractional moments. Discretization leads to the conclusion that with few fractional moments the whole PDF or CF may be restored. Application to the pathological case of an α -stable random variable is discussed in detail, showing the impressive capability to characterize…