19,967 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
An application of simulated annealing to the optimum design of reinforced concrete retaining structures
This paper reports on the application of a simulated annealing algorithm to the minimum cost design of reinforced concrete retaining structures. Cantilever retaining walls are investigated, being representative of reinforced concrete retaining structures that are required to resist a combination of earth and hydrostatic loading. To solve such a constrained optimisation problem, a modified simulated annealing algorithm is proposed that avoids the simple rejection of infeasible solutions and improves convergence to a minimum cost. The algorithm was implemented using an object-orientated visual programming language, offering facilities for continual monitoring, assessing and changing of the simulated annealing control parameters. Results show that the simulated annealing can be successfully applied to the minimum cost design of reinforced concrete retaining walls, overcoming the difficulties associated with the practical and realistic assessment of the structural costs and their complex inter-relationship with the imposed constraints on the solution space
State-of-the-art in aerodynamic shape optimisation methods
Aerodynamic optimisation has become an indispensable component for any aerodynamic design over the past 60 years, with applications to aircraft, cars, trains, bridges, wind turbines, internal pipe flows, and cavities, among others, and is thus relevant in many facets of technology. With advancements in computational power, automated design optimisation procedures have become more competent, however, there is an ambiguity and bias throughout the literature with regards to relative performance of optimisation architectures and employed algorithms. This paper provides a well-balanced critical review of the dominant optimisation approaches that have been integrated with aerodynamic theory for the purpose of shape optimisation. A total of 229 papers, published in more than 120 journals and conference proceedings, have been classified into 6 different optimisation algorithm approaches. The material cited includes some of the most well-established authors and publications in the field of aerodynamic optimisation. This paper aims to eliminate bias toward certain algorithms by analysing the limitations, drawbacks, and the benefits of the most utilised optimisation approaches. This review provides comprehensive but straightforward insight for non-specialists and reference detailing the current state for specialist practitioners
Performance optimization of a leagility inspired supply chain model: a CFGTSA algorithm based approach
Lean and agile principles have attracted considerable interest in the past few decades. Industrial sectors throughout the world are upgrading to these principles to enhance their performance, since they have been proven to be efficient in handling supply chains. However, the present market trend demands a more robust strategy incorporating the salient features of both lean and agile principles. Inspired by these, the leagility principle has emerged, encapsulating both lean and agile features. The present work proposes a leagile supply chain based model for manufacturing industries. The paper emphasizes the various aspects of leagile supply chain modeling and implementation and proposes a new Hybrid Chaos-based Fast Genetic Tabu Simulated Annealing (CFGTSA) algorithm to solve the complex scheduling problem prevailing in the leagile environment. The proposed CFGTSA algorithm is compared with the GA, SA, TS and Hybrid Tabu SA algorithms to demonstrate its efficacy in handling complex scheduling problems
The relevance of outsourcing and leagile strategies in performance optimization of an integrated process planning and scheduling
Over the past few years growing global competition has forced the manufacturing industries to upgrade their old production strategies with the modern day approaches. As a result, recent interest has been developed towards finding an appropriate policy that could enable them to compete with others, and facilitate them to emerge as a market winner. Keeping in mind the abovementioned facts, in this paper the authors have proposed an integrated process planning and scheduling model inheriting the salient features of outsourcing, and leagile principles to compete in the existing market scenario. The paper also proposes a model based on leagile principles, where the integrated planning management has been practiced. In the present work a scheduling problem has been considered and overall minimization of makespan has been aimed. The paper shows the relevance of both the strategies in performance enhancement of the industries, in terms of their reduced makespan. The authors have also proposed a new hybrid Enhanced Swift Converging Simulated Annealing (ESCSA) algorithm, to solve the complex real-time scheduling problems. The proposed algorithm inherits the prominent features of the Genetic Algorithm (GA), Simulated Annealing (SA), and the Fuzzy Logic Controller (FLC). The ESCSA algorithm reduces the makespan significantly in less computational time and number of iterations. The efficacy of the proposed algorithm has been shown by comparing the results with GA, SA, Tabu, and hybrid Tabu-SA optimization methods
Recommended from our members
Directed Placement for mVLSI Devices
Continuous-flow microfluidic devices based on integrated channel networks are becoming increasingly prevalent in research in the biological sciences. At present, these devices are physically laid out by hand by domain experts who understand both the underlying technology and the biological functions that will execute on fabricated devices. The lack of a design science that is specific to microfluidic technology creates a substantial barrier to entry. To address this concern, this article introduces Directed Placement, a physical design algorithm that leverages the natural "directedness" in most modern microfluidic designs: fluid enters at designated inputs, flows through a linear or tree-based network of channels and fluidic components, and exits the device at dedicated outputs. Directed placement creates physical layouts that share many principle similarities to those created by domain experts. Directed placement allows components to be placed closer to their neighbors compared to existing layout algorithms based on planar graph embedding or simulated annealing, leading to an average reduction in laid-out fluid channel length of 91% while improving area utilization by 8% on average. Directed placement is compatible with both passive and active microfluidic devices and is compatible with a variety of mainstream manufacturing technologies
Solving Set Cover with Pairs Problem using Quantum Annealing
Here we consider using quantum annealing to solve Set Cover with Pairs (SCP), an NP-hard combinatorial optimization problem that plays an important role in networking, computational biology, and biochemistry. We show an explicit construction of Ising Hamiltonians whose ground states encode the solution of SCP instances. We numerically simulate the time-dependent Schrödinger equation in order to test the performance of quantum annealing for random instances and compare with that of simulated annealing. We also discuss explicit embedding strategies for realizing our Hamiltonian construction on the D-wave type restricted Ising Hamiltonian based on Chimera graphs. Our embedding on the Chimera graph preserves the structure of the original SCP instance and in particular, the embedding for general complete bipartite graphs and logical disjunctions may be of broader use than that the specific problem we deal with
Enabling Technologies for Silicon Microstrip Tracking Detectors at the HL-LHC
While the tracking detectors of the ATLAS and CMS experiments have shown
excellent performance in Run 1 of LHC data taking, and are expected to continue
to do so during LHC operation at design luminosity, both experiments will have
to exchange their tracking systems when the LHC is upgraded to the
high-luminosity LHC (HL-LHC) around the year 2024. The new tracking systems
need to operate in an environment in which both the hit densities and the
radiation damage will be about an order of magnitude higher than today. In
addition, the new trackers need to contribute to the first level trigger in
order to maintain a high data-taking efficiency for the interesting processes.
Novel detector technologies have to be developed to meet these very challenging
goals. The German groups active in the upgrades of the ATLAS and CMS tracking
systems have formed a collaborative "Project on Enabling Technologies for
Silicon Microstrip Tracking Detectors at the HL-LHC" (PETTL), which was
supported by the Helmholtz Alliance "Physics at the Terascale" during the years
2013 and 2014. The aim of the project was to share experience and to work
together on key areas of mutual interest during the R&D phase of these
upgrades. The project concentrated on five areas, namely exchange of
experience, radiation hardness of silicon sensors, low mass system design,
automated precision assembly procedures, and irradiations. This report
summarizes the main achievements
- …