To see the other types of publications on this topic, follow the link: Dynamic layout.

Journal articles on the topic 'Dynamic layout'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Dynamic layout.'

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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Adeyeri, Michael Kanisuru, and Sesan Peter Ayodeji. "Comparative analysis of static and dynamic facility layouts design using the modeling of plantain flour as case study." Production Engineering Archives 28, no. 1 (February 12, 2022): 12–20. http://dx.doi.org/10.30657/pea.2022.28.02.

Full text
Abstract:
Abstract Profit optimization at the expense of minimal resource utilization for product development has been the major focus of prospective investors. In an attempt to realize this goal, the present research consideration is tailored towards investigating the effect of introducing dynamic facility layout design. Therefore, this research study uses an existing designed plantain flour processing plant that consists of a washing machine, grating machine, dryer, milling machine and sieving machine. Modeling techniques incorporated with software development were employed on the existing static plant layout to optimize production time and cost of each of the processing units along with the layout. Also, dynamic constraints were introduced into the layouts while mathematical models were formulated to visualize how the output and production process would be. With these models, software for the optimization of static and dynamic layouts was developed. The comparative study was carried out based on the processing time, the number of machines needed for each layout type, the cost of operation and machine procurement cost for both static and dynamic layouts. The constraints introduced ensured that the system improved within the cost limit based on the current market situation and prevented unnecessary enlargement in the plant facility size while minimizing material congestion in the system. The distinction between static and dynamic layout configurations was further established by comparing the results from the layout configurations for a set of throughput masses ranging from 50 kg to 250 kg. Results showed that the cost of operation drops drastically by 69.6 % under dynamic layout configuration.
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
3

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

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
4

Mohan, T. V. Krishna, and V. Madhusudanan Pillai. "Detailed Dynamic Layout Planning: An Adaptive Layout Approach." IFAC Proceedings Volumes 46, no. 9 (2013): 2027–32. http://dx.doi.org/10.3182/20130619-3-ru-3018.00556.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Tommelein, I. D., and P. P. Zouein. "Interactive Dynamic Layout Planning." Journal of Construction Engineering and Management 119, no. 2 (June 1993): 266–87. http://dx.doi.org/10.1061/(asce)0733-9364(1993)119:2(266).

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Noll, Matias, Cláudia Tarragô Candotti, Bruna Nichele da Rosa, Juliana Adami Sedrez, Adriane Vieira, and Jefferson Fagundes Loss. "Layout for Assessing Dynamic Posture." Pediatric Physical Therapy 28, no. 4 (2016): 435–44. http://dx.doi.org/10.1097/pep.0000000000000292.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Hunagund, Irappa Basappa, V. Madhusudanan Pillai, and Ujjani Nagegowda Kempaiah. "Design of robust layout for unequal area dynamic facility layout problems with flexible bays structure." Journal of Facilities Management 18, no. 4 (August 24, 2020): 361–92. http://dx.doi.org/10.1108/jfm-04-2020-0028.

Full text
Abstract:
Purpose The purpose of this paper is to develop a mathematical model for the design of robust layout for unequal area-dynamic facility layout problem with flexible bay structure (UA-DFLP with FBS) and test the suitability of generated robust layout in a dynamic environment. Design/methodology/approach This research adopts formulation of a mathematical model for generating a single layout for unequal area facility layout problems with flexible bay structure under dynamic environment. The formulated model for the robust layout formation is solved by developing a simulated annealing algorithm. The proposed robust approach model for UA-DFLP with FBS is validated by conducting numerical experiments on standard UA-DFLPs reported in the literature. The suitability of the generated robust layout in a dynamic environment is tested with total penalty cost criteria. Findings The proposed model has given a better solution for some UA-DFLPs with FBS in comparison with the adaptive approach’s solution reported in the literature. The total penalty cost is within the specified limit given in the literature, for most of the layouts generated for UA-DFLPs with FBS. In the proposed model, there is no rearrangement of facilities in various periods of planning horizon and thus no disruptions in operations. Research limitations/implications The present work has limitations that when the area and aspect ratio of the facilities are required to change from one period to another, then it is not possible to make application of the robust approach-based formulation to the dynamic environment facility layout problems. Practical implications Rearrangement of facilities in adaptive approach disrupts the operations whereas in the proposed approach no disruption of production. The FBS approach is more suitable for layout planning where proper aisle structure is required. The solution of the proposed approach helps to create a proper aisle structure in the detailed layout plan. Thus, easy interaction of the material handling equipment, men and materials is possible. Originality/value This paper proposes a mathematical formulation for the design of robust layout for UA-FLPs with FBS in a dynamic environment and an efficient simulated annealing algorithm as its solution procedure. The proposed robust approach generates a single layout for the entire planning horizon. This approach is more useful for facilities which are difficult/sensitive to relocate in various periods of the planning horizon.
APA, Harvard, Vancouver, ISO, and other styles
9

