Bibliografie tematiche / Optimal Layout Problems

Letteratura scientifica selezionata sul tema "Optimal Layout Problems"

Autore: Grafiati

Pubblicato: 7 luglio 2024

Ultima modifica: 7 luglio 2024

Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili

Scegli il tipo di fonte:

Consulta la lista di attuali articoli, libri, tesi, atti di convegni e altre fonti scientifiche attinenti al tema "Optimal Layout Problems".

Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.

Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.

Articoli di riviste sul tema "Optimal Layout Problems":

Nisted, Lasse, David Pisinger e Avri Altman. "Optimal wafer cutting in shuttle layout problems". Journal of Combinatorial Optimization 22, n. 2 (28 gennaio 2010): 202–16. http://dx.doi.org/10.1007/s10878-009-9284-z.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Lurie, K. A. "Direct relaxation of optimal layout problems for plates". Journal of Optimization Theory and Applications 80, n. 1 (gennaio 1994): 93–116. http://dx.doi.org/10.1007/bf02196595.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Liu, Shu Yuan. "The Application of Layout Heuristic Optimization Algorithm in Operational Model". Advanced Materials Research 753-755 (agosto 2013): 1914–17. http://dx.doi.org/10.4028/www.scientific.net/amr.753-755.1914.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

In order to solve the layout NP complete problem, this paper analyzes the layout optimization model and algorithm, This kind of problems involved in operational research, data structures, algorithm analysis, artificial intelligence, computer network, etc. multi-discipline knowledge. Layout problems widely exist in practice, the main research rectangular optimal layout, Rectangular optimal layout is a series of rectangular parts reasonably emissions in raw material, make the highest utilization of raw material, And the optimization mathematical model is established, and the use of heuristic algorithm to solve the rectangular optimal layout problem. Simulation experiment showed that the optimization algorithm is effective.

Hills, W., M. Barlow e G. Cleland. "Layout Design of Large Made-To-Order Products Using a Knowledge-Based System". Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture 207, n. 4 (novembre 1993): 257–63. http://dx.doi.org/10.1243/pime_proc_1993_207_088_02.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

Work is described which is concerned with the application of knowledge-based and emergent-order programming techniques to conceptual layout problems in the field of large made-to-order products. The aim of this work has been to develop a prototype for computer aided design (CAD) tools that manipulate and analyse a product's topology, rather than its precise geometry. Features of the system include: working prototypes of a generic layout-oriented product model database schema and a layout design process. A knowledge-based system is used to advise the designer on optimal layout strategies and then, after layouts have been generated, to provide advice and assistance in the selection of the final layout.

Munavalli, Jyoti R., Shyam Vasudeva Rao, Aravind Srinivasan e Frits Van Merode. "Dynamic Layout Design Optimization to Improve Patient Flow in Outpatient Clinics Using Genetic Algorithms". Algorithms 15, n. 3 (6 marzo 2022): 85. http://dx.doi.org/10.3390/a15030085.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

Evolutionary algorithms, such as genetic algorithms have been used in various optimization problems. In this paper, we propose to apply this algorithm to obtain the layout design/redesign in order to improve the patient flow in an outpatient clinic. Layout designs are planned considering long-term requirements whereas the layout keeps modifying as per short-term demands. Over a period of time, the layout often does not remain efficient. Therefore, there is a need for such a model that helps in decision making on layout redesigns, and it must also optimize workflow by incorporating the flow constraints. In this study, we propose to minimize the waiting times by obtaining optimal and sub-optimal layout designs. A genetic algorithm is implemented to redesign the layouts based on the changing dynamics of patient demand, clinical pathways and services offered. The workflow is simulated with current layout and optimized layouts, and the results in terms of waiting time and cycle time are compared. The study shows that when layout design or redesign incorporate the workflow and pathways along with associated constraints, improves waiting time and cycle time of patients in the outpatient clinic. The distance between the departments/locations is translated to travelling time and overall travel distance/time is minimized by rearranging the allocations of departments to the location through genetic algorithms.

Hsie, Machine, Ming-Yen Wu e Chun Yen Huang. "Optimal urban sewer layout design using Steiner tree problems". Engineering Optimization 51, n. 11 (22 gennaio 2019): 1980–96. http://dx.doi.org/10.1080/0305215x.2018.1560436.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Gu, Jinjin, Yuan Cao, Min Wu, Min Song e Lin Wang. "A Novel Method for Watershed Best Management Practices Spatial Optimal Layout under Uncertainty". Sustainability 14, n. 20 (12 ottobre 2022): 13088. http://dx.doi.org/10.3390/su142013088.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

