Готові списки джерел за темами / Layout problems

Зміст

  1. Статті в журналах
  2. Дисертації
  3. Книги
  4. Частини книг
  5. Тези доповідей конференцій
  6. Звіти організацій

Добірка наукової літератури з теми "Layout problems"

Автор: Grafiati
Опубліковано: 12 жовтня 2024

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Layout problems".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Layout problems"

1

Hosseini, Seyedeh Sabereh, Kuan Yew Wong, Seyed Ali Mirzapour, and Reza Ahmadi. "Multi-Floor Facility Layout Improvement Using Systematic Layout Planning." Advanced Materials Research 845 (December 2013): 532–37. http://dx.doi.org/10.4028/www.scientific.net/amr.845.532.

Повний текст джерела
Анотація:
This study aims at improving the multi-floor layout of a card and packet production company based on the Systematic Layout Planning (SLP) method. A detailed study of the facility layout such as its operational processes, flow of materials and activity relationships has been done. Long distance, cross-traffic, and cost have been identified as the major problems of the current multi-floor layout. Three alternative layouts were suggested by SLP and the best alternative was selected and compared with the current layout. The results revealed that the new alternative layout could considerably improve the companys layout problems.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Koenig, Reinhard, and Sven Schneider. "Hierarchical structuring of layout problems in an interactive evolutionary layout system." Artificial Intelligence for Engineering Design, Analysis and Manufacturing 26, no. 2 (April 20, 2012): 129–42. http://dx.doi.org/10.1017/s0890060412000030.

Повний текст джерела
Анотація:
AbstractThis paper focuses on computer-based generative methods for layout problems in architecture and urban planning with special regard for the hierarchical structuring of layout elements. The generation of layouts takes place using evolutionary algorithms, which are used to optimize the arrangement of elements in terms of overlapping within a given boundary and the topological relations between them. In this paper, the approach is extended by a data structure that facilitates the hierarchical organization of layout elements making it possible to structure and organize larger layout problems into subsets that can be solved in parallel. An important aspect for the applicability of such a system in the design process is an appropriate means of user interaction. This depends largely on the calculation speed of the system and the variety of viable solutions. These properties are evaluated for hierarchical as well as for nonhierarchical structured layout problems.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Pankratov, A., T. Romanova, and A. Kotelevskiy. "Layout problems for arc objects in convex domains." Journal of Mechanical Engineering 19, no. 3 (September 30, 2016): 43–60. http://dx.doi.org/10.15407/pmach2016.03.043.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Madhusudanan Pillai, V., Irappa Basappa Hunagund, and Krishna K. Krishnan. "Design of robust layout for Dynamic Plant Layout Problems." Computers & Industrial Engineering 61, no. 3 (October 2011): 813–23. http://dx.doi.org/10.1016/j.cie.2011.05.014.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Larasati, Indira, Parwadi Moengin, and Sucipto Adisuwiryo. "Perbaikan Tata Letak Lantai Produksi untuk Meminimasi Waktu Produksi dengan Menggunakan Metode Simulasi Pada PT. Argha Karya Prima Industry, Tbk." JURNAL TEKNIK INDUSTRI 8, no. 1 (March 31, 2018): 47–57. http://dx.doi.org/10.25105/jti.v8i1.4720.

Повний текст джерела
Анотація:
PT. Argha Prima Karya Industry is a company engaged in the field of flexible packaging. Problems found on the production floor of PT. Argha Karya Prima Industry is a delay in production time due to the engine distance that is too far and the availability of material handling is lacking. The product studied in this study is polyester plastic film with a production capacity of 1 unit within 11 hours equivalent to 2 days, while the production target set is 1 unit within 8 hours equivalent to 1 day. Layout the initial model of PT. Argha Karya Prima Industry was analyzed by simulation using ProModel software. Then after the initial layout was declared valid, improvements were made to the problems of the production floor layout using the Systematic Layout Planning method. From this method, two alternative layouts are obtained. The difference from the two proposed layouts is in the initial model, the slitter unwinder machine adjacent to the waste trimming area, while in the proposed layout 1, the slitter unwinder machine is located adjacent to the temporary storage rack. Then in the proposed layout 2, the slitter rewinder machine is adjacent to the finishing good area, while in the initial layout, the rewinder machine is adjacent to the temporary storage rack.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Drira, Amine, Henri Pierreval, and Sonia Hajri-Gabouj. "Facility layout problems: A survey." Annual Reviews in Control 31, no. 2 (January 2007): 255–67. http://dx.doi.org/10.1016/j.arcontrol.2007.04.001.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Szykman, S., and J. Cagan. "Constrained Three-Dimensional Component Layout Using Simulated Annealing." Journal of Mechanical Design 119, no. 1 (March 1, 1997): 28–35. http://dx.doi.org/10.1115/1.2828785.