Archambault, Daniel, and Helen C. Purchase. "On the effective visualisation of dynamic attribute cascades." Information Visualization 15, no. 1 (April 6, 2015): 51–63. http://dx.doi.org/10.1177/1473871615576758.

Full text
Abstract:
Cascades appear in many applications, including biological graphs and social media analysis. In a cascade, a dynamic attribute propagates through a graph, following its edges. We present the results of a formal user study that tests the effectiveness of different types of cascade visualisations on node-link diagrams for the task of judging cascade spread. Overall, we found that a small multiples presentation was significantly faster than animation with no significant difference in terms of error rate. Participants generally preferred animation over small multiples and a hierarchical layout to a force-directed layout. Considering each presentation method separately, when comparing force-directed layouts to hierarchical layouts, hierarchical layouts were found to be significantly faster for both presentation methods and significantly more accurate for animation. Representing the history of the cascade had no significant effect. Thus, for our task, this experiment supports the use of a small multiples interface with hierarchically drawn graphs for the visualisation of cascades. This work is important because without these empirical results, designers of dynamic multivariate visualisations (in many applications) would base their design decisions on intuition with little empirical support as to whether these decisions enhance usability.
APA, Harvard, Vancouver, ISO, and other styles
10

Elmalich, Dvir, and Oded Rabinovitch. "Fiber Orientation Effect in the Dynamic Buckling of Debonded Regions in Laterally Loaded FRP Strengthened Walls." Key Engineering Materials 624 (September 2014): 470–77. http://dx.doi.org/10.4028/www.scientific.net/kem.624.470.

Full text
Abstract:
This paper studies the effect of lamination and fiber orientation on the geometrically nonlinear dynamic response of debonded regions in walls strengthened with FRP. The paper adopts an analytical/numerical approach and uses a specially tailored finite element formulation for the layered structure. By means of this analytical/numerical tool, two strengthening layouts for a wall segment subjected to a dynamic shear loading are compared. In the first layout, the fibers are oriented along the width and height of the segment and in the second one, they are oriented along its diagonals. The analysis reveals that the two layouts are involved with significantly different critical points and significantly different dynamic post-buckling behaviors. Specifically, it shows that the diagonal layout, which better serves the shear loading scenario, is involved with a much smaller critical displacement and a dynamic post-buckling behavior that is governed by the stiffer compressed and tensed diagonals.
APA, Harvard, Vancouver, ISO, and other styles
11

Chen, Yan, Xiao-Xiang He, Yang Yang, Heng-Yan Hu, Fu-Kang Li, and Lei Yang. "Dynamic RCS Reduction Performances of Antenna Array with Coding Metasurface." International Journal of Antennas and Propagation 2022 (March 14, 2022): 1–12. http://dx.doi.org/10.1155/2022/4644566.

Full text
Abstract:
On the basis of combining the two concepts of digital coding metasurface and metasurface antenna, low radar cross-section (RCS) coding metasurface antenna array with dynamic scattering performances is presented in this paper. Extending scattering factor theory to coding metasurface antenna, by controlling the states of PIN diodes randomly, the scattering performances of coding metasurface antenna array can be tuned dynamically without degrading its radiation property. Based on phase cancellation principle, a 8 × 8 antenna array was finally simulated and fabricated. By comparing several different layouts, taking checkerboard layout, new chessboard layout, and “0101” square ring nested layout as examples, both monostatic and bistatic RCS of the antenna mentioned above can be reduced 10 dB or more in the frequency range of 9–10.5 GHz under the illumination of x-polarized incident wave. The measured data are consistent with the simulation data, which proves the effectiveness of the proposed method.
APA, Harvard, Vancouver, ISO, and other styles
12

Gonzalez, Teofilo F., and Si-Qing Zheng. "On Ensuring Multilayer Wirability by Stretching Layouts." VLSI Design 7, no. 4 (January 1, 1998): 365–83. http://dx.doi.org/10.1155/1998/14757.

Full text
Abstract:
Every knock-knee layout is four-layer wirable. However, there are knock-knee layouts that cannot be wired in less than four layers. While it is easy to determine whether a knock-knee layout is one-layer wirable or two-layer wirable, the problem of determining three-layer wirability of knock-knee layouts is NP-complete. A knock-knee layout may be stretched vertically (horizontally) by introducing empty rows (columns) so that it can be wired in fewer than four layers. In this paper we discuss two different types of stretching schemes. It is known that under these two stretching schemes, any knock-knee layout is three-layer wirable by stretching it up to (4/3) of the knock-knee layout area (upper bound). We show that there are knock-knee layouts that when stretched and wired in three layers under scheme I (II) require at least 1.2 (1.07563) of the original layout area. Our lower bound for the area increase factor can be used to guide the search for effective stretching-based dynamic programming three-layer wiring algorithms similar to the one presented in [8].
APA, Harvard, Vancouver, ISO, and other styles
13

