• Title/Summary/Keyword: Problem solving approach

Search Result 850, Processing Time 0.024 seconds

Two-phases Hybrid Approaches and Partitioning Strategy to Solve Dynamic Commercial Fleet Management Problem Using Real-time Information (실시간 정보기반 동적 화물차량 운용문제의 2단계 하이브리드 해법과 Partitioning Strategy)

  • Kim, Yong-Jin
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.2 s.73
    • /
    • pp.145-154
    • /
    • 2004
  • The growing demand for customer-responsive, made-to-order manufacturing is stimulating the need for improved dynamic decision-making processes in commercial fleet operations. Moreover, the rapid growth of electronic commerce through the internet is also requiring advanced and precise real-time operation of vehicle fleets. Accompanying these demand side developments/pressures, the growing availability of technologies such as AVL(Automatic Vehicle Location) systems and continuous two-way communication devices is driving developments on the supply side. These technologies enable the dispatcher to identify the current location of trucks and to communicate with drivers in real time affording the carrier fleet dispatcher the opportunity to dynamically respond to changes in demand, driver and vehicle availability, as well as traffic network conditions. This research investigates key aspects of real time dynamic routing and scheduling problems in fleet operation particularly in a truckload pickup-and-delivery problem under various settings, in which information of stochastic demands is revealed on a continuous basis, i.e., as the scheduled routes are executed. The most promising solution strategies for dealing with this real-time problem are analyzed and integrated. Furthermore, this research develops. analyzes, and implements hybrid algorithms for solving them, which combine fast local heuristic approach with an optimization-based approach. In addition, various partitioning algorithms being able to deal with large fleet of vehicles are developed based on 'divided & conquer' technique. Simulation experiments are developed and conducted to evaluate the performance of these algorithms.

On the Solution Method for the Non-uniqueness Problem in Using the Time-domain Acoustic Boundary Element Method (시간 영역 음향 경계요소법에서의 비유일성 문제 해결을 위한 방법에 관하여)

  • Jang, Hae-Won;Ih, Jeong-Guon
    • The Journal of the Acoustical Society of Korea
    • /
    • v.31 no.1
    • /
    • pp.19-28
    • /
    • 2012
  • The time-domain solution from the Kirchhoff integral equation for an exterior problem is not unique at certain eigen-frequencies associated with the fictitious internal modes as happening in frequency-domain analysis. One of the solution methods is the CHIEF (Combined Helmholtz Integral Equation Formulation) approach, which is based on employing additional zero-pressure constraints at some interior points inside the body. Although this method has been widely used in frequency-domain boundary element method due to its simplicity, it was not used in time-domain analysis. In this work, the CHIEF approach is formulated appropriately for time-domain acoustic boundary element method by constraining the unknown surface pressure distribution at the current time, which was obtained by setting the pressure at the interior point to be zero considering the shortest retarded time between boundary nodes and interior point. Sound radiation of a pulsating sphere was used as a test example. By applying the CHIEF method, the low-order fictitious modes could be damped down satisfactorily, thus solving the non-uniqueness problem. However, it was observed that the instability due to high-order fictitious modes, which were beyond the effective frequency, was increased.

Calculus Instructors and Students' Discourseson the Derivative (미적분학 강사와 학생의 미분에 관한 담화)

  • Park, Jung-Eun
    • Journal of Educational Research in Mathematics
    • /
    • v.21 no.1
    • /
    • pp.33-55
    • /
    • 2011
  • This study explores the characteristics of calculus students' and instructors' discourses on the derivative using a communicational approach to cognition. The data were collected from surveys, classroom observations, and interviews. The results show that the instructors did not explicitly address some aspects of the derivative such as the relationship between the derivative function (f'(x)) and the derivative at a point (f'(a)), and f'(x) as a function, and that students incorrectly described or used these aspects for problem solving. It is also found that both implicitness in the instructors' discourse, and students' incorrect descriptions were closely related to their use of the word, "derivative" without specifying it as "the derivative function" or "the derivative at a point." Comparison between instructors' and students' discourses suggests that explicit discussion about the derivative including exact use of terms will help students see the relationship that f'(a) is a number, a point-specific value of f'(x) that is a function, and overcome their mixed and incorrect notion "the derivative" such as the tangent line at a point.

  • PDF

