Search results for "GRASP"

A GRASP algorithm for the container stowage slot planning problem

2016

This work presents a generalization of the Slot Planning Problem which raises when the liner shipping industry needs to plan the placement of containers within a vessel (stowage planning). State-of-the-art stowage planning relies on a heuristic decomposition where containers are first distributed in clusters along the vessel. For each of those clusters a specific position for each container must be found. Compared to previous studies, we have introduced two new features: the explicit handling of rolled out containers and the inclusion of separations rules for dangerous cargo. We present a novel integer programming formulation and a Greedy Randomized Adaptive Search Procedure (GRASP) to solv…

Special issue of Computers and Operations Research: GRASP with Path Relinking: Developments and applications

2013

Grip Force Adjustments Reflect Prediction of Dynamic Consequences in Varying Gravitoinertial Fields

2018

International audience; Humans have a remarkable ability to adjust the way they manipulate tools through a genuine regulation of grip force according to the task. However, rapid changes in the dynamical context may challenge this skill, as shown in many experimental approaches. Most experiments adopt perturbation paradigms that affect only one sensory modality. We hypothesize that very fast adaptation can occur if coherent information from multiple sensory modalities is provided to the central nervous system. Here, we test whether participants can switch between different and never experienced dynamical environments induced by centrifugation of the body. Seven participants lifted an object …

Arc crossing minimization in graphs with GRASP

2001

Graphs are commonly used to represent information in many fields of science and engineering. Automatic drawing tools generate comprehensible graphs from data, taking into account a variety of properties, enabling users to see important relationships in the data. The goal of limiting the number of arc crossings is a well-admitted criterion for a good drawing. In this paper, we present a Greedy Randomized Adaptive Search Procedure (GRASP) for the problem of minimizing arc crossings in graphs. Computational experiments with 200 graphs with up to 350 vertices are presented to assess the merit of the method. We show that simple heuristics are very fast but result in inferior solutions, while hig…

Recognising a hand by grasp.

2000

The present study aimed to demonstrate that motor representations are used to recognise biological stimuli. In three experiments subjects were required to judge laterality of hands and forearms presented by pictures. The postures of the hands were those assumed when holding a small, medium and large sphere. In experiment 1, the sphere held in hand was presented, whereas in experiment 2 it was absent. In experiment 3, the same images, showing holding-a-sphere hands, as in experiment 1 were presented, but without forearm. In all experiments one finger of each hand could be absent. In experiment 1 recognition time was longer for those hand postures for which the corresponding grasping motor ac…

A GRASP heuristic for the mixed Chinese postman problem

2002

Abstract Arc routing problems (ARPs) consist of finding a traversal on a graph satisfying some conditions related to the links of the graph. In the Chinese postman problem (CPP) the aim is to find a minimum cost tour (closed walk) traversing all the links of the graph at least once. Both the Undirected CPP, where all the links are edges that can be traversed in both ways, and the Directed CPP, where all the links are arcs that must be traversed in a specified way, are known to be polynomially solvable. However, if we deal with a mixed graph (having edges and arcs), the problem turns out to be NP -hard. In this paper, we present a heuristic algorithm for this problem, the so-called Mixed CPP…

Las funciones interactivas del marcador español ‘¿no?’ Las fronteras entre la atenuación y la protección de la imagen

2020

In this paper the functions of the Spanish discourse marker ?no? are analysed from a pragmatic and an interactive perspective. Specifically, we explore the values of ?no? taking the pragmatic phenomena of mitigation and boosting, as well as the notion of affiliation as described in conversation analysis. The previous literature devoted to the study of this linguistic form has consistently identified its uses as a confirmation request or a phatic device (Fuentes, 1990, 2009; Santos Rio, 2003; Garcia Vizcaino, 2005; Montanez, 2008, 2015; Rodriguez Munoz, 2009; Moccero, 2010; Santana, 2017). This work, however, analyses how the mitigating uses interact and share features with neighbouring cate…

Rethinking of the Heuristic-Analytic Dual Process Theory: A Comment on Wada and Nittono (2004) and the Reasoning Process in the Wason Selection Task

2005

This paper raises some methodological problems in the dual process explanation provided by Wada and Nittono for their 2004 results using the Wason selection task. We maintain that the Nittono rethinking approach is weak and that it should be refined to grasp better the evidence of analytic processes.

Perceptual commensuration in decision tables

2017

This paper calls attention to design features that could enhance the helpfulness of the decision table to decision makers trying to get a better intuitive grasp of the choices facing them. The experiments reported here show that the grey scale is more facilitative than the number scale for problem comprehension as measured by the identification of dominance and the identification of non-additivity, each of which requires a view of the decision problem that is sensitive to patterns across attributes. Additional design features that could enhance the decision makers’ grasp of the choices facing them are suggested for further research.

A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems

2005

This paper presents a greedy randomized adaptive search procedure (GRASP) for the constrained two-dimensional non-guillotine cutting problem, the problem of cutting the rectangular pieces from a large rectangle so as to maximize the value of the pieces cut. 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 previously reported, first to select the best alternatives and then to compare the efficiency of our algorithm with other procedures.