El-Rayes, Khaled, and Hisham Said. "Dynamic Site Layout Planning Using Approximate Dynamic Programming." Journal of Computing in Civil Engineering 23, no. 2 (March 2009): 119–27. http://dx.doi.org/10.1061/(asce)0887-3801(2009)23:2(119).

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Uz, Mehmet Eren, Pezhman Sharafi, Mahya Askarian, Weiqing Fu, and Chunmei Zhang. "Automated layout design of multi-span reinforced concrete beams using charged system search algorithm." Engineering Computations 35, no. 3 (May 8, 2018): 1402–13. http://dx.doi.org/10.1108/ec-05-2017-0188.

Full text
Abstract:
Purpose The preliminary layout design of structures impacts upon the entire design process and, consequently, the total cost. The purpose of this paper is to select the most economical layouts that satisfy structural and architectural requirements, while considering the reciprocal effects of cost factors and layout variables at the preliminary stages of design. Design/methodology/approach This paper presents an automated method for cost optimization of geometric layout design of multi-span reinforced concrete (RC) beams subjected to dynamic loading by using the charged system search (CSS) algorithm. First, a novel cost optimization approach for geometric layout problems is introduced, in which both cost parameters and dynamic responses are considered in the preliminary layout design of beams. The proposed structural optimization problem with constraints on the static and dynamic equilibrium, architectural dimensions and structural action effects is solved using the CSS algorithm. Findings The proposed CSS algorithm for solving the cost optimization problem can be easily used for optimizing the span lengths and is also capable of working with various cost functions. The presented examples show that the proposed algorithm using the new cost optimization function provides satisfactory results and can result in over 7 per cent cost saving. Originality/value This is an original paper proposing a novel methodology for preliminary layout design of concrete beams.
APA, Harvard, Vancouver, ISO, and other styles
15

Zhang, Xiaodong, Hongli Zhou, and Dongfang Zhao. "Layout Optimization of Flexible Manufacturing Cells Based on Fuzzy Demand and Machine Flexibility." Mathematical Problems in Engineering 2018 (November 12, 2018): 1–12. http://dx.doi.org/10.1155/2018/4018628.

Full text
Abstract:
Layout flexibility is critical for the performance of flexible manufacturing cells, especially in dynamic production environment. To improve layout flexibility, layout optimization should consider more flexible factors based on existed models. On the one hand, not only should the current production demands be covered, but also the future uncertain demands should be considered so that the cell can adapt to the dynamic changes in a long term. On the other hand, the flexibility of machines should be balanced in the layout in order to guarantee that the cell can deal with dynamic new product introduction. Starting from these two points, we formulate a layout optimization model based on fuzzy demand and machine flexibility and then develop a genetic algorithm with bilayer chromosome to solve the model. We apply this new model to a flexible cell of shell products and test its performance by comparing it with the classical two-stage model. The total logistics path of the new model is shown to be significantly shorter than the classical model. Then we carry out adaptability experiments to test the flexibility of the new model. For the dynamic situation of both the fluctuation of production demands and the introduction of new products, the new model shows obvious advantages to the classical model. The results indicate that this advantage becomes greater as the dynamics becomes greater, which implies that considering fuzzy demand and machine flexibility is necessary and reasonable in layout optimization, especially when the dynamics of the production environment is dramatic.
APA, Harvard, Vancouver, ISO, and other styles
16

Balakrishnan, Jaydeep, Chun Hung Cheng, and Chun Ming Lau. "Modelling rearrangement constraints in dynamic layout." International Journal of Industrial and Systems Engineering 15, no. 4 (2013): 373. http://dx.doi.org/10.1504/ijise.2013.057475.

Full text
APA, Harvard, Vancouver, ISO, and other styles
17

Balakrishnan, S., and S. K. Nandy. "Quasi dynamic approach to layout compaction." Microprocessing and Microprogramming 30, no. 1-5 (August 1990): 231–36. http://dx.doi.org/10.1016/0165-6074(90)90246-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

Suo, Xiao Hong, and Zhan Qiang Liu. "Relationships among SFLP, DFLP and Robust Layout." Applied Mechanics and Materials 10-12 (December 2007): 235–41. http://dx.doi.org/10.4028/www.scientific.net/amm.10-12.235.

Full text
Abstract:
Facility layout plays an important role in the performance of manufacturing systems. Firstly, this paper describes the derivations and classification of facility layout problem (FLP). The concepts of static facility layout problem (SFLP), dynamic facility layout problem (DFLP) and robust layout problem are introduced, and their main performance characteristics are compared with each other. Then, the procedure of rearrangement costs in DFLP is proposed. Some main characteristics of SFLP and DFLP, DFLP and robust layout are compared respectively. Lastly, the difference and connection among SFLP, DFLP and robust layout are analyzed. The research results indicate that the dynamic facility layout and robust layout are suitable for the dynamic and changeable manufacturing systems. The method for development of DFLP and its implementation are presented based on SFLP and robust layout.
APA, Harvard, Vancouver, ISO, and other styles
19

