• Title/Summary/Keyword: All-solution-process

Search Result 728, Processing Time 0.028 seconds

Apartment house project cost schedule for integrated management BIM-based BoQ application plan (공동주택 프로젝트 비용일정통합 관리를 위한 BIM 기반 BoQ 구축 및 활용 방안)

  • Zheng, Lianyi;Kim, Woong-Gi;Ham, Nam-Hyuk;Kim, Jae-Jun
    • Journal of KIBIM
    • /
    • v.11 no.2
    • /
    • pp.1-16
    • /
    • 2021
  • Since entering the 21st century, the construction industry has developed faster and faster, and more and more technologies have been applied in the construction industry. BIM technology (Building Information Modeling) was born in this environment. The application of BIM technology can greatly improve the efficiency of cost management and help achieve the goal of cost management. But through BIM to realize project cost management, there is still no good solution. In order to solve this problem, this paper puts forward the concept of WBS structure applied to construction projects by studying the BoQ (Bill of Quantities) list based on BIM, and proposes the numbering method of the structure. The WBS (Work Breakdown Structure) structure proposed in this paper divides more than 5000 cost objects into 133 projects according to the type of work and project schedule. This structure helps to realize the application of BIM in project cost management. Although this article has studied more than 5000 data of three projects, it does not think that it can cover all cost objects in the existing construction industry. The purpose of this article is to propose a solution for cost and Process Control using BIM-based BoQ data.

Parcel Locker Locations and Dynamic Vehicle Routing Problem with Traffic Congestion (교통 체증을 고려한 물품 보관함 위치 및 동적 차량 경로 문제)

  • Chaehyun Kim;Gitae Kim
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.47 no.2
    • /
    • pp.168-175
    • /
    • 2024
  • Due to the complexity of urban area, the city vehicle routing problem has been a difficult problem. The problem has involved factors such as parking availability, road conditions, and traffic congestion, all of which increase transportation costs and delivery times. To resolve this problem, one effective solution can be the use of parcel lockers located near customer sites, where products are stored for customers to pick up. When a vehicle delivers products to a designated parcel locker, customers in the vicinity must pick up their products from that locker. Recently, identifying optimal locations for these parcel lockers has become an important research issue. This paper addresses the parcel locker location problem within the context of urban traffic congestion. By considering dynamic environmental factors, we propose a Markov decision process model to tackle the city vehicle routing problem. To ensure more real situations, we have used optimal paths for distances between two nodes. Numerical results demonstrate the viability of our model and solution strategy.

SAXS and AFM Study on Porous Silicon Prepared by Anodic Etching in HF-based Solution (SAXS와 AFM에 의한 HF-용액내 양극 에칭에 의해 제조된 기공성 실리콘의 구조연구)

  • Kim, Eu-gene;Kim, Hwa-Joong
    • Journal of the Korean Institute of Electrical and Electronic Material Engineers
    • /
    • v.17 no.11
    • /
    • pp.1218-1223
    • /
    • 2004
  • Porous silicon materials have been shown to have bright prospects for applications in light emitting, solar cell, as well as light- and chemical-sensing devices. In this report, structures of porous silicon prepared by anodic etching in HF-based solution with various etching times were studied in detail by Atomic Force Microscopy and Small Angle X -ray Scattering technique using the high energy beam line at Pohang Light Source in Korea. The results showed the coexistence of the various pores with nanometer and submicrometer scales. For nanameter size pores, the mixed ones with two different shapes were identified: the larger ones in cylindrical shape and the smaller ones in spherical shape. Volume fractions of the cylindrical and the spherical pores were about equal and remained unchanged at all etching times investigated. On the whole uniform values of the specific surface area and of the size parameters of the pores were observed except for the larger specific surface area for the sample with the short etching time. The results implies that etching process causes the inner surfaces to become smoother while new pores are being generated. In all SAXS data at large Q vectors, Porod slope of -4 was observed, which supports the fact that the pores have smooth surfaces.

A Shaking Optimization Algorithm for Solving Job Shop Scheduling Problem

  • Abdelhafiez, Ehab A.;Alturki, Fahd A.
    • Industrial Engineering and Management Systems
    • /
    • v.10 no.1
    • /
    • pp.7-14
    • /
    • 2011
  • In solving the Job Shop Scheduling Problem, the best solution rarely is completely random; it follows one or more rules (heuristics). The Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Simulated Annealing, and Tabu search, which belong to the Evolutionary Computations Algorithms (ECs), are not efficient enough in solving this problem as they neglect all conventional heuristics and hence they need to be hybridized with different heuristics. In this paper a new algorithm titled "Shaking Optimization Algorithm" is proposed that follows the common methodology of the Evolutionary Computations while utilizing different heuristics during the evolution process of the solution. The results show that the proposed algorithm outperforms the GA, PSO, SA, and TS algorithms, while being a good competitor to some other hybridized techniques in solving a selected number of benchmark Job Shop Scheduling problems.

Batch Scheduling of Incompatible Job Families with Sequence Independent Setup Times (공정 교체 시간을 고려한 배치작업의 일정계획)

  • 김주일;이영훈
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.26 no.2
    • /
    • pp.69-83
    • /
    • 2001
  • The problem of minimizing total tardiness on a batch processing machine with incompatible job families when there are sequence independent setup times between families is studied where all jobs of the same family have identical processing times and jobs of different families cannot be processed together. A batch processing machine can process a number of jobs, within a maximal batch size, simultaneously as a batch. The processing time required of each batch is equal to the one of jobs. A dynamic programming algorithm which gives the optimal solution, and several heuristics are presented. Performance of simple dispatching rules based on due dates are compared, and the best of them is used as an initial solution for the decomposition algorithm, which is shown to give good schedules in relatively short computational time.

  • PDF