Повний текст джерела
Анотація:
This research introduces a computational algorithm that uses simulated annealing to optimize three-dimensional component layouts. General component layout problems are characterized by three objectives: achieving high packing density, fitting components into a given container and satisfying spatial constraints on components. This paper focuses on the extension of a simulated annealing packing algorithm to a general layout algorithm through the implementation of a language of spatial constraints that are characteristic of layout problems. These constraints allow the designer to specify desired component proximities or to restrict translation or rotation of components based on a global origin or set of coordinate axes, or relative to other component locations or orientations. The layout of components from a cordless power drill illustrates the algorithm.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

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.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Li, Jia, and Chenyan Bai. "Ammann-Beenker Pixels." Journal of Computational and Theoretical Nanoscience 14, no. 1 (January 1, 2017): 807–14. http://dx.doi.org/10.1166/jctn.2017.6278.

Повний текст джерела
Анотація:
We propose a new aperiodic pixel layout based on the Ammann-Beenker tiling. It is uniformly three-colorable and uses only two simple pixel shapes, making it advantageous over other irregular layouts for color imaging. The existing Penrose pixel layout, which is another aperiodic pixel layout in rhombus Penrose tiling, also has the same properties. However, the Penrose pixel layout uses 36-degree and 72-degree rhombus pixel shapes, while the Ammann-Beenker pixel layout uses square and 45-degree rhombus pixel shapes. Hence the manufacture of Ammann-Beenker pixels is much more feasible than that of Penrose. We evaluate the performance of Ammann-Beenker pixel layout with two problems: super-resolution and demosaicking. Experimental results show that Ammann-Beenker pixel layout outperforms square one and is highly competitive with Penrose one.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Suharjito, Suharjito, and Muslim Muslim. "Optimization of Facility Layout Problems Using Genetic Algorithm." Syntax Literate ; Jurnal Ilmiah Indonesia 7, no. 9 (October 20, 2023): 16058–77. http://dx.doi.org/10.36418/syntax-literate.v7i9.13787.

Повний текст джерела
Анотація:
The facility layout problem (FLP) is one of the most important classic industrial engineering and production management problems that have attracted the attention of many researchers over the last few decades. Poor production facility layout planning can result in additional operational costs; one of them is the cost of material handling. Although crucial, FLP is a challenging issue to resolve. A unique method is needed depending on the constraint, case study, and layout type. This research was conducted in order to improve the existing layout of PT. XYZ to minimize material handling costs. The layout type in this case is the Open-field layout problem (OFLP). A genetic algorithm is proposed to optimize the layout. The result is 18.1% material handling costs can be reduced.
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Дисертації з теми "Layout problems"

1

Narayanan, Venkataramani. "Design of hybrid layouts for large size facility layout problems." Thesis, Wichita State University, 2007. http://hdl.handle.net/10057/1544.

Повний текст джерела
Анотація:
Generally facility layout problems are solved traditionally using assembly layout or process layout or cellular layout. Hybrid layouts are layouts that combine all three traditionally layouts considering product characteristics and capacity requirements. In this research, a systematic methodology to design the hybrid layouts is performed. The need for developing a hybrid layout is justified based on the product routing and layout requirements. The size of the problem is minimized using product analysis techniques which also minimizes the computational time. New similarity measures are developed to consider the missing entities of the previous research works. Products and machines are segregated for different type of layouts (assembly layout, process layout and distributed layout) based on machine utilization and the similarities between the products. Mathematical models are developed to arrange machines that are segregated for the different types of layouts. The computational time of the mathematical models are also minimized by introducing the product machine incidence matrix as the input data. The effective utilization of the machines is maximized by sharing the machines between the layouts. The proposed methodology is evaluated by two case studies. It is proved that the methodology is effective to solve large sized facility layout problems.
Thesis (M.S)--Wichita State University, College of Engineering, Dept. of Industrial and Manufacturing Engineering
"December 2007."
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Narayanan, Venkataramani Krishnan Krishna K. "Design of hybrid layouts for large size facility layout problems /." Thesis, A link to full text of this thesis in SOAR, 2007. http://hdl.handle.net/10057/1544.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Sprague, Alan P. "Problems in VLSI layout design /." The Ohio State University, 1988. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487597424138645.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Ren, Jintong. "Optimization algorithms for graph layout problems." Thesis, Angers, 2020. https://tel.archives-ouvertes.fr/tel-03178385.