Roy, Ananya, Moinul Hossain, and Yasunori Muromachi. "Enhancing the Prediction Performance of Real-Time Crash Prediction Models: A Cell Transmission-Dynamic Bayesian Network Approach." Transportation Research Record: Journal of the Transportation Research Board 2672, no. 38 (September 24, 2018): 58–68. http://dx.doi.org/10.1177/0361198118797802.

Full text
Abstract:
Predicting crash probability in real time is a concept that has inspired studies into complex modeling methods, exploring more sophisticated data collection methods, reducing specification errors by introducing new traffic variables, etc. Most existing real-time crash prediction models (RTCPMs) are based on loop detector data and the model architecture, and their prediction performances are sensitive to the location and layout of detectors with respect to crashes, that is, the spacing of detectors on the road section. Different expressways/freeways have different detector layouts and these vary substantially even within the same expressway/freeway. This limitation is a major obstacle in developing a universal RTCPM. To address this, this paper takes one-minute aggregated loop detector data along with detector layouts as input and employs a cell transmission model (CTM) to interpolate states of traffic flow variables for a pre-defined hypothetical detector layout. Next, several RTCPMs are constructed using Bayesian networks (BNs) and dynamic Bayesian networks (DBNs) for existing and CTM-based detector layouts. It is observed that the CTM can generate traffic flow parameters with a mean percentage error of 12.96%. The results further suggest that the model constructed with the CTM-based uniformly spaced simulated detector data coupled with the DBN method performed better than the model based on the BN and existing non-uniform detector layout.
APA, Harvard, Vancouver, ISO, and other styles
20

Yao, Yi Yong, Li Ping Zhao, Guang Zhou Diao, Hu Zhao, and Pen Yan. "Research about Dynamic Performance Prediction for Layout Structure of Globoidal Cam Machine." Applied Mechanics and Materials 607 (July 2014): 321–24. http://dx.doi.org/10.4028/www.scientific.net/amm.607.321.

Full text
Abstract:
Aiming to the layout structure design and performance prediction for globoidal cam machine, a dynamic performance prediction method for machine layout structure is proposed in this paper. With the method, the motion transmission and layout structure are determined based on the mapping rules between function and structure. The prediction model for dynamic performance is established based on BP neural network, which is used to optimize the dynamic performance of layout structure for globoibal cam machine.
APA, Harvard, Vancouver, ISO, and other styles
21

Yang, Cheng, Songkai Liu, and Zhigang Xu. "A simulation-based optimization method for facility layout considering the AGV path." Journal of Physics: Conference Series 2430, no. 1 (February 1, 2023): 012019. http://dx.doi.org/10.1088/1742-6596/2430/1/012019.

Full text
Abstract:
Abstract Aiming at the problem of facility layout in intelligent workshops, a collaborative optimization method of facility layout and AGV path planning based on discrete event simulation (DES) is proposed. This method can increase the production capacity of the workshop by solving the workshop open-field layout problem (OFLP). First, to simplify the complex constraints of OFLP, a mathematical programming model is established. Second, a hybrid algorithm is proposed to solve the optimal facility layout and the corresponding multiple AGV paths. Then, the DES is used to calculate the logistics data of the facility layout, and the capacity is taken as the algorithm objective function. Finally, a practical intelligent workshop layout problem is taken as a research case. The calculation results show that the capacity of the workshop is increased by 54% under the optimized layout. Through the special nonlinear integer programming mathematical model and discrete simulation modelling, the optimization method can take into account the complex dynamic logistics process and multiple AGV conflicts and give full play to the flexible and efficient characteristics of open-field layouts. The final workshop layout can not only be close to the actual situation but also have excellent performance.
APA, Harvard, Vancouver, ISO, and other styles
22

GEIPEL, MARKUS M. "SELF-ORGANIZATION APPLIED TO DYNAMIC NETWORK LAYOUT." International Journal of Modern Physics C 18, no. 10 (October 2007): 1537–49. http://dx.doi.org/10.1142/s0129183107011558.

Full text
Abstract:
As networks and their structure have become a major field of research, a strong demand for network visualization has emerged. We address this challenge by formalizing the well established spring layout in terms of dynamic equations. We thus open up the design space for new algorithms. Drawing from the knowledge of systems design, we derive a layout algorithm that remedies several drawbacks of the original spring layout. This new algorithm relies on the balancing of two antagonistic forces. We thus call it arf for "attractive and repulsive forces". It is, as we claim, particularly suited for a dynamic layout of smaller networks (n < 103). We back this claim with several application examples from ongoing complex systems research.
APA, Harvard, Vancouver, ISO, and other styles
23

Shi, Han, Nengjian Wang, Guo Wang, Qinhui Liu, and Yuncai Tai. "Reliability Calculation Method of Shipborne Vehicles’ Sortie Mission for Dynamic Network Structure." Computational Intelligence and Neuroscience 2022 (December 23, 2022): 1–12. http://dx.doi.org/10.1155/2022/8547961.

