• Management Science and Financial Engineering
• /
• 제18권1호
• /
• pp.39-48
• /
• 2012

This article presents a way of tackling a special class of space optimization problems that arise in a number of practical applications in industry and elsewhere. It presents an elegant solution to a problem that was considered by (Das, 2005) in optimizing storage space in warehouse of a footwear manufacturing company. In (Das, 2005), the problem was formulated as a nonlinear programming problem. In this article, it is shown that the problem can be formulated as a generalized transportation problem which is a special case of generalized network flow problems. Further, an elegant scheme is devised to handle the dynamic situation of warehousing problem which can be easily translated into a decision support system for the warehouse management system. Also, the article points out certain obscurities and gaps in (Das, 2005).

• 한국실내디자인학회논문집
• /
• 제15권5호
• /
• pp.157-166
• /
• 2006

Recently, it appears several counterproposals about desirable figures of urban architecture. All of them proposes 'publicity' with cohernt tendency. The reason why it concentrates quantitative expansion of city without united design by urban plannar is that neglect quality values of city. As a solution of poor environment, there cue out the various efforts, about problem of each building, problem of city space, problem of laws and so forth. The reason why necessity of public space was embossed in that architecture extend the activity of citizen and make up the city space. But, each building pursues the private interest, so it is difficult to secure a public space with a high hand. Thus, architecture law has been revised in 1991 and bring the system of open space to match up the publicity and the private interest. Actually, western country brought it and obtained excellent results. While quantity of open space have increased since 1991, a lot of problems revealed in real usage and quality. By means of problem's solution, this study focus on the diversion of recognition for necessity of various open space. In result, on the occasion of approach and openess, except for several building, most glass a facade and the pedestrian can approach easily. Moreover, office buildings near the subway station connected with their low floor. So, the office buildings give openess to pedestrian and a people can approach easily to the buildings. On the occasion of amenity, most have bank and lobby on the first floor and have facilities on the underground floor. It leave open. But the reason why they have bank and lobby is that the space is dry and boring(without elements of nature and rest space). Hence, to make a space full of vitality, it have to plan various design elements and facilities. First of all, plan of indoor public space have to make up facility for the public interest. This study is basic investigation for necessity of indoor public space and through the survey of office buildings, it analyze the character of plan and find out the method of publicity's realization.

• Industrial Engineering and Management Systems
• /
• 제7권2호
• /
• pp.126-132
• /
• 2008

The bin packing problem (BPP) is an NP-Complete Problem. The problem can be described as there are $N=\{1,2,{\cdots},n\}$ which is a set of item indices and $L=\{s1,s2,{\cdots},sn\}$ be a set of item sizes sj, where $0<sj{\leq}1$, ${\forall}j{\in}N$. The objective is to minimize the number of bins used for packing items in N into a bin such that the total size of items in a bin does not exceed the bin capacity. Assume that the bins have capacity equal to one. In the past, many researchers put on effort to find the heuristic algorithms instead of solving the problem to optimality. Then, the quality of solution may be measured by the asymptotic worst-case ratio or the average-case ratio. The First Fit Decreasing (FFD) is one of the algorithms that its asymptotic worst-case ratio equals to 11/9. Many researchers prove the asymptotic worst-case ratio by using the weighting function and the proof is in a lengthy format. In this study, we found an easier way to prove that the asymptotic worst-case ratio of the First Fit Decreasing (FFD) is not more than 11/9. The proof comes from two ideas which are the occupied space in a bin is more than the size of the item and the occupied space in the optimal solution is less than occupied space in the FFD solution. The occupied space is later called the weighting function. The objective is to determine the maximum occupied space of the heuristics by using integer programming. The maximum value is the key to the asymptotic worst-case ratio.

• 한국콘텐츠학회논문지
• /
• 제20권11호
• /
• pp.636-643
• /
• 2020