Повний текст джерела
Анотація:
Cette thèse considère deux problèmes de disposition des graphes : le problème de la bande passante cyclique (CBP) et le problème de l’agencement linéaire minimum (MinLA). Le CBP est une extension naturelle du problème de minimisation de la bande passante (BMP) et le MinLA est un problème de somme minimale. Ces problèmes sont largement appliqués dans la vie réelle. Puisqu’ils sont NP-difficile, il est difficile de les résoudre dans le cas général. Par conséquent, cette thèse est consacrée au développement d’algorithmes heuristiques efficaces pour faire face à ces problèmes. Plus précisément, nous introduisons deux algorithmes de recherche locale itétée, un algorithme mémétique avec différents opérateurs de recombinaison pour le CBP et une heuristique de voisinage basée sur un ensemble pour résoudre le MinLA. On montre expérimentalement que pour le CBP, les deux algorithmes de recherche locale itéré pouvaient concurrencer favorablement les méthodes de l’état de l’art, le croisement approprié est identifié pour l’algorithme mémétique. On montre également que pour le MinLA, l’heuristique de voisinage basée sur l’ensemble s’est avérée plus efficace que des algorithmes avec voisinage traditionnel à 2-flip
This thesis considers two graph layout problems: the cyclic bandwidth problem (CBP) and the minimum linear arrangement problem (MinLA). The CBP is a natural extension of the bandwidth minimization problem (BMP) and the MinLA is a min-sum problem. These problems are widely applied in the real life. Since they are NP-hard problems, it is computational difficult to solve them in the general case. Therefore, this thesis is dedicated to developing effective heuristic algorithms to deal with these challenging problems.Specifically, we introduce two iterated local search algorithms, a memetic algorithm with different recombination operators for the CBP and a set based neighborhood heuristic algorithm to solve the MinLA. The two iterated local search algorithms are experimentallydemonstrated to be able to compete favourably with state-of-the-art methods, the feature of a suitable crossover for the memetic algorithm is identified for the CBP and the set based neighborhood heuristic algorithm is proven to be more efficient than the traditional 2-flip neighborhood algorithm
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Dahlbeck, Mirko [Verfasser]. "Solution approaches for facility layout problems / Mirko Dahlbeck." Göttingen : Niedersächsische Staats- und Universitätsbibliothek Göttingen, 2021. http://d-nb.info/1226425682/34.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Traversi, Emiliano <1981&gt. "Orientation and layout problems on graphs, with applications." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2010. http://amsdottorato.unibo.it/2637/2/traversi_emiliano_tesi.pdf.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Traversi, Emiliano <1981&gt. "Orientation and layout problems on graphs, with applications." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2010. http://amsdottorato.unibo.it/2637/.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Gamot, Juliette. "Algorithms for Conditional Search Space Optimal Layout Problems." Electronic Thesis or Diss., Université de Lille (2022-....), 2023. http://www.theses.fr/2023ULILB042.