Full text
Abstract:
To provide decision support to the commander, it is necessary to calculate shipborne vehicles’ sortie mission reliability during the formulation of the layout plan. Therefore, this paper presents the sortie mission network model and reliability calculation method for shipborne vehicles. Firstly, the shipborne vehicle layout and sortie task characteristics are used to establish the sortie mission network model. The shipborne vehicles' sortie mission reliability problem is transformed into a two-terminal network reliability problem. Secondly, the minimal path set method is used to calculate the two-terminal network reliability. An improved tabu search algorithm based on a strategy of breaking up the whole into parts is proposed to search for the minimal path set that matches the length. Finally, the sum of disjoint products is used to process the minimal path set to obtain the shipborne vehicles’ sortie mission reliability calculation formula. A numerical analysis of two simplified shipborne vehicles’ layouts is given to illustrate the calculation process of the method. This study provides a new evaluation index and an effective quantitative basis for the evaluation system of shipborne vehicles’ layout. It also provides theoretical support for the development of decision-making related to the sortie mission of shipborne vehicles.
APA, Harvard, Vancouver, ISO, and other styles
24

AFENTAKIS, PANOS, ROBERT A. MILLEN, and MARIUS M. SOLOMON. "Dynamic layout strategies for flexible manufacturing systems." International Journal of Production Research 28, no. 2 (February 1990): 311–23. http://dx.doi.org/10.1080/00207549008942713.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

DYAKOV, I. F. "FORMALIZATION OF DYNAMIC THE LAYOUT OFTHE VEHICLE." World of transport and technological machines 67, no. 4 (December 2019): 25–33. http://dx.doi.org/10.33979/2073-7432-2019-67-4-25-33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

Gavriluță, Alin, Ana Gavriluță, Eduard-Laurențiu Nițu, and Jérémie Schutz. "From 3D layout to dynamic simulation model." MATEC Web of Conferences 112 (2017): 06020. http://dx.doi.org/10.1051/matecconf/201711206020.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

Taki, Hirokazu, Satoshi Hori, Kenzo Kobayashi, and Norihiro Abe. "Dynamic Constraint Control System for Layout Design." IFAC Proceedings Volumes 30, no. 25 (September 1997): 157–61. http://dx.doi.org/10.1016/s1474-6670(17)41317-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

Ulutas, Berna, and A. Attila Islier. "Dynamic facility layout problem in footwear industry." Journal of Manufacturing Systems 36 (July 2015): 55–61. http://dx.doi.org/10.1016/j.jmsy.2015.03.004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Klug, Kimberly, and Beth Currier. "Commentary on “Layout for Assessing Dynamic Posture." Pediatric Physical Therapy 28, no. 4 (2016): 445. http://dx.doi.org/10.1097/pep.0000000000000302.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

Erel, E., J. B. Ghosh, and J. T. Simon. "New heuristic for the dynamic layout problem." Journal of the Operational Research Society 54, no. 12 (December 2003): 1275–82. http://dx.doi.org/10.1057/palgrave.jors.2601646.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Balakrishnan, Jaydeep, and Chun Hung Cheng. "Genetic search and the dynamic layout problem." Computers & Operations Research 27, no. 6 (May 2000): 587–93. http://dx.doi.org/10.1016/s0305-0548(99)00052-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Braglia, Marcello, Simone Zanoni, and Lucio Zavanella. "Layout design in dynamic environments: analytical issues." International Transactions in Operational Research 12, no. 1 (January 2005): 1–19. http://dx.doi.org/10.1111/j.1475-3995.2005.00487.x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

Kulturel-Konak, Sadan. "The zone-based dynamic facility layout problem." INFOR: Information Systems and Operational Research 57, no. 1 (July 11, 2017): 1–31. http://dx.doi.org/10.1080/03155986.2017.1346915.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Zhu, Tianyuan, Jaydeep Balakrishnan, and Chun Hung Cheng. "Recent advances in dynamic facility layout research." INFOR: Information Systems and Operational Research 56, no. 4 (September 8, 2017): 428–56. http://dx.doi.org/10.1080/03155986.2017.1363591.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

Zha, Shanshan, Yu Guo, Shaohua Huang, Qi Wu, and Pengzhou Tang. "A hybrid optimization approach for unequal-sized dynamic facility layout problems under fuzzy random demands." Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture 234, no. 3 (November 11, 2019): 382–99. http://dx.doi.org/10.1177/0954405419883046.