Watershed Best management Practices (BMPs) spatial optimal layout would be affected by uncertainty, and there are still three problems which are worthy of studying in the present studies of watershed BMPs spatial optimal layout under uncertainty: (1) how to integrate multiple uncertainties in optimization model effectively; (2) how to avoid subjective weight in multi-objective uncertainty model; (3) how to develop more elastic schemes for uncertainty impact. To solve the mentioned problems, this study takes Zhegao river watershed, China as an example, interval stochastic fuzzy fractional programming (ISFFP) integrated with SWAT hydrology model is applied for BMPs spatial optimal layout in watershed to reduce non-point source (NPS) pollution. The result shows that the ISFFP method could solve the problems effectively, and the method could be adapted to different types of uncertainty, also the method has seldom been used in uncertainty BMPs spatial optimal layout, and the method is worth of popularization.

Irawan, Heri Tri, Bismi Khairijal, Iing Pamungkas, T. M. Azis Pandria, Arhami Arhami, Hasnita Hasnita e Risnadi Irawan. "Perancangan Ulang Tata Letak pada Galangan Kapal Tradisional menggunakan Blocplan-90". Jurnal Optimalisasi 9, n. 2 (15 ottobre 2023): 148. http://dx.doi.org/10.35308/jopt.v9i2.8325.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

CV. Rasya Jaya is a traditional fishing boat manufacturing company located in Padang Seurahet, Kec. Johan Pahlawan, Aceh Barat Regency. The facility layout of CV. Rasya Jaya has several workstations that are not in the correct location for the production process or the relationship between related rooms. This results in inefficient and ineffective material handling, as well as reduced worker comfort. The poorly organized facilities also contribute to production constraints. Therefore, it is necessary to evaluate the production facility layout at CV. Rasya Jaya. The goal is to provide an alternative design for the production facility layout that is more efficient and effective in terms of the relationship between the production process flow and minimizing material flow in the production process. The purpose of this study is to determine the optimal layout at CV. Rasya Jaya using the Blocplan algorithm. Blocplan-90 is an algorithm for solving spatial layout problems that can handle both quantitative and qualitative data. Mathematical models within the design are developed with computer applications for models that work with the limitations of workstation shapes. Based on the results of the layout design of facilities at CV. Rasya Jaya, three main layouts were created: office layout, facility layout, and production layout. The total area of the three layouts is 1739 m2.

CHEN, DANNY Z., XIAOBO S. HU e XIAODONG WU. "OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS". International Journal of Computational Geometry & Applications 12, n. 04 (agosto 2002): 309–38. http://dx.doi.org/10.1142/s0218195902000918.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

Polygon cover problems are important in several applied areas, such as material layout, layered manufacturing, radiation therapy and radiosurgery, etc. In this paper, we study three optimal polygon cover problems: monotone polygon cover among obstacles, star-shaped polygon cover among obstacles, and strip cover for trapezoidalized polygons. Based on some interesting geometric observations, we develop efficient algorithms for solving these problems. The complexity bounds of our monotone cover and star-shaped cover algorithms are comparable to those of the previously best known algorithms for simpler cases of the problems without considering obstacles. Our strip cover algorithm improves the quality of the previously best known solutions.

KOUVELIS, PANAGIOTIS, WEN-CHYUAN CHIANG e GANG YU. "Optimal algorithms for row layout problems in automated manufacturing systems". IIE Transactions 27, n. 1 (febbraio 1995): 99–104. http://dx.doi.org/10.1080/07408179508936721.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Più fonti

Tesi sul tema "Optimal Layout Problems":

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

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

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

Wu, Ming-Yen, e 吳明岩. "Optimal urban sewer layout design using Obstacle-Avoiding Rectilinear Minimal Steiner Tree problems". Thesis, 2019. http://ndltd.ncl.edu.tw/handle/9vrap9.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