An Effective Solution for the Multimedia Telephony Services in Evolving Networks

  • Kim, Jong-Deug;Jeon, Taehyun
    • International journal of advanced smart convergence
    • /
    • v.2 no.1
    • /
    • pp.24-26
    • /
    • 2013
  • In the process of a mobile network evolution to the All-IP, it is inevitable to experience a transient period embracing both circuit and packet based data traffics. At the stage of those hybrid networks, it is important to build them in an efficient manner in terms of resource utilization which is closely related to the overall system operation cost. Especially, the multimedia telephony is one of the essential services in the advanced packet based mobile networks. In this paper an effective method of system operation is proposed for building up the multimedia telephony service while the legacy network co-exists. The proposed solution is based on the careful investigation of the usage pattern of the multimedia services in the evolving networks. This method is also expected to be a useful guideline for the network resource planning.

A New Scheduling Algorithm for Semiconductor Manufacturing Process (반도체 제조공정을 위한 새로운 생산일정 알고리즘)

  • 복진광;이승권;문성득;박선원
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.4 no.6
    • /
    • pp.811-821
    • /
    • 1998
  • A new scheduling algorithm for large scale semiconductor processes is addressed. The difficulties of scheduling for semiconductor fabrication processes are mainly due from repeating production of wafers that experience reentrant flows. Sequence branch algorithm (SBA) is proposed for large real scheduling problems when all processing times are deterministic. The SBA is based on the reachability graph of Petri net of which the several defects such as memory consumption and system deadlock are complemented. Though the SBA shows the solution deviating a little from the optimal solution of mixed integer programming, it is adjustable for large size scheduling problems. Especially, it shows a potential that is capable of handling commercial size problems that are intractable with mathematical programming.

  • PDF

Genetic algorithms for balancing multiple variables in design practice

  • Kim, Bomin;Lee, Youngjin
    • Advances in Computational Design
    • /
    • v.2 no.3
    • /
    • pp.241-256
    • /
    • 2017
  • This paper introduces the process for Multi-objective Optimization Framework (MOF) which mediates multiple conflicting design targets. Even though the extensive researches have shown the benefits of optimization in engineering and design disciplines, most optimizations have been limited to the performance-related targets or the single-objective optimization which seek optimum solution within one design parameter. In design practice, however, designers should consider the multiple parameters whose resultant purposes are conflicting. The MOF is a BIM-integrated and simulation-based parametric workflow capable of optimizing the configuration of building components by using performance and non-performance driven measure to satisfy requirements including build programs, climate-based daylighting, occupant's experience, construction cost and etc. The MOF will generate, evaluate all different possible configurations within the predefined each parameter, present the most optimized set of solution, and then feed BIM environment to minimize data loss across software platform. This paper illustrates how Multi-objective optimization methodology can be utilized in design practice by integrating advanced simulation, optimization algorithm and BIM.

Improved Concurrent Subspace Optimization Using Automatic Differentiation (자동미분을 이용한 분리시스템동시최적화기법의 개선)

  • 이종수;박창규
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1999.10a
    • /
    • pp.359-369
    • /
    • 1999
  • The paper describes the study of concurrent subspace optimization(CSSO) for coupled multidisciplinary design optimization (MDO) techniques in mechanical systems. This method is a solution to large scale coupled multidisciplinary system, wherein the original problem is decomposed into a set of smaller, more tractable subproblems. Key elements in CSSO are consisted of global sensitivity equation(GSE), subspace optimization (SSO), optimum sensitivity analysis(OSA), and coordination optimization problem(COP) so as to inquiry valanced design solutions finally, Automatic differentiation has an ability to provide a robust sensitivity solution, and have shown the numerical numerical effectiveness over finite difference schemes wherein the perturbed step size in design variable is required. The present paper will develop the automatic differentiation based concurrent subspace optimization(AD-CSSO) in MDO. An automatic differentiation tool in FORTRAN(ADIFOR) will be employed to evaluate sensitivities. The use of exact function derivatives in GSE, OSA and COP makes Possible to enhance the numerical accuracy during the iterative design process. The paper discusses how much influence on final optimal design compared with traditional all-in-one approach, finite difference based CSSO and AD-CSSO applying coupled design variables.

  • PDF

Fabrication of Nano-sized Titanate Powders by an Ethylene Glycol Solution Route

  • Lee, S.J.;Lee, M.J.;Yoon, Y.S.
    • Proceedings of the Korean Powder Metallurgy Institute Conference
    • /
    • 2006.09a
    • /
    • pp.440-441
    • /
    • 2006
  • Several titanate powders ($Al_2TiO_5,\;SrTiO_3$, etc.) were synthesized by an ethylene glycol solution route. Titanium isopropoxide and nitrate salts were dissolved in stoichiometric proportions in liquid-type ethylene glycol without any precipitation. The parent precursor sols were dried to porous gels, and then the gels were calcined and crystallized. All synthesized titanate powders had stable crystallization behavior at low temperature and high specific surface area after a simple ball-milling process. A three-component PZT $(Pb(Zr_{0.52}{\cdot}Ti_{0.48})O_3)$ powder was also synthesized successfully by the ethylene glycol method. In this study, the characteristics of the multi-component titanate powders by the ethylene glycol method are examined.

  • PDF