Full text
Abstract:
Dynamic facility layout problems involve devising the optimal layout for each different production period. This article studies unequal-area dynamic facility layout problems under fuzzy random environment to minimize the sum of the material handling costs and rearrangement costs. For a more general situation, a novel model of unequal-area dynamic facility layout problems is proposed on the basis of fuzzy random theory, in which uncertain demands are characterized by fuzzy random variables. Unequal-area dynamic facility layout problems are one of the non-deterministic polynomial-time hard problems. Therefore, a hybrid particle swarm optimization and simulated annealing algorithm is innovated to solve the proposed unequal-area dynamic facility layout problems model under fuzzy random environment, in which the shapes and areas of facilities are changed dynamically. Two facility-swapping methods and two local search methods help hybrid algorithm escape from local optima, allowing a more reliable solution. Moreover, a new shifting method is developed to prevent the spatial overlapping between adjacent facilities and save material handling costs. The performance of the hybrid algorithm is confirmed by some test problems available. Finally, the proposed method is extended to a facility layout planning of a new aircraft assembly shop floor. Computational results show that the efficiency and effectiveness of the proposed method, in sharp comparison with other approaches.
APA, Harvard, Vancouver, ISO, and other styles
36

Peron, Mirco, Giuseppe Fragapane, Fabio Sgarbossa, and Michael Kay. "Digital Facility Layout Planning." Sustainability 12, no. 8 (April 20, 2020): 3349. http://dx.doi.org/10.3390/su12083349.

Full text
Abstract:
In recent years, companies have increased their focus on sustainability to achieve environmental-friendly improvements, to manage pressures from society and regulations, and to attract customers that appreciate sustainability efforts. While companies have mainly aimed short-term/operational improvements, long-term improvements are difficult to reach. One of the fundamental, strategical decision-making processes for a company is facility layout planning. The layout of a facility can have a significant impact on daily operations. Aiming for the goal of sustainability, a dynamic layout decision-making process can support in achieving it. However, the technologies used currently enable only the design of a static layout due to the time-consuming operations involved. In this paper, the introduction of emerging technologies such as 3D mapping, Indoor Positioning System (IPS), Motion Capture System (MoCap), and Immersive Reality (IR) for dynamic layout planning are assessed and discussed. The results obtained clearly demonstrate that the usage of these technologies favor a reconfigurable layout, positively affecting all the three pillars constituting the sustainability concept: the costs involved are reduced, social aspects are improved, and the environment is safeguarded.
APA, Harvard, Vancouver, ISO, and other styles
37

Li, Lingling, Congbo Li, Huijie Ma, and Ying Tang. "An Optimization Method for the Remanufacturing Dynamic Facility Layout Problem with Uncertainties." Discrete Dynamics in Nature and Society 2015 (2015): 1–11. http://dx.doi.org/10.1155/2015/685408.

Full text
Abstract:
Remanufacturing is a practice of growing importance due to increasing environmental awareness and regulations. Facility layout design, as the cornerstone of effective facility planning, is concerned about resource localization for a well-coordinated workflow that leads to lower material handling costs and reduced lead times. However, due to stochastic returns of used products/components and their uncontrollable quality conditions, the remanufacturing process exhibits a high level of uncertainty challenging the facility layout design for remanufacturing. This paper undertakes this problem and presents an optimization method for remanufacturing dynamic facility layout with variable process capacities, unequal processing cells, and intercell material handling. A dynamic multirow layout model is presented for layout optimization and a modified simulated annealing heuristic is proposed toward the determination of optimal layout schemes. The approach is demonstrated through a machine tool remanufacturing system.
APA, Harvard, Vancouver, ISO, and other styles
38

Zarea Fazlelahi, Forough, Mehrdokht Pournader, Mohsen Gharakhani, and Seyed Jafar Sadjadi. "A robust approach to design a single facility layout plan in dynamic manufacturing environments using a permutation-based genetic algorithm." Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture 230, no. 12 (August 8, 2016): 2264–74. http://dx.doi.org/10.1177/0954405415615728.

Full text
Abstract:
During the past few decades, developing efficient methods to solve dynamic facility layout problems has been focused on significantly by practitioners and researchers. More specifically meta-heuristic algorithms, especially genetic algorithm, have been proven to be increasingly helpful to generate sub-optimal solutions for large-scale dynamic facility layout problems. Nevertheless, the uncertainty of the manufacturing factors in addition to the scale of the layout problem calls for a mixed genetic algorithm–robust approach that could provide a single unlimited layout design. The present research aims to devise a customized permutation-based robust genetic algorithm in dynamic manufacturing environments that is expected to be generating a unique robust layout for all the manufacturing periods. The numerical outcomes of the proposed robust genetic algorithm indicate significant cost improvements compared to the conventional genetic algorithm methods and a selective number of other heuristic and meta-heuristic techniques.
APA, Harvard, Vancouver, ISO, and other styles
39

Yogaswara, Y., T. T. Dimiyati, and R. R. Asri. "Grouping Maching using Genetic Algorithm for Dynamic Cell Layout Design." Journal of Modern Manufacturing Systems and Technology 6, no. 1 (March 31, 2022): 1–8. http://dx.doi.org/10.15282/jmmst.v6i1.6893.