博士
國立中興大學
土木工程學系所
107
Abstract This paper introduces a novel method for optimizing sewer layouts. The study obtained the concept from an integrated circuit electronic routing design technique known as the obstacle-avoiding rectilinear Steiner minimal tree method and then solved the developed model problem using mixed integer linear programming. The sewer layout must be designed on the basis of the force of gravity, and sewerage should be carried from each sewer discharge nodes. However, the Steiner nodes serve as optional nodes to link each discharge node and flow to sinks in the main stream. The Steiner nodes are utilized for minimizing the total cost required for installing pipes by cutting the ground and the total cost of sewer pipes. The sewer layout should contain the shortest pipe distribution at the flattest acceptable slope, and the pipe should be installed closest to the ground surface. However, the ground elevation and the depths at which pipes are buried should be seriously considered during the layout design because the ground cutting volume is highly related to total costs. The constraints are subject to the acceptable pipe slopes between the recommended minimum and maximum slopes and the minimum depth at which the pipe is buried. The study constructs two 3D consideration models for optimizing sewer layout design; two stages style and whole stage style. After the comparison, the whole stage style can get the better solution. Furthermore, all the nonlinear constraints and the objective function of the whole stage style are transformed into a simple linear format. The study analysed three types of optimizations including Type A: only considering the minimum cost of the pipe on the objective function, Type B: only considering the minimum cost of cutting the ground, and Type C: considering the minimum total cost of both pipes and cutting the earth to illustrate the importance of considering all conditions to obtain an optimal sewer layout design. The proposed optimization model can save more than 38.83% of the cost required to realize the expert’s manual sewer layout design.

Capitoli di libri sul tema "Optimal Layout Problems":

Avhad, Akshay, Casper Schou e Ole Madsen. "Topology Planning in Swarm Production System: Framework and Optimization". In Advances in Automotive Production Technology – Towards Software-Defined Manufacturing and Resilient Supply Chains, 133–48. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-27933-1_13.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

AbstractA Swarm Production System (SPS) aims to be an agile and resilient Reconfigurable manufacturing system (RMS) paradigm that incorporates mobile workstations and transport robots on the factory production floor. This paper primarily focuses on SPS’s initial but recurring planning stage termed topology planning, which dynamically changes throughout the production runtime with spatially adaptive workstations and transporters handled exclusively by a Topology Manager (TM). TM is essential to multi-variant production with the optimal positioning of the workstations and provides a topology that optimizes the traffic flow for the product carrier robots. TM is a bridge to enable SPS to integrate with general planning and scheduling systems like ERP and MES and is comprised of a Topology Planner (TP) that evaluates the ideal configuration of on factory floor for a batch of product mix and a Reconfiguration Decision System (RDS) that decides on applying the estimated new topology during the batch changeover. The paper proposes a framework for the TM to identify its essential functionalities, responsibilities and working principle in a swarm production system. The paper also describes a grid-based heuristic approach applicable to two-dimensional spatial problems to reduce the complexity of the NP-hard problem. The paper focuses on a framework to estimate a reconfigurable shop floor layout with a Force-directed Graph-theory algorithm. A stochastic statistical model evaluates the performance of the optimal topology for throughput and makespan.

Mo, Fan, Jack C. Chaplin, David Sanderson, Hamood Ur Rehman, Fabio Marco Monetti, Antonio Maffei e Svetan Ratchev. "A Framework for Manufacturing System Reconfiguration Based on Artificial Intelligence and Digital Twin". In Lecture Notes in Mechanical Engineering, 361–73. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-18326-3_35.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

AbstractThe application of digital twins and artificial intelligence to manufacturing has shown potential in improving system resilience, responsiveness, and productivity. Traditional digital twin approaches are generally applied to single, static systems to enhance a specific process. This paper proposes a framework that applies digital twins and artificial intelligence to manufacturing system reconfiguration, i.e., the layout, process parameters, and operation time of multiple assets, to enable system decision making based on varying demands from the customer or market. A digital twin environment has been developed to simulate the manufacturing process with multiple industrial robots performing various tasks. A data pipeline is built in the digital twin with an API (application programming interface) to enable the integration of artificial intelligence. Artificial intelligence methods are used to optimise the digital twin environment and improve system decision-making. Finally, a multi-agent program approach shows the communication and negotiation status between different agents to determine the optimal configuration for a manufacturing system to solve varying problems. Compared with previous research, this framework combines distributed intelligence, artificial intelligence for decision making, and production line optimisation that can be widely applied in modern reactive manufacturing applications.