Повний текст джерела
Анотація:
Cette thèse s'inscrit dans le cadre de l'optimisation d'agencement, une étape importante dans la conception de systèmes multidisciplinaires complexes tels que les véhicules aérospatiaux. Les problèmes d'agencement optimal (OLP) consistent à trouver la meilleure disposition d'un ensemble de composants dans un système ou un espace, afin d'atteindre certains objectifs (réduction des coûts, amélioration des performances, etc.) tout en satisfaisant diverses contraintes (géométriques, fonctionnelles, etc.). Le traitement des OLP est encore un défi aujourd'hui, tant en termes de formulation que de résolution. En effet, les OLP sont souvent très contraints et impliquent de nombreuses variables de décision (continues, discrètes, catégorielles), qui peuvent être fixes ou conditionnelles. Les variables conditionnelles sont utiles pour définir différents choix de conception qui doivent être faits en même temps que l'optimisation de l'agencement des composants. Ainsi, la résolution des OLP nécessite l'utilisation d'algorithmes d'optimisation avancés combinant différentes catégories de méthodes, comme par exemple les métaheuristiques et l'optimisation bayésienne.L'objectif global de la thèse est d'étudier les OLP, leur formulation dans différents contextes, leur résolution à l'aide de diverses méthodes d'optimisation et hybridations, ainsi que la validation de ces méthodes dans le cadre de la conception de véhicules aérospatiaux. Les contributions de la thèse sont organisées en deux parties correspondant à deux types d'OLP. Dans la première (respectivement deuxième) partie, la liste de composants à agencer est fixe (resp. variable), impliquant des OLP à espace de recherche fixe ou FSS-OLP, (resp. des OLP à espace de recherche conditionnel ou CSS-OLP). Dans les deux cas, le système/l'espace dans lequel les composants sont agencés est considéré comme mono ou multi-contenant.Dans la première partie, une étude des FSS-OLP est proposée, incluant leurs formulations génériques, leurs applications et méthodes de résolution, avec un focus particulier sur les méthodes quasi-physiques et les métaheuristiques. Basés sur un système de force virtuelle (VF), les algorithmes quasi-physiques simulent les lois de la dynamique et traitent efficacement les problèmes fortement contraints. Une variante (nommée CSO-VF) de de ces algorithmes est développée afin de résoudre les FSS-OLP à un seul contenant. Dans CSO-VF, la position et l'orientation des composants évoluent grâce au VF. Pour traiter les systèmes multi-contenants, CSO-VF est hybridé à un algorithme génétique (GA) dans un algorithme à deux étages qui affecte les composants aux contenants puis optimise leur disposition dans chacun des contenants. Ces deux algorithmes sont évalués grâce à des problèmes d'agencement de satellites.Dans la deuxième partie, une étude des CSS-OLP est proposée avec la même approche que dans la première partie. Les variables conditionnelles engendrent des OLP plus complexes. Par exemple, dans le contexte de la conception aérospatiale, une quantité donnée de carburant peut être incluse dans le système, soit dans un grand réservoir, soit dans deux plus petits. Par conséquent, le nombre de composants à positionner n'est pas le même dans les deux cas et le nombre de variables de conception et de contraintes varie donc au cours du processus d'optimisation. Deux approches ont été développées pour traiter les CSS-OLP à un seul contenant : la première est un GA modifié pour introduire des variables cachées dans les chromosomes. La seconde est une approche bi-niveaux combinant optimisation bayésienne et l'algorithme CSO-VF. L'optimisation bayésienne sélectionne les composants et CSO-VF optimise leur agencement. Cette dernière approche a été hybridée avec un GA dans un algorithme tri-niveaux afin de traiter les CSS-OLP multi-contenants. Enfin, tous les algorithmes sont évalués et comparés grâce à des problèmes d'agencement de satellites
This thesis falls within the scope of layout optimization, which is an important stage in the design of complex multidisciplinary engineering systems such as aerospace vehicles. Optimal layout problems (OLPs) involve finding the best arrangement of a set of components within a single- or multi-container system or space to meet specific objectives (cost reduction, performance enhancement, etc.) while satisfying various constraints (geometrical, functional, etc.). Dealing with OLPs is challenging both in terms of their formulation and their efficient and effective resolution. Actually, OLPs are often highly constrained and involve many mixed decision variables (continuous, discrete/categorial) which may be fixed or conditional. Conditional variables are highly useful to define different design choices when the set of components to be arranged is variable and dynamic. Consequently, their resolution requires the use of advanced optimization algorithms combining different classes of (mixed-variable) methods including metaheuristics and Bayesian optimization.The overall objective of the thesis is to investigate OLPs, their formulation in different contexts, their resolution using various optimization methods and their hybridization, and their validation within the framework of aerospace vehicle design. The contributions of the thesis are organized in two parts corresponding to two types of OLPs. In the first (resp. second) part, the set of components to be arranged is fixed (variable or conditional) involving fixed search space OLPs or FSS-OLPs (resp. conditional search space OLPs or CSS-OLPs). In both cases, the system/space in which the components are arranged is considered single- or multi-container.In the first part, a survey of constrained mixed-variable FSS-OLPs is proposed including their generic formulations, applications and resolution methods with a particular focus on quasi-physical methods and population-based metaheuristics. Based on a virtual force system (VF) quasi-physical algorithms emulate the principle of physical laws in system dynamics and deal efficiently with highly constrained problems. A variant (namely CSO-VF) of these algorithms is devised for solving single-container FSS-OLPs. In CSO-VF, the positions and orientations of the components are evolved using VF. To deal with multi-container systems, CSO-VF is combined with a Genetic Algorithm (GA) in a two-stage algorithm that assigns the components to the containers and optimizes their layout. These single- and multi-container algorithms are assessed considering satellite module FSS-OLPs that are representative benchmarks.In the second part, a survey of constrained mixed-variable CSS-OLPs is proposed in the same way than in the first part. Conditional variables involve more complex OLPs. Actually, for instance, in the context of aerospace concept design, a given amount of fuel could be included in a container in either one large tank or two smaller ones. Therefore, as the number of components to position is not the same in both cases the number of design variables as well as constraint functions vary during the optimization process. To deal with single-container CSS-OLPs, two approaches have been investigated: the first one is a GA revisited considering hidden variables, leading to variable-geometry OLPs (in objective and constraint functions). The second approach is a two-stage surrogate guided-CSO-VF algorithm combining Bayesian Optimization with CSO-VF. Bayesian Optimization selects the components with are considered by CSO-VF for layout optimization. This latter approach has been extended with a GA in a three-stage algorithm to tackle multi-container CSS-OLPs. Finally, all the algorithms are evaluated and compared based on their application to CSS variants of satellite module OLPs
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Freire, Marco. "Layout problems under topological constraints for computational fabrication." Electronic Thesis or Diss., Université de Lorraine, 2024. http://www.theses.fr/2024LORR0073.

