Search results for "GRAS"
showing 10 items of 727 documents
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…
Multi-start methods for combinatorial optimization
2013
Abstract Multi-start methods strategically sample the solution space of an optimization problem. The most successful of these methods have two phases that are alternated for a certain number of global iterations. The first phase generates a solution and the second seeks to improve the outcome. Each global iteration produces a solution that is typically a local optimum, and the best overall solution is the output of the algorithm. The interaction between the two phases creates a balance between search diversification (structural variation) and search intensification (improvement), to yield an effective means for generating high-quality solutions. This survey briefly sketches historical devel…
GRASP and path relinking for the max–min diversity problem
2010
The max-min diversity problem (MMDP) consists in selecting a subset of elements from a given set in such a way that the diversity among the selected elements is maximized. The problem is NP-hard and can be formulated as an integer linear program. Since the 1980s, several solution methods for this problem have been developed and applied to a variety of fields, particularly in the social and biological sciences. We propose a heuristic method-based on the GRASP and path relinking methodologies-for finding approximate solutions to this optimization problem. We explore different ways to hybridize GRASP and path relinking, including the recently proposed variant known as GRASP with evolutionary p…
Heuristics for the bandwidth colouring problem
2010
The bandwidth colouring problem consists of assigning a colour to each vertex of a graph, so that the absolute value of the difference between the colours of adjacent vertices is at least the value of the weight of the associated edge. This problem generalises the classical vertex colouring problem and different heuristics have recently been proposed to obtain high quality solutions. In this paper we describe both memory-based and memory-less methods to solve the bandwidth colouring problem. In particular we propose new constructive and improvement methods based on tabu search and GRASP. Comparison of our results with previously reported instances and existing heuristics indicate that the m…
A GRASP ALGORITHM FOR THE CONTAINER LOADING PROBLEM WITH MULTI-DROP CONSTRAINTS
2015
This paper studies a variant of the container loading problem in which to the classical geometric constraints of packing problems we add other conditions appearing in practical problems, the multi-drop constraints. When adding multi-drop constraints, we demand that the relevant boxes must be available, without rearranging others, when each drop-off point is reached. We present first a review of the different types of multi-drop constraints that appear in literature. Then we propose a GRASP algorithm that solves the different types of multi-drop constraints and also includes other types of realistic constraints such as full support of the boxes and load bearing strength. The computational re…
The varieties of bifocal Grassmann tensors
2022
AbstractGrassmann tensors arise from classical problems of scene reconstruction in computer vision. In particular, bifocal Grassmann tensors, related to a pair of projections from a projective space onto view spaces of varying dimensions, generalize the classical notion of fundamental matrices. In this paper, we study in full generality the variety of bifocal Grassmann tensors focusing on its birational geometry. To carry out this analysis, every object of multi-view geometry is described both from an algebraic and geometric point of view, e.g., the duality between the view spaces, and the space of rays is explicitly described via polarity. Next, we deal with the moduli of bifocal Grassmann…
On globally generated vector bundles on projective spaces
2009
AbstractA classification is given for globally generated vector bundles E of rank k on Pn having first Chern class c1(E)=2. In particular, we get that they split if k<n unless E is a twisted null-correlation bundle on P3. In view of the well-known correspondence between globally generated vector bundles and maps to Grassmannians, we obtain, as a corollary, a classification of double Veronese embeddings of Pn into a Grassmannian G(k−1,N) of (k−1)-planes in PN.
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…
New insights into Early Celtic consumption practices: Organic residue analyses of local and imported pottery from Vix-Mont Lassois
2019
The rich Mediterranean imports found in Early Celtic princely sites (7th-5th cent. BC) in Southwestern Germany, Switzerland and Eastern France have long been the focus of archaeological and public interest. Consumption practices, particularly in the context of feasting, played a major role in Early Celtic life and imported ceramic vessels have consequently been interpreted as an attempt by the elite to imitate Mediterranean wine feasting. Here we present the first scientific study carried out to elucidate the use of Mediterranean imports in Early Celtic Central Europe and their local ceramic counterparts through organic residue analyses of 99 vessels from Vix-Mont Lassois, a key Early Celti…
The effect of Ruppia cirrhosa features on macroalgae and suspended matter in a Mediterranean shallow system
2006
Relationships among chemical–physical features, total gross suspended organic matter, coverage of the seagrass Ruppia cirrhosa and its associated algal community in eight ponds of a saltworks system of western Sicily (Mediterranean Sea) were investigated in spring and summer 2004. All biological features varied both at different levels of seagrass coverage and between seasons. A low algal diversity (46 taxa, 14.75 ± 1.41 on average) was highlighted; algal coverage and species richness showed to be negatively correlated. Ruppia cirrhosa coverage was negatively correlated with algal coverage, but positively correlated with species richness. Moreover, a significant correlation among R. cirrhos…