Algorithm for Arthmetic Optimization using Carry-Save Adders (캐리-세이브 가산기를 이용한 연산 최적화 알고리즘)

  • Eom, Jun-Hyeong;Kim, Tae-Hwan
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.12
    • /
    • pp.1539-1547
    • /
    • 1999
  • 캐리-세이브 가산기 (CSA)는 회로 설계 과정에서 빠른 연산 수행을 위해 가장 널리 이용되는 연산기 중의 하나이다. 그러나, 현재까지 산업체에서 CSA를 이용한 설계는 설계자의 경험에 따른 수작업에 의존하고 있고 그 결과 최적의 회로를 만들기 위해 매우 많은 시간과 노력이 소비되고 있다. 이에 따라 최근 CSA를 기초로 하는 회로 합성 자동화 기법에 대한 연구의 필요성이 대두되고 있는 상황에서, 본 논문은 연산 속도를 최적화하는 효율적인 CSA 할당 알고리즘을 제안한다. 우리는 CSA 할당 문제를 2단계로 접근한다: (1) 연산식의 멀티 비트 입력들만을 고려하여 최소 수행 속도 (optimal-delay)의 CSA 트리를 할당한다; (2) (1)에서 구한 CSA 트리의 수행 속도 증가가 최소화 (minimal increase of delay) 되는 방향으로 CSA들의 캐리 입력 포트들에 나머지 싱글 비트 입력들을 배정한다. 실제 실험에서 우리의 제안된 알고리즘을 적용하여 연산식들의 회로 속도를 회로 면적의 증가 없이 상당한 수준까지 줄일 수 있었다.Abstract Carry-save-adder (CSA) is one of the most widely used implementations for fast arithmetics in industry. However, optimizing arithmetic circuits using CSAs is mostly carried out by the designer manually based on his/her design experience, which is a very time-consuming and error-prone task. To overcome this limitation, in this paper we propose an effective synthesis algorithm for solving the problem of finding an allocation of CSAs with a minimal timing for an arithmetic expression. Specifically, we propose a two step approach: (1) allocating a delay-optimal CSA tree for the multi-bit inputs of the arithmetic expression and (2) determining the assignment of the single-bit inputs to carry inputs of the CSAs which leads to a minimal increase of delay of the CSA tree obtained in step (1). For a number of arithmetic expressions, we found that our approach is very effective, reducing the timing of the circuits significantly without increasing the circuit area.

Comparative Analysis of Curriculum and Research Trends Related to Clothing for Persons with Special Needs between Korea and America (특수의복에 관한 실태조사 연구 -한국과 미국의 교과과정과 연구경향분석을 중심으로-)

  • 김찬주
    • Journal of the Korean Home Economics Association
    • /
    • v.27 no.3
    • /
    • pp.13-28
    • /
    • 1989
  • With the purpose of identifying clothing for persons with special needs one of new directions in Clothing and Textiles, this pater comparatively analyzed current curriculum and research trends related to this field between Korea and America. Questionaire was distributed to 25 Korean colleges with Clothing and Textiles department and 4 American colleges known for special clothing study. Questions regarded the name of course, level (grade), number of credit houre, prerequisits and supporting courses, subjects of lecture and projects, way of managing lecture and projects, evaluation system, other special characteristics. Resources for analyzing research trends are Thesis and Dissertations in Clothing and Textiles, Research Journal of Clothing & Textiles/Home Economics Association, College Professors' research reports collection, of both Korea and America. Years of publications are 1972∼1986 (America), 1978∼1988 (Korea). Findings are as follows; 1. Clothing for special needs can be classified into various groups; Clothing for physically handicapped, mentally retarded, elderly, unusual-sized, pregnant/nursing mothers, institutionalized, protective clothing, uniform/career apparel. 2. Management of coursework related to special clothing has several common characteristics specially in America; Building-up coursework, problem-solving orientation, cooperative team-preject, interdisciplinary approach, client-versus-designer preference, community involvement. In Korea, a few school only has special clothing coursework and its scope of study was very limited. 3. Majority of research reports done with the subjects of special clothing had made for physically handicapped people and the elderly. Protective clothing and uniform have recently been paid much interests. 4. Researchers had mainly concerned on Design and Construction Aspects and nextly on social-psychological aspects. However, in America, selection and care aspects and marketing aspects of special clothing have been very procuctive issues recently. 5. Study on clothing for special needs has several opportunities to be stressed and improvements to be strengthened. Opportunities included active participation to the welfare of community society, strong publicity of accurate professional image, share with business and industry, interdisciplinary approach and new job market. Improvements were discussed in terms of strengthening supporting courses/prerequistes, intensifying interdisciplinary cooperation, provoking strong community involvement and securing financial support and research funds.

  • PDF