차분 진화 알고리즘은 연속적인 문제 공간인 실수 최적화 문제를 해결하기 위해 개발된 메타휴리스틱 기법 중에 하나이다. 본 연구에서는 차분 진화 알고리즘을 불연속적인 문제 공간인 외판원 문제 해결에 사용하기 위하여 차분 진화 알고리즘에 난수 키 표현법을 적용하였다. 차분 진화 알고리즘은 실수 공간을 탐색하고 오름 차순으로 정렬된 해의 인덱스의 순서를 도시 방문 순서로 하여 적합도를 구한다. TSPLIB에서 제공하는 표준 외판원 문제에 적용하여 실험한 결과 제안한 난수 키 표현법 기반 차분 진화 알고리즘이 외판원 문제 해결에 가능성을 가지고 있음을 확인하였다.

• 한국농촌건축학회논문집
• /
• 제18권4호
• /
• pp.17-24
• /
• 2016

Since the users have direct access to search and browse freely, the open access system has been employed to all the usual modern libraries. However, library space shortage problem created by the continuously increasing printed materials caused the degradation of usability and quality of the library space. Open Access system is superior in user convenience but is inferior in space efficiency. Keeping the open access system is considered as one of the reasons of the space shortage problem. Even though the closed access system does not provide free access or easy browsing for the uses, it's space efficiency is much higher than the open access system. The closed access system should be employed as a plan to relieve space shortage problem. Since the closed access system does not allow the public direct access to books, it is very economical. It also provides much better space efficiency with higher book shelving density. In this article, closed access library system models and their characteristics are examined as the reduction plans for the library space shortage problems.

• 충청수학회지
• /
• 제32권1호
• /
• pp.1-14
• /
• 2019

We prove the generalized Hyers-Ulam-Rassias stability problem of the quadratic functional equation with involution in the fuzzy quasi ${\beta}$-normed space by using the fixed point method.

• Kyungpook Mathematical Journal
• /
• 제62권3호
• /
• pp.533-555
• /
• 2022

In this paper, we introduce a new algorithm for finding a solution of an equilibrium problem in a real Hilbert space. Our paper extends the single projection method to pseudomonotone variational inequalities, from a 2018 paper of Shehu et. al., to pseudomonotone equilibrium problems in a real Hilbert space. On the basis of the given algorithm for the equilibrium problem, we develop a new algorithm for finding a common solution of a equilibrium problem and fixed point problem. The strong convergence of the algorithm is established under mild assumptions. Several of fundamental experiments in finite (infinite) spaces are provided to illustrate the numerical behavior of the algorithm for the equilibrium problem and to compare it with other algorithms.

• 대한수학회지
• /
• 제32권3호
• /
• pp.447-459
• /
• 1995

A fundamental problem is to construct linear systems with given transfer functions. This problem has a well known solution for unitary linear systems whose state spaces and coefficient spaces are Hilbert spaces. The solution is due independently to B. Sz.-Nagy and C. Foias [15] and to L. de Branges and J. Ball and N. Cohen [4]. Such a linear system is essentially uniquely determined by its transfer function. The de Branges-Rovnyak construction makes use of the theory of square summable power series with coefficients in a Hilbert space. The construction also applies when the coefficient space is a Krein space [7].

• Korean Journal of Mathematics
• /
• 제17권2호
• /
• pp.219-231
• /
• 2009

We show the existence of at least four solutions for the perturbed parabolic equation with Dirichlet boundary condition and periodic condition when the nonlinear part cross two eigenvalues of the eigenvalue problem of the Laplace operator with boundary condition. We obtain this result by using the Leray-Schauder degree theory, the finite dimensional reduction method and the geometry of the mapping. The main point is that we restrict ourselves to the real Hilbert space instead of the complex space.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1990년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 26-27 Oct. 1990
• /
• pp.388-393
• /
• 1990

A robot manipulator and an obstacle are described mathematically in joint space, with the mathematical representation for the collision between the robot manipulator and the obstacle. Using these descriptions, the robot motion planning problem is formulated which can be used to avoide a time varying obstacle. To solve the problem, the constraints on motion planning are discretized in joint space. An analytical method is proposed for planning the motion in joint space from a given starting point to the goal point. It is found that solving the inverse kinematics problem is not necessary to get the control input to the joint motion controller for collision avoidance.