Full text
Abstract:
Changes in the manufacturing sector due to changes in shorter product life cycles, market demands and also use of the latest technology in the company, this will result in changes in process flow and also change the layout in the production section, causing dynamic layout problems. Dynamic layout problems can be solved by using a manufacturing cell formation method which has a high degree of flexibility. In this study, algorithms used for grouping machines into manufacturing cells are Direct Clustering Algorithm and Rank Order Clustering. Then it will be improved by using Genetic Algorithm. The Dynamic Modified Spanning Tree Algorithm is also used to sort machines into a layout with a single-row structure and determine the length of the planning time window in the future. The goals of this research is to get the best solution from the two methods of grouping machines/parts into manufacturing cells and to obtain improvement results using Genetic Algorithms. For the design industry, the resulting dynamic cell layout is expected to reduce production costs, save material handling, be efficient in material flow, which in turn will be able to compete globally.
APA, Harvard, Vancouver, ISO, and other styles
40

Qiu, Chengqun, Ang Chen, Yuqiu Xu, and Yujie Shen. "Optimal Design and Dynamic Performance Analysis of Vehicle Suspension Employing an Eccentric Inerter." Shock and Vibration 2022 (September 8, 2022): 1–11. http://dx.doi.org/10.1155/2022/6696788.

Full text
Abstract:
This paper concerns the dynamic performance analysis of the vehicle ISD (inerter-spring-damper) suspension employing an eccentric inerter. Firstly, the quarter car model of the two basic vehicle suspension layouts involving an eccentric inerter, namely, the series-connected layout and the parallel-connected layout, is established. Then, by considering the overall performance such as the vehicle body acceleration, the suspension working space, and the dynamic tire load, the key parameters of the two suspensions are optimized by using the genetic algorithm. Simulation analysis results indicate that the series-connected vehicle ISD suspension is superior to the parallel-connected one, and all of the RMS values of the body acceleration, the suspension working space, and the dynamic tire load are decreased significantly by comparing to the conventional suspension, while the improvement of the parallel-connected vehicle ISD suspension is relatively poor. At last, the impact of the flywheel eccentricity and the screw pitch on the dynamic performance indices of the two suspensions is discussed, and the trade-offs among the three performances are analyzed, which will provide a guide method for the suspension design when considering the eccentric factor.
APA, Harvard, Vancouver, ISO, and other styles
41

Niyazov, Aziz, Nicolas Mellado, Loic Barthe, and Marcos Serrano. "Dynamic Decals." Proceedings of the ACM on Human-Computer Interaction 5, ISS (November 3, 2021): 1–27. http://dx.doi.org/10.1145/3488538.

Full text
Abstract:
Pervasive interfaces can present relevant information anywhere in our environment, and they are thus challenged by the non rectilinearity of the display surface (e.g. circular table) and by the presence of objects that can partially occlude the interface (e.g. a book or cup on the table). To tackle this problem, we propose a novel solution based on two core contributions: the decomposition of the interface into deformable graphical units, called Dynamic Decals, and the control of their position and behaviour by a constraint-based approach. Our approach dynamically deforms the interface when needed while minimizing the impact on its visibility and layout properties. To do so, we extend previous work on implicit deformations to propose and experimentally validate functions defining different decal shapes and new deformers modeling decal deformations when they collide. Then, we interactively optimize the decal placements according to the interface geometry and their interrelations. Relations are modeled as constraints and the interface evolution results from an easy and efficient to solve minimization problem. Our approach is validated by a user study showing that, compared to two baselines, Dynamic decals is an aesthetically pleasant interface that preserves visibility, layout and aesthetic properties.
APA, Harvard, Vancouver, ISO, and other styles
42

Xie, Chuan, Weixing Yao, Danfa Zhou, and Caijun Xue. "Concurrent Sub-Region Collaborative Method for Static and Dynamic Coupled Layout Optimization of Stiffened Plates." Aerospace 10, no. 3 (March 9, 2023): 263. http://dx.doi.org/10.3390/aerospace10030263.

Full text
Abstract:
The main concern of the paper is the concurrent treatment of size and layout variables in the static–dynamic coupled layout optimization of stiffened plates. As compared to size optimization alone, layout optimization is a more challenging task, and the problem will become more difficult and complex if the coupling of statics and dynamics is then considered simultaneously. A concurrent sub-region collaborative (CSRC) optimization strategy is proposed in this paper based on the idea of concurrency in multidisciplinary design optimization. The core idea is to decompose the original complex problem into multiple sub-problems by decoupling twice and maintaining the connection with the original problem by sub-region coordination and consistency constraints. A dynamic driving function is added to the CSRC method to solve the problem of iteration difficulty in the feasible region of the collaborative optimization (CO) method, and the performance of the driving function is illustrated by a numerical test. Furthermore, an adaptive surrogate model (ASM) based on the benchmark sub-region is modeled, which improves the prediction accuracy and optimization speed. Finally, a static–dynamic coupled layout optimization of a metal stiffened plate is performed, and the result indicates that the CSRC method performs well on the given case, and its concurrency property makes it possible to not only enlarge the search space but also reduce a significant “wall-clock time” compared to the sequential strategy.
APA, Harvard, Vancouver, ISO, and other styles
43

