Search results for "HEURISTICS"
showing 10 items of 191 documents
Calibrating Expert Assessments Using Hierarchical Gaussian Process Models
2020
Expert assessments are routinely used to inform management and other decision making. However, often these assessments contain considerable biases and uncertainties for which reason they should be calibrated if possible. Moreover, coherently combining multiple expert assessments into one estimate poses a long-standing problem in statistics since modeling expert knowledge is often difficult. Here, we present a hierarchical Bayesian model for expert calibration in a task of estimating a continuous univariate parameter. The model allows experts' biases to vary as a function of the true value of the parameter and according to the expert's background. We follow the fully Bayesian approach (the s…
Towards a simulation-based tuning of motion cueing algorithms
2016
Abstract This paper deals with the problem of finding the best values for the parameters of Motion Cueing Algorithms (MCA). MCA are responsible for controlling the movements of robotic motion platforms used to generate the gravito-inertial cues of vehicle simulators. The values of their multiple parameters, or coefficients, are hard to establish and they dramatically change the behaviour of MCA. The problem has been traditionally addressed in a subjective, partially non-systematic, iterative, time-consuming way, by seeking pilot/driver feedback on the generated motion cues. The aim of this paper is to introduce a different approach to solve the problem of MCA tuning, by making use of a simu…
Metaheuristic procedures for the lexicographic bottleneck assembly line balancing problem
2015
The goal of this work is to develop an improved procedure for the solution of the lexicographic bottleneck variant of the assembly line balancing problem (LB-ALBP). The objective of the LB-ALBP is to minimize the workload of the most heavily loaded workstation, followed by the workload of the second most heavily loaded workstation and so on. This problem-recently introduced to the literature (Pastor, 2011)-has practical relevance to manufacturing facilities. We design, implement and fine-tune GRASP, tabu search (TS) and scatter search (SS) heuristics for the LB-ALBP and show that our procedures are able to obtain solutions of a quality that outperforms previous approaches. We rely on both s…
A decomposition approach to dual shuttle automated storage and retrieval systems
2016
[EN] Automated Storage and Retrieval Systems (AS/RS) have become vital in today¿s distribution and production environments, however it remains necessary to equip them with more efficient operational control policies. Motivated by real situations encountered by companies employing AS/RS, the present paper studies a miniload AS/RS system, with a dual shuttle crane in which a set of storage and retrieval requests must be scheduled such that the prioritized waiting time is minimized. Dual shuttle cranes have received minimal academic attention and thus continue to pose new problems that must be solved. The miniload AS/RS problem is addressed by decomposing it into a location assignment and sequ…
GRASP and tabu search for the generalized dispersion problem
2021
Abstract The problem of maximizing dispersion requires the selection of a specific number of elements from a given set, in such a way that the minimum distance between the pairs of selected elements is maximized. In recent years, this problem has received a lot of attention and has been solved with many complex heuristics. However, there is a recent variant in which the selected elements have to satisfy two realistic constraints, a minimum capacity limit and a maximum budget, which in spite of its practical significance in facility location, has received little attention. In this paper, we first propose mathematical models to obtain the optimal solution of small- and medium-size instances, …
Heuristics for the min–max arc crossing problem in graphs
2018
Abstract In this paper, we study the visualization of complex structures in the context of automatic graph drawing. Constructing geometric representations of combinatorial structures, such as networks or graphs, is a difficult task that requires an expert system. The automatic generation of drawings of graphs finds many applications from software engineering to social media. The objective of graph drawing expert systems is to generate layouts that are easy to read and understand. This main objective is achieved by solving several optimization problems. In this paper we focus on the most important one: reducing the number of arc crossings in the graph. This hard optimization problem has been…
Improving the performance of embedded systems with variable neighborhood search
2017
Graphical abstractDisplay Omitted Embedded systems have become an essential part of our lives, mainly due to the evolution of technology in the last years. However, the power consumption of these devices is one of their most important drawbacks. It has been proven that an efficient use of the memory of the device also improves its energy performance. This work efficiently solves the dynamic memory allocation problem, which can be formally defined as follows: given a program that has to be executed by a circuit, the objective is to fit that program in memory in such a way that the computing time required to execute it is minimized. In this work, we propose a parallel variable neighborhood se…
Impact of decision horizon on post-prognostics maintenance and missions scheduling: a railways case study
2021
International audience; In this paper, we propose a study of the decision horizon duration for rolling stock mission assignment and maintenance planning in a prognostics and health management (PHM) context. The aim is to determine the best decision horizon duration that allows the con- struction of a suitable schedule that assigns railway vehicles to missions and integrates required maintenance operations accord- ing to the current and future health of the vehicles. A genetic algorithm is used to minimize the overall cost of the joint schedule as a function of the decision horizon. The results are compared to three proposed heuristics to study the influence of the resolution method on the d…
Heuristics for the capacitated modular hub location problem
2017
Abstract In this paper we study the hub location problem, where the goal is to identify an optimal subset of facilities (hubs) to minimize the transportation cost while satisfying certain capacity constraints. In particular, we target the single assignment version, in which each node in the transportation network is assigned to only one hub to route its traffic. We consider here a realistic variant introduced previously, in which the capacity of edges between hubs is increased in a modular way. This reflects the practical situation in air traffic where the number of flights between two locations implies a capacity in terms of number of passengers. Then, the capacity can be increased in a mo…
Solving a large cutting problem in the glass manufacturing industry
2020
Abstract The glass cutting problem proposed by Saint Gobain for the 2018 ROADEF challenge includes some specific constraints that prevent the direct application of procedures developed for the standard cutting problem. On the one hand, the sheets to be cut have defects that make them unique and they must be used in a given order. On the other hand, pieces are grouped in stacks and the pieces in each stack must be cut in order. There are also some additional characteristics due to the technology being used, especially the requirement for a three-stage guillotine cutting process. Taking into account the sequencing constraints on sheets and pieces, we have developed a beam search algorithm, us…