36,706 research outputs found
Facility layout problem: Bibliometric and benchmarking analysis
Facility layout problem is related to the location of departments in a facility area, with the aim of determining the most effective configuration. Researches based on different approaches have been published in the last six decades and, to prove the effectiveness of the results obtained, several instances have been developed. This paper presents a general overview on the extant literature on facility layout problems in order to identify the main research trends and propose future research questions. Firstly, in order to give the reader an overview of the literature, a bibliometric analysis is presented. Then, a clusterization of the papers referred to the main instances reported in literature was carried out in order to create a database that can be a useful tool in the benchmarking procedure for researchers that would approach this kind of problems
Tabu Search for the Single Row Facility Layout Problem in FMS using a 3-opt Neighborhood
Since material handling agents in a FMS are most efficient when moving in straight lines, a common layout of machines in a FMS is a single row layout. This allows a floor designer to model the problem of generating an optimal machine layout in a FMS as a single row facility layout problem (SRFLP). Due to the computational complexity involved in solving the SRFLP, researchers have developed several heuristics to solve large instances of the problem. In this paper, we present a tabu search implementation based on a 3-opt neighborhood search scheme. We also present a technique to speed up the exhaustive 3-opt neighborhood search process significantly. Our computational experiments show that speed up of the 3-opt search is effective, and our tabu search implementation is competitive. The results we present here are better than the currently known best layouts for several large sized benchmark SRFLP instances, and competitive for other benchmark instances.
The single row layout problem with clearances
The single row layout problem (SRLP) is a specially structured instance of the classical facility layout problem, especially used in flexible manufacturing systems. The SRLP consists of finding the most efficient arrangement of a given number of machines along one side of the material handling path with the purpose of minimising the total weighted sum of distances among all machine pairs. To reflect real manufacturing situations, a minimum space (so-called clearances) between machines may be required by observing technological constraints, safety considerations and regulations. This thesis intends to outline the different concepts of clearances used in literature and analyse their effects on modelling and solution approaches for the SRLP. In particular the special characteristics of sequence-dependent, asymmetric clearances are discussed and finally extended to large size clearances (machine-spanning clearances). For this, adjusted and novel model formulations and solution approaches are presented. Furthermore, a comprehensive survey of articles published in this research area since 2000 is provided which identify recent developments and emerging trends in SRLP
Planning for sustainable development of energy infrastructure: fast – fast simulation tool
Energy management has significant impact on planning within local or regional scale. The consequences of the implementation of large-scale renewable energy source involves multifaceted analyses, evaluation of environmental impacts, and the assessment of the scale of limitations or exclusions imposed on potential urbanized structures and arable land. The process of site designation has to acknowledge environmental transformations by inclusion of several key issues, e.g. emissions, hazards for nature and/or inhabitants of urbanized zones, to name the most significant. The parameters of potential development of energy-related infrastructure of facility acquire its local properties – the generic development data require adjustment, which is site specific or area specific. FAST (Fast Simulation Tool) is a simple IT tool aimed at supporting sustainable planning on local or regional level in reference to regional or district scale energy management (among other issues). In its current stage, it is utilized – as a work in progress – in the assessment of wind farm structures located within the area of Poznan agglomeration. This paper discusses the implementation of FAST and its application in two conflicting areas around the agglomeration of Poznan
Communication-Avoiding Optimization Methods for Distributed Massive-Scale Sparse Inverse Covariance Estimation
Across a variety of scientific disciplines, sparse inverse covariance
estimation is a popular tool for capturing the underlying dependency
relationships in multivariate data. Unfortunately, most estimators are not
scalable enough to handle the sizes of modern high-dimensional data sets (often
on the order of terabytes), and assume Gaussian samples. To address these
deficiencies, we introduce HP-CONCORD, a highly scalable optimization method
for estimating a sparse inverse covariance matrix based on a regularized
pseudolikelihood framework, without assuming Gaussianity. Our parallel proximal
gradient method uses a novel communication-avoiding linear algebra algorithm
and runs across a multi-node cluster with up to 1k nodes (24k cores), achieving
parallel scalability on problems with up to ~819 billion parameters (1.28
million dimensions); even on a single node, HP-CONCORD demonstrates
scalability, outperforming a state-of-the-art method. We also use HP-CONCORD to
estimate the underlying dependency structure of the brain from fMRI data, and
use the result to identify functional regions automatically. The results show
good agreement with a clustering from the neuroscience literature.Comment: Main paper: 15 pages, appendix: 24 page
A facility to Search for Hidden Particles (SHiP) at the CERN SPS
A new general purpose fixed target facility is proposed at the CERN SPS
accelerator which is aimed at exploring the domain of hidden particles and make
measurements with tau neutrinos. Hidden particles are predicted by a large
number of models beyond the Standard Model. The high intensity of the SPS
400~GeV beam allows probing a wide variety of models containing light
long-lived exotic particles with masses below (10)~GeV/c,
including very weakly interacting low-energy SUSY states. The experimental
programme of the proposed facility is capable of being extended in the future,
e.g. to include direct searches for Dark Matter and Lepton Flavour Violation.Comment: Technical Proposa
Augmenting citation chain aggregation with article maps
Presentation slides available at: https://www.gesis.org/fileadmin/upload/kmir2014/paper4_slides.pdfThis paper presents Voyster, an experimental system that combines citation chain aggregation (CCA) and spatial-semantic maps to support citation search. CCA uses a three-list view to represent the citation network surrounding a ‘pearl’ of known relevant articles, whereby cited and citing articles are ranked according to number of pearl relations. As the pearl grows, this overlap score provides an effective proxy for relevance. However, when the pearl is small or multi-faceted overlap ranking provides poor discrimination. To address this problem we augment the lists with a visual map, wherein articles are organized according to their content similarity. We demonstrate how the article map can help the user to make relevant choices during the early stages of the search pro-cess and also provide useful insights into the thematic structure of the local citation network
An improved Ant Colony System for the Sequential Ordering Problem
It is not rare that the performance of one metaheuristic algorithm can be
improved by incorporating ideas taken from another. In this article we present
how Simulated Annealing (SA) can be used to improve the efficiency of the Ant
Colony System (ACS) and Enhanced ACS when solving the Sequential Ordering
Problem (SOP). Moreover, we show how the very same ideas can be applied to
improve the convergence of a dedicated local search, i.e. the SOP-3-exchange
algorithm. A statistical analysis of the proposed algorithms both in terms of
finding suitable parameter values and the quality of the generated solutions is
presented based on a series of computational experiments conducted on SOP
instances from the well-known TSPLIB and SOPLIB2006 repositories. The proposed
ACS-SA and EACS-SA algorithms often generate solutions of better quality than
the ACS and EACS, respectively. Moreover, the EACS-SA algorithm combined with
the proposed SOP-3-exchange-SA local search was able to find 10 new best
solutions for the SOP instances from the SOPLIB2006 repository, thus improving
the state-of-the-art results as known from the literature. Overall, the best
known or improved solutions were found in 41 out of 48 cases.Comment: 30 pages, 8 tables, 11 figure
- …