Повний текст джерела
Анотація:
Les problèmes d'agencement surviennent dans de nombreux contextes en ingénierie et en informatique. Typiquement, la résolution d'un problème d'agencement consiste en l'organisation spatiale et l'interconnexion d'un ensemble d'éléments dans un espace. Cet espace et ces interconnexions peuvent être de complexité très variable. Un ensemble de contraintes et d'objectifs complémentent la description du problème, tels que minimiser la longueur ou la surface des interconnexions, ou fixer la position de certains éléments. La planification des étages en architecture, de niveaux de jeux vidéo, l'agencement d'installations industrielles ou de circuits électroniques, sont tous des exemples de problèmes d'agencement. Les contraintes topologiques jouent un rôle important dans l'agencement. La topologie considère des objets définis par les voisinages de leurs éléments, sans s'attarder sur leur géométrie spécifique. Par exemple, un graphe est une entité topologique, constituée uniquement des liens entre ses nœuds. Au contraire, dessiner un graphe est une opération géométrique, puisqu'elle demande de spécifier la position des nœuds. Cette thèse se focalise sur la résolution de deux problèmes d'agencement spécifiques liés à la fabrication et la conception computationnelles sujets à des contraintes topologiques. Plus particulièrement, il s'agit de la génération d'agencements de circuits électroniques et la génération de supports pour l'impression 3D. La première contribution est un système pour la conception d'écrans surfaciques constitués de DEL RVB à travers l'utilisation de circuits imprimés pliables. Nous plions les circuits imprimés traditionnels en utilisant des motifs de découpe localisés, créant ainsi des `charnières' dans la plaque. Le système prend en entrée un maillage basse-résolution et produit des plans pouvant être envoyés à des services en ligne de fabrication de circuits. Suite à la fabrication, l'écran est assemblé en pliant le circuit sur une impression 3D du maillage d'origine. Les écrans fabriqués peuvent être contrôlés à travers une interface similaire à des shaders pour créer des effets lumineux impressionnants. Le problème global est découpé en sous-problèmes locaux grâce à la topologie chaînée du circuit, les plans finaux étant obtenus en `recousant' les solutions aux sous-problèmes. Au lieu de suivre la méthode traditionnelle d'agencement électronique (concevoir le schéma électrique, placer et connecter les composants); nous décidons du nombre de composants, leur placement et leur routage séparément pour chaque triangle au moment-même de la génération. La deuxième contribution est un algorithme procédural pour la génération de supports pour l'impression 3D sous forme d'échafaudages. Ces supports s'impriment de manière fiable et sont stables [DHL14]. L'algorithme précédent ne considère pas les intersections entre les supports et l'objet imprimé, laissant des marques indésirables sur la surface de l'objet. De plus, la complexité de l'algorithme dépend du nombre de points à porter. Nous proposons un nouvel algorithme inspiré du emph{Model Synthesis} (MS) [Mer09]. Il évite implicitement les intersections et sa complexité est indépendante du nombre de points à porter. Les supports sont représentés indirectement à travers un ensemble d'étiquettes, chacune représentant une partie de la structure (par exemple une partie de pilier, de pont, ou une jonction); et un ensemble de contraintes d'adjacence déterminant quelles combinaisons d'étiquettes sont possibles dans toutes les directions. Les supports sont générés de haut en bas en attribuant de façon répétée une étiquette à un voxel, puis en propageant les contraintes afin d'éliminer les étiquettes rendues impossibles. Cet algorithme, les contraintes d'adjacences et les heuristiques utilisées sont conçues ensemble pour générer des supports sans essai-erreur ou retours arrière, typiques du MS et autres méthodes similaires
Layout problems appear in many areas of engineering and computer science. Typically, a layout problem requires to spatially arrange and interconnect a number of geometric elements in a domain. The elements can have a fixed or variable size, as well as an arbitrary shape. The domain may be be a volume, a planar region or a surface. It may be fixed or allowed to reshape. The interconnections may be simple paths, shared contact regions, or both. A set of constraints and objectives complement the problem definition, such as minimizing interconnection length, fixed positions for some elements, and many others. Layout problems are ubiquitous: floorplanning in architectural design, video game level design, industrial facility layout planning, electronics physical layout design, and so on. Topological constraints often arise in layout problems. Topology considers objects as defined by their elements' neighborhoods, without consideration for their specific geometry of placement. For example, a graph is a purely topological structure, consisting only of the relationships between its nodes. On the other hand, a graph drawing needs to specify the position of its nodes, i.e. the geometry of the graph. This thesis focuses on tackling two specific layout problems subject to topological constraints arising in computational design and fabrication. These are electronic circuit physical layout generation and 3D printing support generation. The first contribution is an entire system for the design of freeform RGB LED displays through bendable circuit boards. Typical rigid PCBs are made to bend by strategically using kerfing, i.e. cutting patterns into the board to create `hinges' where it needs to fold. The system takes a low-poly mesh as an input and outputs fabrication-ready blueprints, that can be sent to any online PCB manufacturer. After fabrication, the display is obtained by folding the circuit over the 3D printed mesh. The LEDs are commonly found on commercially available LED strips and are easy to control. Thus, the display can be used through a programmable interface to generate impressive lighting effects in real time. The global layout problem is decomposed into local per-triangle sub-problems by exploiting the chain topology of the electronic circuit, the final layout being obtained by stitching the local solutions. Instead of traditionally following the physical design pipeline, i.e. schematics design, component placement and routing; we decide the number of components, their placement and their routing per-triangle on the fly. The second contribution is a procedural algorithm for generating bridges-and-pillars supports for 3D printing. These supports have been shown to print reliably and in a stable manner in [DHL14]. Unfortunately, the previous algorithm struggles to generate supports that do not intersect the object, leaving visible scars on its surface after support removal. Additionally, its complexity scales with the number of points to support. We propose an algorithm based on emph{Model Synthesis} (MS) [Mer09] to generate these supports, with an implicit knowledge of object avoidance and a complexity independent of the number of points to support. Our algorithm works on a voxelized representation of the object. The supports are encoded in the algorithm with a set of labels, each representing a part of the structure (e.g. a pillar block, a bridge block, a pillar-bridge junction); and a set of adjacency constraints defining all possible label combinations in every direction. The supports for an object are generated top to bottom by repeatedly assigning labels to voxels and propagating constraints to remove inconsistent labels in the domain. The algorithm, adjacency constraints and heuristics are co-designed to avoid the need for trial-and-error or backtracking, typical of MS and similar approaches
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Finney, Andrew Martin. "The application of graph algorithms to VLSI layout." Thesis, Brunel University, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.235887.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Книги з теми "Layout problems"