The UCT algorithm applied to find the best first move in the game of Tic-Tac-Toe (삼목 게임에서 최상의 첫 수를 구하기 위해 적용된 신뢰상한트리 알고리즘)

  • Lee, Byung-Doo;Park, Dong-Soo;Choi, Young-Wook
    • Journal of Korea Game Society
    • /
    • v.15 no.5
    • /
    • pp.109-118
    • /
    • 2015
  • The game of Go originated from ancient China is regarded as one of the most difficult challenges in the filed of AI. Over the past few years, the top computer Go programs based on MCTS have surprisingly beaten professional players with handicap. MCTS is an approach that simulates a random sequence of legal moves until the game is ended, and replaced the traditional knowledge-based approach. We applied the UCT algorithm which is a MCTS variant to the game of Tic-Tac-Toe for finding the best first move, and compared it with the result generated by a pure MCTS. Furthermore, we introduced and compared the performances of epsilon-Greedy algorithm and UCB algorithm for solving the Multi-Armed Bandit problem to understand the UCB.

A Study on Equivalent Modal Damping Values of Soil-Structure Coupling Models (지반-구조물 연계모델의 등가감쇠값에 관한 연구)

  • Park, Hyung Ghee
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.7 no.3
    • /
    • pp.241-248
    • /
    • 1987
  • The theoretical backgrounds of the several methods were surveyed and reviewed to fin out the adequate one to determine equivalent modal damping values in solving the dynamic problem of soil-structure interaction by mode superposition method. Furthermore the rigorous damping matrix of equation of motion was obtained through component mode synthesis technique and used in direct integration of the equation. The analytical results by direct integration method were compared with those of mode superposition approach using the various sets of equivalent modal damping values calculated by the methods to be reviewed. Two types of superstructures and four kinds of subsurface conditions were considered and combined to make soil-structure coupled models. It was realized that dissipating energy method gives the equivalent modal damping values which lead the most similar results to direct integration ones. In case of fixed base, the responses of all methods except stiffness weighted approach are almost equal to those of direct integration method.

  • PDF

On B-spline Approximation for Representing Scattered Multivariate Data (비정렬 다변수 데이터의 B-스플라인 근사화 기법)

  • Park, Sang-Kun
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.35 no.8
    • /
    • pp.921-931
    • /
    • 2011
  • This paper presents a data-fitting technique in which a B-spline hypervolume is used to approximate a given data set of scattered data samples. We describe the implementation of the data structure of a B-spline hypervolume, and we measure its memory size to show that the representation is compact. The proposed technique includes two algorithms. One is for the determination of the knot vectors of a B-spline hypervolume. The other is for the control points, which are determined by solving a linear least-squares minimization problem where the solution is independent of the data-set complexity. The proposed approach is demonstrated with various data-set configurations to reveal its performance in terms of approximation accuracy, memory use, and running time. In addition, we compare our approach with existing methods and present unconstrained optimization examples to show the potential for various applications.

A Concurrency Control Method for Data Broadcasting in Mobile Computing Environment (이동 컴퓨팅 환경에서 데이타 방송을 위한 동시성 제어 기법)

  • 윤혜숙;김영국
    • Journal of KIISE:Databases
    • /
    • v.31 no.2
    • /
    • pp.140-149
    • /
    • 2004
  • Data broadcast has received much attention as a very efficient method for disseminating data items in mobile environment with large number of mobile clients. In this approach, a database server periodically and continuously broadcasts data items through wireless channels and clients perform read-only transactions by accessing necessary data items from the air. While broadcasting, the server must also process update transactions on the database, which raises an obstacle for client's accessing consistent data. In this research, we propose a new algorithm SCDSC(Serialization Checking with DirtySet on Commit) which is an alternative for solving the concurrency control problem efficiently. The SCDSC is a kind of optimistic concurrency control in that a client checks the consistency of data using a DirtySet as a part of data broadcast when it commits its transaction. In each broadcast cycle, the server updates and disseminates the DirtySet with newly changed data items for last few cycles in the sliding window approach. We perform an analysis and a simulation study to evaluate the performance of our SCDSC algorithm in terms of data consistency and data currency.

Synchronization of T-S Fuzzy Chaotic System with Time-Delay and Input Saturation (시간지연과 입력포화를 갖는 T-S 퍼지 카오스 시스템의 동기화)

  • Kim Jae-Hun;Shin Hyunseok;Kim Euntai;Park Mignon
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.42 no.1
    • /
    • pp.13-21
    • /
    • 2005
  • This paper presents a fuzzy model-based approach for synchronization of time-delay chaotic system with input saturation. Time-delay chaotic drive and response system is respectively represented by Takagi-Sugeno (T-S) fuzzy model. Specially, the response system contains input saturation. Using the unidirectional linear error feedback and the parallel distributed compensation (PDC) scheme, we design fuzzy chaotic synchronization system and analyze local stability for synchronization error dynamics. Since time-delay in the transmission channel always exists, we also take it into consideration. The sufficient condition for the local stability of the fuzzy synchronization system with input saturation and time-delay is derived by applying Lyapunov-Krasovskii theory and solving linear matrix inequalities (LMI's) problem. A numerical example is given to demonstrate the validity of the proposed approach.