Klar, M., J. Mertes, M. Glatt, B. Ravani e J. C. Aurich. "A Holistic Framework for Factory Planning Using Reinforcement Learning". In Proceedings of the 3rd Conference on Physical Modeling for Virtual Manufacturing Systems and Processes, 129–48. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-35779-4_8.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

AbstractThe generation of an optimized factory layout is a central element of the factory planning process. The generated factory layout predefines multiple characteristics of the future factory, such as the operational costs and proper resource allocations. However, manual layout planning is often time and resource-consuming and involves creative processes. In order to reduce the manual planning effort, automated, computer-aided planning approaches can support the factory planner to deal with this complexity by generating valuable solutions in the early phase of factory layout planning. Novel approaches have introduced Reinforcement Learning based planning schemes to generate optimized factory layouts. However, the existing research mainly focuses on the technical feasibility and does not highlight how a Reinforcement Learning based planning approach can be integrated into the factory planning process. Furthermore, it is unclear which information is required for its application. This paper addresses this research gap by presenting a holistic framework for Reinforcement Learning based factory layout planning that can be applied at the initial planning (greenfield planning) stages as well as in the restructuring (brownfield planning) of a factory layout. The framework consists of five steps: the initialization of the layout planning problem, the initialization of the algorithm, the execution of multiple training sets, the evaluation of the training results, and a final manual planning step for a selected layout variant. Each step consists of multiple sub-steps that are interlinked by an information flow. The framework describes the necessary and optional information for each sub-step and further provides guidance for future developments.

Ripon, Kazi Shah Nawaz, Kyrre Glette, Omid Mirmotahari, Mats Høvin e Jim Tørresen. "Pareto Optimal Based Evolutionary Approach for Solving Multi-Objective Facility Layout Problem". In Neural Information Processing, 159–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10684-2_18.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Ripon, Kazi Shah Nawaz, Kyrre Glette, Mats Høvin e Jim Torresen. "A Genetic Algorithm to Find Pareto-optimal Solutions for the Dynamic Facility Layout Problem with Multiple Objectives". In Neural Information Processing. Theory and Algorithms, 642–51. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-17537-4_78.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Nagarajan, Lenin, Siva Kumar Mahalingam, Gurusamy Selvakumar e Jayakrishna Kandasamy. "Solution for Multi-Objective Single Row Facility Layout Problem Using PSO Algorithm". In Advances in Civil and Industrial Engineering, 214–42. IGI Global, 2021. http://dx.doi.org/10.4018/978-1-7998-7206-1.ch014.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

An optimized facility layout design helps to ensure a high level of machine usability along with minimum cost and good performance. However, facility layout is a multi-objective design optimization problem, and as such, it is difficult to solve. This original research work aims to design an optimal linear machine sequence using particle swarm optimization algorithm that minimizes the following: the total investment cost of machines, the total number of machines in the final sequence, the total flow time of the products, and the total flow distance of the products. The effectiveness of the proposed algorithm is demonstrated with a reasonable number of problems. Maximum of 19.1% reduction in total flow distance of products, 12.8% reduction in total investment cost of machines, 28.4% reduction in total flow time of products, and reduction of two numbers of machines in the layout are achieved by proposed method compared with the previous approaches.

Takei, A., R. Nishiura, T. Oka, S. Hayano e Y. Saito. "Optimal sensor layout for minimum norm approach to searching for radioactive source distribution -One dimensional case-". In Inverse Problems in Engineering Mechanics, 503–8. Elsevier, 1998. http://dx.doi.org/10.1016/b978-008043319-6/50057-1.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Ochoa-Zezzatti, Alberto, Tania Olivier, Raymundo Camarena, Guadalupe Gutiérrez, Daniel Axpeitia e Irving Vázque. "Intelligent Drones Improved With Algae Algorithm". In Handbook of Research on Emergent Applications of Optimization Algorithms, 279–97. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-2990-3.ch012.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

Implement an optimal arrangement of equipment, instrumentation and medical personnel based on the weight and balance of the aircraft and transfer humanitarian aid in a Drone, by implementing artificial intelligence algorithms. This due to the problems presented by geographical layout of human settlements in southeast of the state of Chihuahua. The importance of this research is to understand from a Multivariable optimization associated with the path of a group of airplanes associated with different kind of aerial improve the evaluate flooding and send medical support and goods to determine the optimal flight route involve speed, storage and travel resources for determining the cost benefit have partnered with a travel plan to rescue people, which has as principal basis the orography airstrip restriction, although this problem has been studied on several occasions by the literature failed to establish by supporting ubiquitous computing for interacting with the various values associated with the achievement of the group of drones and their cost-benefit of each issue of the company and comparing their individual trips for the rest of group. There are several factors that can influence in the achievement of a group of Drones for our research we propose to use a Bioinspired Algorithm.