1

Berlin, Technische Universität, ed. Bounds for linear VLSI layout problems: Schranken für lineare VLSI-Layout-Probleme. [s.l.]: [s.n.], 1993.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Camp, Drew J. Van. A nonlinear optimization approach for solving facility layout problems. Ottawa: National Library of Canada, 1990.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Kothari, Ravi. Sensitivity analysis for the single row facility layout problem. Ahmedabad: Indian Institute of Management, Ahmedabad, 2012.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Kothari, Ravi. Scatter search altgorithms for the single row facility layout problem. Ahmedabad: Indian Institute of Management, 2012.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Steve, Middleditch, ed. Design for media: A handbook for students and professionals in journalism, PR and advertising. Harlow, England: Pearson Education, 2013.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Kothari, Ravi. Tabu search for the single row facility layout problem using exhaustive 2-Opt and insertion neighborhoods. Ahmedabad: Indian Institute of Management, 2012.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Kothari, Ravi. Tabu search for the single row facility layout problem in FMS using a 3-opt neighborhood. Ahmedabad: Indian Institute of Management, 2012.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Lammermann, Rolf. Aktuelle Probleme im Rahmen der betriebsbedingten Kündigung unter besonderer Berücksichtigung der betrieblichen und sozialen Auswahl. Bielefeld: [s.n.], 1996.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Wirtgen, Jürgen. Approximation algorithms for layout problems. 1998.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Kinnersley, Nancy Gail. Obstruction set isolation for layout permutation problems. 1989.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Частини книг з теми "Layout problems"

1

Díaz, J. "Graph layout problems." In Mathematical Foundations of Computer Science 1992, 14–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-55808-x_2.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Pardo, Eduardo G., Rafael Martí, and Abraham Duarte. "Linear Layout Problems." In Handbook of Heuristics, 1025–49. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-07124-4_45.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Pardo, Eduardo G., Rafael Martí, and Abraham Duarte. "Linear Layout Problems." In Handbook of Heuristics, 1–25. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-07153-4_45-1.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Eiselt, H. A., and C. L. Sandblom. "Layout Models." In Decision Analysis, Location Models, and Scheduling Problems, 255–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24722-7_9.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Lengauer, Thomas. "Optimization Problems." In Combinatorial Algorithms for Integrated Circuit Layout, 31–45. Wiesbaden: Vieweg+Teubner Verlag, 1990. http://dx.doi.org/10.1007/978-3-322-92106-2_2.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Stiglmayr, Michael. "Layout Problems with Reachability Constraint." In Operations Research Proceedings, 183–89. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-48439-2_22.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Díaz, Josep, Mathew D. Penrose, Jordi Petit, and María Serna. "Layout Problems on Lattice Graphs." In Lecture Notes in Computer Science, 103–12. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48686-0_10.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Zaks, Shmuel. "Duality in ATM Layout Problems." In Lecture Notes in Computer Science, 44–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-46521-9_4.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Eiselt, H. A., and C. L. Sandblom. "Fundamentals of Location and Layout Problems." In Decision Analysis, Location Models, and Scheduling Problems, 153–67. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24722-7_5.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Arnolds, Ines, and Stefan Nickel. "Layout Planning Problems in Health Care." In Applications of Location Analysis, 109–52. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-20282-2_5.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Layout problems"

1

Chen, Shuai, Zeqiang Zhang, Junqi Liu, Dan Ji, and Yu Zhang. "Unidirectional loop layout problems based on asymmetric flow and facility location." In 4th International Conference on Automation Control. Algorithm and Intelligent Bionics, edited by Jing Na and Shuping He, 170. SPIE, 2024. http://dx.doi.org/10.1117/12.3040279.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Perry, Travis, and Andrew Gallaher. "Automated Layout with a Python Integrated NDARC Environment." In Vertical Flight Society 74th Annual Forum & Technology Display, 1–11. The Vertical Flight Society, 2018. http://dx.doi.org/10.4050/f-0074-2018-12723.