Jiang, Hao, Siqi Wang, Huikun Bi, Xiaolei Lv, Binqiang Zhao, Zheng Wang, and Zhaoqi Wang. "Synthesizing Indoor Scene Layouts in Complicated Architecture Using Dynamic Convolution Networks." Proceedings of the ACM on Computer Graphics and Interactive Techniques 4, no. 1 (April 26, 2021): 1–16. http://dx.doi.org/10.1145/3451267.

Full text
Abstract:
Synthesizing indoor scene layouts is challenging and critical, especially for digital design and gaming entertainment. Although there has been significant research on the indoor layout synthesis of rectangular-shaped or L-shaped architecture, there is little known about synthesizing plausible layouts for more complicated indoor architecture with both geometric and semantic information of indoor architecture being fully considered. In this paper, we propose an effective and novel framework to synthesize plausible indoor layouts in various and complicated architecture. The given indoor architecture is first encoded to our proposed representation, called InAiR, based on its geometric and semantic information. The indoor objects are grouped and then arranged by functional blocks, represented by oriented bounding boxes, using dynamic convolution networks based on their functionality and human activities. Through comparisons with other approaches as well as comparative user studies, we find that our generated indoor scene layouts for diverse, complicated indoor architecture are visually indistinguishable, which reach state-of-the-art performance.
APA, Harvard, Vancouver, ISO, and other styles
44

Zhou, Ye. "Layout Optimization of Urban Cultural Space Construction Based on Forward Three-Layer Neural Network Model." Computational Intelligence and Neuroscience 2022 (June 3, 2022): 1–12. http://dx.doi.org/10.1155/2022/6558512.

Full text
Abstract:
The change of urban cultural space layout is a multi-variable, multi-objective, and restricted research process. The optimization of urban cultural space construction and layout is a multi-objective decision-making problem that needs to be solved urgently. Based on the forward three-layer neural network theory, this paper constructs an optimization model for the construction and layout of urban cultural space evaluation of the layout of cultural space. This paper first analyzes the feasibility of combining the forward three-layer neural network model with the optimization and adjustment of cultural space layout structure. Taking the three-layer feedforward network as an example, the structure optimization model based on the forward three-layer neural network is selected, and the established model is used to reflect the internal environment of the objective world. Structure and perform dynamic simulation. In the process of simulation modeling, from the aspects of system description, model structure, logical analysis, reasoning, and interpretation, two effective computer dynamic simulation methods, namely, forward three-layer neural network model and system dynamics SD model, were carried out for theoretical comparison and identification. The experimental results show that the feasibility and calculation error of the application of the optimization model are relatively good, reaching 0.897 and 6.21%, respectively. The number of newly added cultural spaces and the expansion speed show an increasing trend, expanding at an average annual speed of about 35 km2, effectively increasing the quality of regional planning and construction layout.
APA, Harvard, Vancouver, ISO, and other styles
45

Sheng, Shi-Ying, Sheng-Tao Chen, Xiao-Ju Dong, Chun-Yuan Wu, and Xiao-Ru Yuan. "Inverse Markov Process Based Constrained Dynamic Graph Layout." Journal of Computer Science and Technology 36, no. 3 (May 31, 2021): 707–18. http://dx.doi.org/10.1007/s11390-021-9910-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
46

Lacksonen, Thomas A. "Static and Dynamic Layout Problems with Varying Areas." Journal of the Operational Research Society 45, no. 1 (January 1994): 59. http://dx.doi.org/10.2307/2583951.

Full text
APA, Harvard, Vancouver, ISO, and other styles
47

LACKSONEN, T. A., and E. EMORY ENSCORE. "Quadratic assignment algorithms for the dynamic layout problem." International Journal of Production Research 31, no. 3 (March 1993): 503–17. http://dx.doi.org/10.1080/00207549308956741.

Full text
APA, Harvard, Vancouver, ISO, and other styles
48

Lacksonen, T. A. "Preprocessing for static and dynamic facility layout problems." International Journal of Production Research 35, no. 4 (April 1997): 1095–106. http://dx.doi.org/10.1080/002075497195560.

Full text
APA, Harvard, Vancouver, ISO, and other styles
49

GEIPEL, MARKUS M. "ERRATA: "SELF-ORGANIZATION APPLIED TO DYNAMIC NETWORK LAYOUT"." International Journal of Modern Physics C 19, no. 01 (January 2008): 203–4. http://dx.doi.org/10.1142/s0129183108012169.

Full text
APA, Harvard, Vancouver, ISO, and other styles
50

Liang, Weidong, and Dianjun Fang. "Decentralized Genetic Algorithm for Dynamic Plant Layout Problem." IOP Conference Series: Materials Science and Engineering 677 (December 10, 2019): 052080. http://dx.doi.org/10.1088/1757-899x/677/5/052080.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography