Designing for Mass Customization Housing through Generative Design

This research proposal aims to investigate computational design strategies for sustainable, affordable, and more equitable housing. The study will focus on the use of generative design tools, such as parametric modeling, rule-based modeling, and optimization, to aid architects and designers in creating custom housing complexes for single families in small and medium urban lots. The goal is to develop a computational method that considers sustainability, affordability, and long-term usage parameters to create housing designs that meet the desired spatial qualities. The research question asks how generative design tools can support designers in approaching affordable housing given the increasing demand for it. The study will explore a modular grid-based design approach to ensure consistency and alignment and establish connections between individual spaces to form a complete house floor plan. The proposed research will consider site constraints and analyze existing buildings, trees, and zoning regulations to tailor the aggregation system. The stochastic aggregation component will generate numerous floor plans, and the optimization component will cherry-pick specific floor plans based on the requirements to evaluate the most suitable floor plans for any given scenario

Designing for Mass Customization Housing through Generative Design

This research proposal aims to investigate computational design strategies for sustainable, affordable, and more equitable housing. The study will focus on the use of generative design tools, such as parametric modeling, rule-based modeling, and optimization, to aid architects and designers in creating custom housing complexes for single families in small and medium urban lots. The goal is to develop a computational method that considers sustainability, affordability, and long-term usage parameters to create housing designs that meet the desired spatial qualities. The research question asks how generative design tools can support designers in approaching affordable housing given the increasing demand for it. The study will explore a modular grid-based design approach to ensure consistency and alignment and establish connections between individual spaces to form a complete house floor plan. The proposed research will consider site constraints and analyze existing buildings, trees, and zoning regulations to tailor the aggregation system. The stochastic aggregation component will generate numerous floor plans, and the optimization component will cherry-pick specific floor plans based on the requirements to evaluate the most suitable floor plans for any given scenario

A Review on Software Architecture Optimization Methods

Due to the remarkable mechanical request for programming frameworks, the expansion of the uncertainty, the quality requirements and quality of testing, the programming engineering configuration has been transformed into essential progression movement and the examination site is developing rapidly. In the recent decades, programming engineering involves improved technologies, which means to organize a scan for design outline for an arrangement of value attributes, have multiplied. In any case, the results shown are divided into different research groups, many framework areas and different quality features. Coming about the inclusion of current research, we have played a well-structured writing survey and have broken the result of various check-sheets of different research groups. Considering this study, a scientific classification has been done which is used for current research. Apart from this, the effective investigation of the examination writing given in this audit is expected to help in exploration and merging the current research endeavors and inferring an examination plan for future advancements

Large-scale parallelism for constraint-based local search: the costas array case study

International audienceWe present the parallel implementation of a constraint-based Local Search algorithm and investigate its performance on several hardware plat-forms with several hundreds or thousands of cores. We chose as the basis for these experiments the Adaptive Search method, an efficient sequential Local Search method for Constraint Satisfaction Problems (CSP). After preliminary experiments on some CSPLib benchmarks, we detail the modeling and solving of a hard combinatorial problem related to radar and sonar applications: the Costas Array Problem. Performance evaluation on some classical CSP bench-marks shows that speedups are very good for a few tens of cores, and good up to a few hundreds of cores. However for a hard combinatorial search problem such as the Costas Array Problem, performance evaluation of the sequential version shows results outperforming previous Local Search implementations, while the parallel version shows nearly linear speedups up to 8,192 cores. The proposed parallel scheme is simple and based on independent multi-walks with no communication between processes during search. We also investigated a cooperative multi-walk scheme where processes share simple information, but this scheme does not seem to improve performance

Almost Envy-Free Allocations with Connected Bundles

We study the existence of allocations of indivisible goods that are envy-free up to one good (EF1), under the additional constraint that each bundle needs to be connected in an underlying item graph G. When the items are arranged in a path, we show that EF1 allocations are guaranteed to exist for arbitrary monotonic utility functions over bundles, provided that either there are at most four agents, or there are any number of agents but they all have identical utility functions. Our existence proofs are based on classical arguments from the divisible cake-cutting setting, and involve discrete analogues of cut-and-choose, of Stromquist\u27s moving-knife protocol, and of the Su-Simmons argument based on Sperner\u27s lemma. Sperner\u27s lemma can also be used to show that on a path, an EF2 allocation exists for any number of agents. Except for the results using Sperner\u27s lemma, all of our procedures can be implemented by efficient algorithms. Our positive results for paths imply the existence of connected EF1 or EF2 allocations whenever G is traceable, i.e., contains a Hamiltonian path. For the case of two agents, we completely characterize the class of graphs G that guarantee the existence of EF1 allocations as the class of graphs whose biconnected components are arranged in a path. This class is strictly larger than the class of traceable graphs; one can check in linear time whether a graph belongs to this class, and if so return an EF1 allocation

A Heuristic Approach to the Theater Distribution Problem

Analysts at USTRANSCOM are tasked with providing vehicle mixtures that will support the distribution of requirements as provided in the form of TPFDD. An integer programming model exists to search for optimal solutions to these problems, but it is fairly time consuming, and produces only one of potentially several good quality solutions. This research constructs a number of heuristic approaches to solving the TDP. Two distinct shipping methods are examined and applied through both constructive and probabilistic vehicle assignment processes. Multistart metaheuristic approaches are designed and used in conjunction with the constructive and probabilistic approaches. Random TPFDDs of size 20, 100 and 1000 are tested, and solutions are compared to those obtained by the integer programming approach. The heuristic models implemented in this research develop feasible solutions to the notional TPFDDs in less time than the integer program. They can very quickly identify a number of good quality solutions to the same problem