Повний текст джерела
Анотація:
Geometric layout of an aircraft concept is a fundamental aspect of the design process and can often be a primary driver for design choices, and trade space decisions. Most commonly, geometry is either estimated analytically by performance and sizing tools, from in-production aircraft data, or modeled using Computer Aided Design (CAD). Analytic geometry estimates are often not precise, requiring CAD to refine these estimates. Modeling an aircraft design to the fidelity needed to refine these geometric estimates can be a time consuming process. Furthermore, the initial layout design iterations are primarily used to refine prior estimates rather than address layout design choices. There is a need to accomplish these high level layout tasks in a timely manner; allowing for broad trade space analysis, and relying on CAD later in the design process for more detailed geometric layout. This paper will cover the development of the Automated Layout with a Python Integrated NDARC Environment (ALPINE), a Python Application Programming Interface (API) based geometry tool which leverages outputs from NASA Design and Analysis of Rotorcraft (NDARC) and the geometry software OpenVSP to expedite high level layout processes. ALPINE is an object oriented API tool that streamlines the initial conceptual layout process. This is accomplished through mapping NDARC geometry parameters to custom components generated in OpenVSP, and using algorithms native to OpenVSP. Through the use of this tool, the time needed for initial geometric layout is reduced significantly, potential design challenges can be highlighted without a detailed CAD model, geometry can be integrated within closed loop design optimization problems, and analytic geometry estimates from performance sizing codes can be refined and correlated to 3D model-based analyses.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

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.
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Wonka, Peter. "Integer programming for layout problems." In SA '18: SIGGRAPH Asia 2018. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3277644.3277794.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Pierreval, H. "Integrated Simulation Optimization for Layout Problems." In 2018 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM). IEEE, 2018. http://dx.doi.org/10.1109/ieem.2018.8607591.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Subhash, Sarin,. "Layout of Facilities Involving Arbitrary-Shaped Departments." In Information Control Problems in Manufacturing, edited by Bakhtadze, Natalia, chair Dolgui, Alexandre and Bakhtadze, Natalia. Elsevier, 2009. http://dx.doi.org/10.3182/20090603-3-ru-2001.00206.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Be´nabe`s, Julien, Emilie Poirson, Fouad Bennis, and Yannick Ravaut. "Interactive Modular Optimization Strategy for Layout Problems." In ASME 2011 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2011. http://dx.doi.org/10.1115/detc2011-47925.

Повний текст джерела
Анотація:
Layout design optimization has a significant impact in the design and use of many engineering products and systems. Real-world layout problems are usually considered as complex problems because of the geometry of components, the problem density and the great number of designer’s requirements. Solving these optimization problems is a hard and time consuming task. This paper proposes an interactive modular optimization strategy which allows the designer to find optimal solutions in a short period of calculation time. This generic strategy is based on a genetic algorithm, combined with specific optimization modules. These modules improve the global performances of the algorithm. This approach is adapted to multi-objective optimization problems and interactivity between the designer and the optimization process is used to make a final choice among design alternatives. This optimization strategy is tested on a real-world application which deals with the search of an optimal spatial arrangement of a shelter.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Salman, Mohagheghi,. "Evolutionary Approaches to the Linear Machine Layout Problem." In Information Control Problems in Manufacturing, edited by Bakhtadze, Natalia, chair Dolgui, Alexandre and Bakhtadze, Natalia. Elsevier, 2009. http://dx.doi.org/10.3182/20090603-3-ru-2001.00207.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Davoudpour, Hamid, Amir Ardestani Jaafari, Leila Najafabadi Farahani, and Sio-Iong Ao. "Facility Layout Problems Using Bays: A Survey." In IAENG TRANSACTIONS ON ENGINEERING TECHNOLOGIES: Volume 4: Special Edition of the World Congress on Engineering and Computer Science-2009. AIP, 2010. http://dx.doi.org/10.1063/1.3460254.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Vardanyan, V. A., and S. M. Koksharova. "Development of educational virtual laboratory work for the study of electrooptical switch on connected planar waveguides." In Modern Problems of Telecommunications - 2024. Siberian State University of Telecommunications and Information Systems, 2024. http://dx.doi.org/10.55648/spt-2024-1-6.

Повний текст джерела
Анотація:
Virtual laboratory work for the study of electrooptical switch on connected planar waveguides has been developed. The structural scheme of virtual laboratory work layout is described and the main features of software implementation of virtual layout are given.
Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Layout problems"

1

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.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Також вас можуть зацікавити розширені добірки на тему "Layout problems" для конкретних типів джерел:
Статті в журналах Дисертації Книги
Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!

До бібліографії