We are proudly a Ukrainian website. Our country was attacked by Russian Armed Forces on Feb. 24, 2022.
You can support the Ukrainian Army by following the link: https://u24.gov.ua/.
Even the smallest donation is hugely appreciated!
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Layout problem.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
PEER, S. K., DINESH K. SHARMA, K. RAVINDRANATH, and M. M. NAIDU. "A MULTI-CRITERIA PROCEDURE FOR THE USER INTERFACE COMPONENTS LAYOUT PROBLEM." Asia-Pacific Journal of Operational Research 26, no. 02 (April 2009): 257–84. http://dx.doi.org/10.1142/s0217595909002195.
The multi-criteria facilities layout problem can be formulated as a quadratic assignment model that can handle multiple qualitative and quantitative factors in the objective function. Some studies have shown that the techniques and tools of facilities layout problems can equally be applied for the layout design of user interface components in human-computer interface. This paper presents an alternate approach, which handles multiple qualitative and quantitative factors in a different manner separately in the objective function to obtain the initial layouts. The proposed approach also consists of a layout procedure, in which the pair of facilities with the least composite criterion value has been selected to be placed far apart in the layout to generate an initial layout in the construction procedure. The results of the proposed approach are compared with that of an existing approach which handles a number of qualitative and quantitative factors in the same manner as in the objective function to obtain the initial layouts for the example task of the user interface components layout problem under consideration.
2
Meng, G., S. S. Heragu *, and H. Zijm. "Reconfigurable layout problem." International Journal of Production Research 42, no. 22 (November 15, 2004): 4709–29. http://dx.doi.org/10.1080/0020754042000264590.
Clough, Jill M., and James R. Buck. "Plant Layout Ergonomics: Impact of Problem and Solver Features on Layout Quality." Proceedings of the Human Factors and Ergonomics Society Annual Meeting 37, no. 6 (October 1993): 468–71. http://dx.doi.org/10.1177/154193129303700604.
A study of people solving facility layout problems was made to estimate the effects of problem features on the quality of solutions obtained by novice and experienced subjects. An empirical experiment was conducted. Three features of these problems which were systematically varied in this study were: 1. Problem size, 2. Fraction of strong inter-departmental relationships, and 3. Fraction of departments requiring a non-standard amount of floor space. Both quantitative and subjective layout evaluations were made. It was found that layout quality was not affected by feature 3 for any values of the other features, using either evaluation method, and with either novice or experienced subjects. However, feature 2 proved to be significant for all experimental conditions, both evaluation methods, and with both subject groups. Feature 1 was a significant feature in some situations, but was not significant in others. Some differences in problem solving approaches were observed. There was a significant relationship between the design of higher quality layouts by experienced subjects and the use of a Relationship Diagram. Reducing the problem size and/or percentage of strong inter-departmental relationships in a problem may make a higher quality layout easier to achieve.
4
Chklovskii, Dmitri B. "Exact Solution for the Optimal Neuronal Layout Problem." Neural Computation 16, no. 10 (October 1, 2004): 2067–78. http://dx.doi.org/10.1162/0899766041732422.
Evolution perfected brain design by maximizing its functionality while minimizing costs associated with building and maintaining it. Assumption that brain functionality is specified by neuronal connectivity, implemented by costly biological wiring, leads to the following optimal design problem. For a given neuronal connectivity, find a spatial layout of neurons that minimizes the wiring cost. Unfortunately, this problem is difficult to solve because the number of possible layouts is often astronomically large. We argue that the wiring cost may scale as wire length squared, reducing the optimal layout problem to a constrained minimization of a quadratic form. For biologically plausible constraints, this problem has exact analytical solutions, which give reasonable approximations to actual layouts in the brain. These solutions make the inverse problem of inferring neuronal connectivity from neuronal layout more tractable.
5
Janthanasub, Veerawan, and Phayung Meesad. "Improving the Evolutionary Computation for General Keyboard Arrangement Problem." Applied Mechanics and Materials 804 (October 2015): 337–40. http://dx.doi.org/10.4028/www.scientific.net/amm.804.337.
Thai traditional computer keyboard layouts are derived from the Thai typewriter keyboard's layout, which supports typing with ten fingers. Hence, this layout is not optimized for typing on touch screen device with one finger. This article presents a new method in arrangement the position of Thai characters on the virtual keyboard to support typing by a single finger. The process of the new method consist of analysing Thai Language to create difference digraph table from Benchmark for Enhancing the Standard of Thai language processing corpus (BEST corpus), designed keyboard layout using evolutionary computation technique and estimated time speed of typing by model human hand movement with Fitts' Law. The experiment shows that new keyboard designed by the proposed method has achieved a typing speed faster than the Thai traditional keyboard layout.
6
Kusiak, Andrew, and Sunderesh S. Heragu. "The facility layout problem." European Journal of Operational Research 29, no. 3 (June 1987): 229–51. http://dx.doi.org/10.1016/0377-2217(87)90238-4.
Tripp, Charles, Darice Guittet, Jennifer King, and Aaron Barker. "A simplified, efficient approach to hybrid wind and solar plant site optimization." Wind Energy Science 7, no. 2 (March 25, 2022): 697–713. http://dx.doi.org/10.5194/wes-7-697-2022.
Abstract. Wind plant layout optimization is a difficult, complex problem with a large number of variables and many local minima. Layout optimization only becomes more difficult with the addition of solar generation. In this paper, we propose a parameterized approach to wind and solar hybrid power plant layout optimization that greatly reduces problem dimensionality while guaranteeing that the generated layouts have a desirable regular structure. Thus far, hybrid power plant optimization research has focused on system sizing. We go beyond sizing and present a practical approach to optimizing the physical layout of a wind–solar hybrid power plant. We argue that the evolution strategy class of derivative-free optimization methods is well-suited to the parameterized hybrid layout problem, and we demonstrate how hard layout constraints (e.g., placement restrictions) can be transformed into soft constraints that are amenable to optimization using evolution strategies. Next, we present experimental results on four test sites, demonstrating the viability, reliability, and effectiveness of the parameterized evolution strategy approach for generating optimized hybrid plant layouts. Completing the tool kit for parameterized layout generation, we include a brief tutorial describing how the parameterized evolutionary approach can be inspected, understood, and debugged when applied to hybrid plant layouts.
8
CHEN, GARY YU-HSIN, and JU-CHIEH LO. "DYNAMIC FACILITY LAYOUT WITH MULTI-OBJECTIVES." Asia-Pacific Journal of Operational Research 31, no. 04 (August 2014): 1450027. http://dx.doi.org/10.1142/s0217595914500274.
A problem in multi-objective dynamic facility layout is achieving distance- and adjacency-based objectives for arranging facility layouts across multiple time periods. As a non-deterministic polynomial time-hard problem, it resembles the quadratic assignment problem (QAP), which can be solved through meta-heuristics such as ant colony optimization (ACO). This study investigates three multi-objective approaches coupled with ACO to solve this problem. As the experimental design, we apply the proposed methods to solve the dynamic facility layout problem (DFLP), multi-objective facility layout problem, and multi-objective DFLP based on data sets from the literature to test the quality of the solution. The results show that the proposed methods are effective for solving the problem.
9
HARMANANI, HAIDAR M., PIERRETTE P. ZOUEIN, and AOUNI M. HAJAR. "A PARALLEL GENETIC ALGORITHM FOR THE GEOMETRICALLY CONSTRAINED SITE LAYOUT PROBLEM WITH UNEQUAL-SIZE FACILITIES." International Journal of Computational Intelligence and Applications 04, no. 04 (December 2004): 375–400. http://dx.doi.org/10.1142/s1469026804001380.
Parallel genetic algorithms techniques have been used in a variety of computer engineering and science areas. This paper presents a parallel genetic algorithm to solve the site layout problem with unequal-size and constrained facilities. The problem involves coordinating the use of limited space to accommodate temporary facilities subject to geometric constraints. The problem is characterised by affinity weights used to model transportation costs between facilities, and by geometric constraints between relative positions of facilities on site. The algorithm is parallelised based on a message passing SPMD architecture using parallel search and chromosomes migration. The algorithm is tested on a variety of layout problems to illustrate its performance. In specific, in the case of: (1) loosely versus tightly constrained layouts with equal levels of interaction between facilities, (2) loosely versus tightly packed layouts with variable levels of interactions between facilities, and (3) loosely versus tightly constrained layouts. Favorable results are reported.
10
Malmborg, Charles J. "The concurrent block layout problem." International Journal of Production Research 51, no. 6 (March 15, 2013): 1745–61. http://dx.doi.org/10.1080/00207543.2012.701770.
Dissertations / Theses on the topic "Layout problem":
1
Jaramillo, Juan R. "The generalized machine layout problem." Morgantown, W. Va. : [West Virginia University Libraries], 2007. https://eidr.wvu.edu/etd/documentdata.eTD?documentid=5504.
Thesis (Ph. D.)--West Virginia University, 2007. Title from document title page. Document formatted into pages; contains xi, 86 p. : ill. Includes abstract. Includes bibliographical references (p. 82-86).
2
Kanya, Denise L. "Preprocessing rules for the dynamic layout problem." Ohio : Ohio University, 1994. http://www.ohiolink.edu/etd/view.cgi?ohiou1177533808.
St, Sauver Joseph E. "Parallel approaches to the facilities layout problem /." view abstract or download file of text, 1999. http://wwwlib.umi.com/cr/uoregon/fullcit?p9948030.
Thesis (Ph. D.)--University of Oregon, 1999. Typescript. Includes vita and abstract. Includes bibliographical references (leaves 168-173). Also available for download via the World Wide Web; free to University of Oregon users. Address: http://wwwlib.umi.com/cr/uoregon/fullcit?p9948030.
4
Kirkizoglu, Zeynep. "Modeling And Analysis Of The Facility Layout Problem." Master's thesis, METU, 2006. http://etd.lib.metu.edu.tr/upload/12607427/index.pdf.
The facilities layout problem, which is an integral part of facilities design, aims to
spatially locate the production units within a facility subject to some design criteria
and area limitations, with one or multiple objectives. In this study, the layout
problem is reviewed in detail, with an emphasis on the dynamic environment it
operates in. Despite the fact that layouts within the context of changing
manufacturing requirements represent the problem better, the single period block
layout problem is observed to have remained worth analyzing.
In this thesis, a hybrid model that combines the strong aspects of the available
models in the literature is constructed for the single period block layout problem.
The LP relaxation of this model and the effect of adding valid inequalities to the
model are studied. A rounding heuristic based on the LP relaxation of the problem is
proposed and computational experimentation is made. Also, an evolutionary
algorithm scheme that uses the sequence pair representation is proposed. Three
mutation operators are developed to be used in this scheme. Preliminary test are
made for implementations of these operators and results are given.
5
Liu, Wen-Hsing. "Tabu search heuristics for the dynamic facility layout problem." Morgantown, W. Va. : [West Virginia University Libraries], 2005. https://eidr.wvu.edu/etd/documentdata.eTD?documentid=3973.
Thesis (M.S.)--West Virginia University, 2005. Title from document title page. Document formatted into pages; contains vii, 88 p. : ill. Includes abstract. Includes bibliographical references (p. 83-88).
6
Loharjun, Pasu. "A decision theoretic approach to the general layout problem." Diss., Virginia Polytechnic Institute and State University, 1986. http://hdl.handle.net/10919/49824.
Oheba, Jamal Bashir. "A new framework considering uncertainty for facility layout problem." Thesis, University of Manchester, 2012. https://www.research.manchester.ac.uk/portal/en/theses/a-new-framework-considering-uncertainty-for-facility-layout-problem(7e0b665d-ed10-4355-a200-70d52d93eefe).html.
In today’s dynamic environment, where product demands are highly volatile and unstable, the ability to design and operate manufacturing facilities that are robust with respect to uncertainty and variability is becoming increasingly important to the success of any manufacturing firm in order to operate effectively in such an environment. Hence manufacturing facilities must be able to exhibit high levels of robustness and stability in order to deal with changing market demands. In general, Facility Layout Problem (FLP) is concerned with the allocation of the departments or machines in a facility with an objective to minimize the total material handling cost (MHC) of moving the required materials between pairs of departments. Most FLP approaches assume the flow between departments is deterministic, certain and constant over the entire time planning horizon. Changes in product demand and product mix in a dynamic environment invalidate these assumptions. Therefore there is a need for stochastic FLP approaches that aim to assess the impact of uncertainty and accommodate any possible changes in future product demands.This research focuses on stochastic FLP with an objective to present a methodology in the form of a framework that allows the layout designer to incorporate uncertainty in product demands into the design of a facility. In order to accomplish this objective, a measure of impact of this uncertainty is required. Two solution methods for single and multi period stochastic FLPs are presented to quantify the impact of product demand uncertainty to facility layout designs in terms of robustness (MHC) and variability (standard deviation). In the first method, a hybrid (simulation) approach which considers the development of a simulation model and integration of this model with the VIPPLANOPT 2006 algorithm is presented. In the second method, mathematical formulations of analytic robust and stable indices are developed along with the use of VIPPLANOPT for solution procedure. Several case studies are developed along with numerical examples and case studies from the literature are used to demonstrate the proposed methodology and the application of the two methods to address different aspects of stochastic FLP both analytically and via the simulation method. Through experimentation, the proposed framework with solution approaches has proven to be effective in evaluating the robustness and stability of facility layout designs with practical assumptions such as deletion and expansion of departments in a stochastic environment and in applying the analysis results of the analytic and simulation indices to reduce the impact of errors and make better decisions
8
Kuppusamy, Saravanan. "Simulated annealing heuristics for the dynamic facility layout problem." Morgantown, W. Va. : [West Virginia University Libraries], 2001. http://etd.wvu.edu/templates/showETD.cfm?recnum=2138.
Thesis (M.S.)--West Virginia University, 2001. Title from document title page. Document formatted into pages; contains x, 133 p. : ill. Includes abstract. Includes bibliographical references (p. 88-94).
9
Shang, Jin. "Ant colony heuristics for the dynamic facility layout problem." Morgantown, W. Va. : [West Virginia University Libraries], 2002. http://etd.wvu.edu/templates/showETD.cfm?recnum=2579.
Thesis (M.S.)--West Virginia University, 2002. Title from document title page. Document formatted into pages; contains vii, 76 p. : ill. Includes abstract. Includes bibliographical references (p. 72-76).
10
Jariwala, Anish. "Efficient branch and bound algorithm for the dynamic layout problem." Ohio : Ohio University, 1995. http://www.ohiolink.edu/etd/view.cgi?ohiou1179426531.
Kothari, Ravi. Tabu search for the single row facility layout problem using exhaustive 2-Opt and insertion neighborhoods. Ahmedabad: Indian Institute of Management, 2012.
Kothari, Ravi. Tabu search for the single row facility layout problem in FMS using a 3-opt neighborhood. Ahmedabad: Indian Institute of Management, 2012.
Müller-Brockmann, Josef. The graphic artist and his design problems: Creative problems of the graphic designer : design and training in commercial art = Gestaltungsprobleme des Grafikers : Gestalterische und erzieherische Probleme in der Werbegrafik : die Ausbildung des Grafikers = Les problèmes d'un artiste graphique : typographie, dessin, photo, labels, couleurs, etc. Niederteufen, Schweiz: A. Niggli AG, 2003.
Lammermann, Rolf. Aktuelle Probleme im Rahmen der betriebsbedingten Kündigung unter besonderer Berücksichtigung der betrieblichen und sozialen Auswahl. Bielefeld: [s.n.], 1996.
Lück, Peter. Probleme der Sozialauswahl nach [Paragraph] 1 III KSchG: Umfang der Sozialauswahl, Bestimmung und Gewichtung der bei der Sozialauswahl zu berücksichtigenden Sozialdaten und die Berücksichtigung betrieblicher Belange. Frankfurt am Main: P. Lang, 1993.
Hong, Seok-Hee, Damian Merrick, and Hugo A. D. do Nascimento. "The Metro Map Layout Problem." In Graph Drawing, 482–91. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-31843-9_50.
Samorani, Michele. "The Wind Farm Layout Optimization Problem." In Handbook of Wind Power Systems, 21–38. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-41080-2_2.
Aggarwal, Gagan, Tomás Feder, Rajeev Motwani, Rina Panigrahy, and An Zhu. "Algorithms for the Database Layout Problem." In Database Theory - ICDT 2005, 189–203. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30570-5_13.
Kubalík, Jiří, Jiří Lažanský, and Petr Zikl. "Layout Problem Optimization Using Genetic Algorithms." In Knowledge and Technology Integration in Production and Services, 493–500. Boston, MA: Springer US, 2002. http://dx.doi.org/10.1007/978-0-387-35613-6_56.
Jerin Leno, I., S. Saravana Sankar, and S. G. Ponnambalam. "Multi Objective Integrated Layout Design Problem." In Swarm, Evolutionary, and Memetic Computing, 500–508. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-35380-2_59.
Unger, Hendrik, and Frank Börner. "Reinforcement Learning for Layout Planning – Modelling the Layout Problem as MDP." In Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems, 471–79. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-85906-0_52.
Anderson, Richard J., and Sumeet Sobti. "The table layout problem." In the fifteenth annual symposium. New York, New York, USA: ACM Press, 1999. http://dx.doi.org/10.1145/304893.304937.
Salimpour, Saeideh, and Ahmed Azab. "A Dynamic Programming Approach to Solve the Facility Layout Problem for Reconfigurable Manufacturing." In ASME 2021 16th International Manufacturing Science and Engineering Conference. American Society of Mechanical Engineers, 2021. http://dx.doi.org/10.1115/msec2021-60408.
Abstract Preparing manufacturing systems to deal with disruptions caused by unexpected factors such as COVID-19 is critical to remain in today’s competitive market. Reconfigurable manufacturing systems (RMS) which are characterized by being rapid and cost-effective in response to market changes, are a good alternative to cope with such unexpected events. From the layout point of view, in an RMS, the layout of facilities needs to be changeable and able to be redesigned easily. Dynamic facility layout problem (DFLP) is a good approach to develop layouts that are capable to be changed and redesigned. Dynamic programming (DP) has been known as one of the effective methods to deal with DFLP. To optimize DFLP by DP, the set of possible layouts for every single period which is called the state-space is given to DP and the best multi-period layout is found. Since the number of possible layouts increases rapidly with the increase in the number of facilities, considering all these layouts encounters two major difficulties, memory requirements and computer time requirements. This paper proposes a method that has two main phases. In the first phase, the set of layouts to be considered in each period are determined using a heuristic approach. These layouts are the states in the DP approach where the periods constituted the decomposition stages. The recursive formulation of DP is solved in the second phase using a hybridized metaheuristic approach. The proposed approach restricts the DP to a good subset of the state-space. A genetic algorithm is applied to search for the best subset of layouts where each chromosome represents one subset of layouts. This subset is given to DP to be solved and the result is considered as the fitness of the chromosome. By the evolution of the chromosomes, the best subset of layouts that leads to the best multi-period layout plan is found. The proposed approach is evaluated against DP benchmarks in the literature. Computational results show that the proposed approach is able to provide more efficient solutions, especially for large-sized problems.
3
Amar, Sara Haddou, and Abdellah Abouabdellah. "Facility layout planning problem: Effectiveness and reliability evaluation system layout designs." In 2016 International Conference on System Reliability and Science (ICSRS). IEEE, 2016. http://dx.doi.org/10.1109/icsrs.2016.7815848.
Zhang, Jian, and Ai-Ping Li. "Genetic Algorithm for Robot Workcell Layout Problem." In 2009 WRI World Congress on Software Engineering. IEEE, 2009. http://dx.doi.org/10.1109/wcse.2009.375.
Wang, Yi-shou, Yan-jun Shi, and Hong-fei Teng. "Scatter Search for Constrained Layout Optimization Problem." In Third International Conference on Natural Computation (ICNC 2007) Vol V. IEEE, 2007. http://dx.doi.org/10.1109/icnc.2007.649.
Hurst, Nathan, Kim Marriott, and David Albrecht. "Solving the simple continuous table layout problem." In the 2006 ACM symposium. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1166160.1166169.
YALAOUI, NAIM, HALIM MAHDI, LIONEL AMODEO, and FAROUK YALAOUI. "Hybrid method for solving a layout problem." In Proceedings of the 8th International FLINS Conference. WORLD SCIENTIFIC, 2008. http://dx.doi.org/10.1142/9789812799470_0120.
Elkassas, Ahmed M., and Mohamed ElWakil. "Facility Layout Problem Using Salp Swarm Algorithm." In 2019 6th International Conference on Control, Decision and Information Technologies (CoDIT). IEEE, 2019. http://dx.doi.org/10.1109/codit.2019.8820422.
Ren Hongxia and Zhang Pengcheng. "Solution and optimization of rectangle layout problem." In 2011 International Conference on Computer Science and Network Technology (ICCSNT). IEEE, 2011. http://dx.doi.org/10.1109/iccsnt.2011.6182290.
Bénabès, Julien, Benoît Guédas, Emilie Poirson, and Fouad Bennis. "Indicator of Feasibility for Layout Problems." In ASME 2012 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/detc2012-70640.
Layout optimization problems deal with the search for an optimal spatial arrangement of components inside a container. Global performances of many engineering products and systems sharply depend on layout design. Because of the great complexity of most real-world layout applications, recent studies focus on the development of efficient optimization algorithms used to solve layout problems. These algorithms, which have to take into consideration multi-constraint and multi-objective optimization problems, aim to be generic to adapt to lots of layout problems. However, the solving of these layout problems is time consuming and designers know if an optimal solution is available for their problem at the end of the optimization process. Designer cannot know a priori if the layout problem can be solved. Then, this paper proposes a new indicator to assess the feasibility of layout problems. This indicator is based on the layout description of the problem and the formulation of designer’s requirements. In particular, it takes into account the non-overlap constraints between layout components. It allows the designer to know if the layout problem can be solved before running the optimization algorithm. After defining the new indicator of feasibility, this paper tests it on a simple layout application.
Reports on the topic "Layout problem":
1
Kaku, Bharat K., Thomas E. Morton, and Gerald L. Thompson. A Heuristic Algorithm for the Facilities Layout Problem. Fort Belvoir, VA: Defense Technical Information Center, May 1988. http://dx.doi.org/10.21236/ada196093.
Hrebeniuk, Bohdan V. Modification of the analytical gamma-algorithm for the flat layout of the graph. [б. в.], December 2018. http://dx.doi.org/10.31812/123456789/2882.
The planarity of graphs is one of the key sections of graph theory. Although a graph is an abstract mathematical object, most often it is graph visualization that makes it easier to study or develop in a particular area, for example, the infrastructure of a city, a company’s management or a website’s web page. In general, in the form of a graph, it is possible to depict any structures that have connections between the elements. But often such structures grow to such dimensions that it is difficult to determine whether it is possible to represent them on a plane without intersecting the bonds. There are many algorithms that solve this issue. One of these is the gamma method. The article identifies its problems and suggests methods for solving them, and also examines ways to achieve them.