Ochoa Ortiz-Zezzatti, Alberto, Tania Olivier, Raymundo Camarena, Guadalupe Gutiérrez, Daniel Axpeitia e Irving Vázque. "Intelligent Drones Improved With Algae Algorithm". In Unmanned Aerial Vehicles, 1–19. IGI Global, 2019. http://dx.doi.org/10.4018/978-1-5225-8365-3.ch001.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

Lurie, K. A. "DIRECT RELAXATION OF OPTIMAL LAYOUT PROBLEMS FOR PLATES11This paper is dedicated to Professor Frithiof I. Niordson on the occasion of his 70th birthday. The research has been supported by AFOSR Grant No. 90-0268. The author acknowledges fruitful discussions with Robert P. Lipton." In Optimal Design with Advanced Materials, 425–45. Elsevier, 1993. http://dx.doi.org/10.1016/b978-0-444-89869-2.50033-0.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Atti di convegni sul tema "Optimal Layout Problems":

Bénabès, Julien, Benoît Guédas, Emilie Poirson e 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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

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.

Be´nabe`s, Julien, Emilie Poirson, Fouad Bennis e 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.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

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.

Fu, Yong, e Hae Chang Gea. "Optimal Layout of Shell Stiffeners With Frequency Design Considerations". In ASME 1995 Design Engineering Technical Conferences collocated with the ASME 1995 15th International Computers in Engineering Conference and the ASME 1995 9th Annual Engineering Database Symposium. American Society of Mechanical Engineers, 1995. http://dx.doi.org/10.1115/detc1995-0032.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

Abstract In this paper, a new method to design the layout of shell stiffeners is introduced. This new approach has been derived from a two-phase spherical micro-inclusions model and resulted in very simple closed-form expressions for the effective material properties. The “relaxed” topology optimization problem can then be solved by general mathematical programming tools. It is very common to experience the eigenvalue switchover when solving topology optimization problems with frequency design considerations. An incremental objective function formulation with two strategies were studied to reduce the oscillation of optimization solutions. Design Examples are presented and compared.

Szykman, Simon, e Jonathan Cagan. "A Simulated Annealing-Based Approach to Three Dimensional Component Packing". In ASME 1994 Design Technical Conferences collocated with the ASME 1994 International Computers in Engineering Conference and Exhibition and the ASME 1994 8th Annual Database Symposium. American Society of Mechanical Engineers, 1994. http://dx.doi.org/10.1115/detc1994-0140.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

Abstract This paper introduces a computational approach to three dimensional component layout that employs simulated annealing to generate optimal solutions. Simulated annealing has been used extensively for two dimensional layout of VLSI circuits; this research extends techniques developed for two dimensional layout optimization to three dimensional problems which are more representative of mechanical engineering applications. In many of these applications, miniaturization trends increase the need to achieve higher packing density and fit components into smaller containers. This research addresses the three dimensional packing problem, which is a subset of the general component layout problem, as a framework in which to solve general layout problems.

Fujita, Kikuo, Shinsuke Akagi e Noriyasu Hirokawa. "Hybrid Approach for Optimal Nesting Using a Genetic Algorithm and a Local Minimization Algorithm". In ASME 1993 Design Technical Conferences. American Society of Mechanical Engineers, 1993. http://dx.doi.org/10.1115/detc1993-0337.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

Abstract In layout design problems including blank nesting, the positions and directions of layout elements must be determined so as to minimize the total space. It is difficult and computationally time-consuming to find the optimal solution for such layout problems, because they include a lot of underlying combinational conditions. In this paper, we present an approach for optimal nesting by combining a genetic algorithm and a local minimization algorithm. In the approach, the genetic algorithm is used for handling the combinations which are represented in the string, and the local minimization algorithm is used for determining the embodiment layout under the fixed combinations so as to minimize the scrap volume which is corresponding to the fitness value in the genetic algorithm. And we present an example for showing the effective nesting result produced by this approach.

Wang, C. M., Z. J. Yao, A. M. Hee e W. L. Tan. "Optimal Layout of Gill Cells for Very Large Floating Structures". In ASME 2007 26th International Conference on Offshore Mechanics and Arctic Engineering. ASMEDC, 2007. http://dx.doi.org/10.1115/omae2007-29762.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

This paper is concerned with the optimal layout of gill cells for minimizing the differential deflection of a very large floating structure under a non-uniform load distribution over the surface of the structure. Gill cells are compartments in the floating structure where the bottom surface is perforated to allow water to flow freely in and out. At the locations of these gill cells, the buoyancy forces are eliminated. When placed appropriately, these gill cells are very cost effective in minimizing the differential deflection of the loaded structure. So the optimal layout of the gill cells is a very important design consideration. In this paper, the modeling of a very large floating structure with gill cells is developed and a computational method based on genetic algorithms for seeking the locations of a given number of gill cells is presented. The model and optimization technique are demonstrated on a floating structure which carries a heavy load in its central portion of the structure. Resulting from the non-uniform heavy load on the structure, the differential deflection may cause operational problems for equipments which are sensitive to tilting. Using gill cells that are positioned optimally, it will be shown that the differential deflection can be considerably minimized.

Quan, Ning, e Harrison Kim. "A Tight Upper Bound for Grid-Based Wind Farm Layout Optimization". In ASME 2016 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/detc2016-59712.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

This paper uses the method developed by Billionnet et al. (1999) to obtain tight upper bounds on the optimal values of mixed integer linear programming (MILP) formulations in grid-based wind farm layout optimization. The MILP formulations in grid-based wind farm layout optimization can be seen as linearized versions of the 0-1 quadratic knapsack problem (QKP) in combinatorial optimization. The QKP is NP-hard, which means the MILP formulations remain difficult problems to solve, especially for large problems with grid sizes of more than 500 points. The upper bound method proposed by Billionnet et al. is particularly well-suited for grid-based wind farm layout optimization problems, and was able to provide tight optimality gaps for a range of numerical experiments with up to 1296 grid points. The results of the numerical experiments also suggest that the greedy algorithm is a promising solution method for large MILP formulations in grid-based layout optimization that cannot be solved using standard branch and bound solvers.

Gamot, Juliette, Mathieu Balesdent, Romain Wuilbercq, Arnault Tremolet, Nouredine Melab e El-Ghazali Talbi. "Two-Level Algorithm Combining Bayesian Optimization and Swarm Intelligence for Variable-Size Optimal Layout Problems". In GECCO '23 Companion: Companion Conference on Genetic and Evolutionary Computation. New York, NY, USA: ACM, 2023. http://dx.doi.org/10.1145/3583133.3596997.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Yin, Su, e Jonathan Cagan. "A Pattern Search-Based Algorithm for Three-Dimensional Component Layout". In ASME 1998 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1998. http://dx.doi.org/10.1115/detc98/dac-5582.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

Abstract A pattern search-based algorithm is introduced for efficient component layout optimization. The algorithm is applicable to general layout problems, where component geometry can be arbitrary, design goals can be multiple and spatial constraint satisfactions can be of different types. Extensions to pattern search are introduced to help the algorithm to converge to optimal solutions by escaping inferior local minima. The performance on all of the test problems shows that the algorithm runs one-to-two orders of magnitude faster than a robust simulated annealing-based algorithm for results with the same quality. The algorithm is further extended to solve a concurrent layout and routing problem, which demonstrates the ability of the algorithm to apply new pattern strategies in search and to include different objective functions in optimization.

Yu, Chan, e Souran Manoochehri. "Overlap Detection Using Minkowski Sum in Two-Dimensional Layout". In ASME 1999 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1999. http://dx.doi.org/10.1115/detc99/dac-8570.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

Abstract In optimal layout problems, which are often demanded by many industries, it is desired to have new computer-based approaches that are fast and effective. To determine the overall speed of layout procedure, one has to consider not only the search algorithm but also the performance of overlap detection algorithm. In this paper, a new methodology of detecting an overlap in two-dimensional layout problem is presented. This method introduces the concept of Minkowski sum, which is defined as an algebraic sum of two point sets, to the overlap detection. Using mathematical relations, the algorithm can rapidly detect if two convex objects are overlapping, fully contained or separated. Fast detection of overlaps eventually allows user to accelerate the overall speed of layout algorithms. In addition, to obtain the robustness of this method it is being extended to the cases involving irregular-shaped non-convex objects.