• 대한교통학회:학술대회논문집
• /
• 대한교통학회 2000년도 제37회 학술발표회논문집
• /
• pp.89-115
• /
• 2000

Traffic signal setting policies and traffic assignment procedures are mutually dependent. The combined signal control and traffic assignment problem deals with this interaction. With the total travel time minimization objective, gradient based local search methods are implemented. Deterministic user equilibrium is the selected user route choice rule, Webster's delay curve is the link performance function, and green time per cycle ratios are decision variables. Three implemented solution codes resulting in six variations include intersections operating under multiphase operation with overlapping traffic movements. For reference, the iterative approach is also coded and all codes are tested in four example networks at five demand levels. The results show the numerical gradient estimation procedure performs best although the simplified local searches show reducing the large network computational burden. Demand level as well as network size affects the relative performance of the local and iterative approaches. As demand level becomes higher, (1) in the small network, the local search tends to outperform the iterative search and (2) in the large network, vice versa.

• 한국컴퓨터정보학회논문지
• /
• 제23권12호
• /
• pp.1-9
• /
• 2018

The multiple-choice multidimensional knapsack problem (MMKP) is a variant of the well known 0-1 knapsack problem, which is known as an NP-hard problem. This paper proposes a method for solving the MMKP using the integer programming-based local search (IPbLS). IPbLS is a kind of a local search and uses integer programming to generate a neighbor solution. The most important thing in IPbLS is the way to select items participating in the next integer programming step. In this paper, three ways to select items are introduced and compared on 37 well-known benchmark data instances. Experimental results shows that the method using linear programming is the best for the MMKP. It also shows that the proposed method can find the equal or better solutions than the best known solutions in 23 data instances, and the new better solutions in 13 instances.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제30권9호
• /
• pp.862-866
• /
• 2003

조합 최적화 문제인 순회 판매원 문제(Traveling Salesman Problem, TSP)를 유전자 알고리즘(Genetic Algorithm)과 Local Search Heuristic인 Lin-Kernighan(LK) Heuristic［1］을 이용하여 접근하는 것은 최적 해를 구하기 위해 널리 알려진 방법이다. 본 논문에서는 TSP 문제를 해결하기 위한 또 다른 접근법으로 ACS(Ant Colony system) 알고리즘을 소개하고 새로운 페로몬 갱신 방법을 제시하고자 한다. ACS 알고리즘은 다수의 개미들이 경로를 만들어 가는 과정에서 각 에지상의 페로몬 정보를 이용하며, 이러한 반복적인 경로 생성 과정을 통해 최적 해를 발견하는 방법이다. ACS 기법의 전역 갱신 단계에서는 생성된 모든 경로들 중 전역 최적 경로에 속한 에지들에 대하여 페로몬을 갱신한다. 그러나 본 논문에서는 전역 갱신 규칙이 적용되기 전에 생성된 모든 에지에 대하여 페로몬을 한번 더 갱신한다. 이 때 페로몬 갱신을 위해 각 에지들의 발생 빈도수를 이용한다. 개미들이 생성한 전체 에지들의 발생 빈도수를 페로몬 정보에 대한 가중치(weight)로 부여함으로써 각 에지들에 대하여 통계적 수치를 페로몬 정보로 제공할 수 있었다. 또한 기존의 ACS 알고리즘보다 더 빠른 속도로 최적 해를 찾아내며 더 많은 에지들이 다음 번 탐색에 활용될 수 있게 함으로써 지역 최적화에 빠지는 것을 방지할 수 있다.

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

Home care, known also as domiciliary care, is part of the community care service that is a responsibility of the local government authorities in the UK as well as many other countries around the world. The aim is to provide the care and support needed to assist people, particularly older people, people with physical or learning disabilities and people who need assistance due to illness to live as independently as possible in their own homes. It is performed primarily by care workers visiting clients' homes where they provide help with daily activities. This paper is concerned with the dispatching of care workers to clients in an efficient manner. The optimized routine for each care worker determines a schedule to achieve the minimum total cost (in terms of distance traveled) without violating the capacity and time window constraints. A collaborative population-based meta-heuristic called Particle Swarm Optimization (PSO) is applied to solve the problem. A particle is defined as a multi-dimensional point in space which represents the corresponding schedule for care workers and their clients. Each dimension of a particle represents a care activity and the corresponding, allocated care worker. The continuous position value of each dimension determines the care worker to be assigned and also the assignment priority. A heuristic assignment scheme is specially designed to transform the continuous position value to the discrete job schedule. This job schedule represents the potential feasible solution to the problem. The Earliest Start Time Priority with Minimum Distance Assignment (ESTPMDA) technique is developed for generating an initial solution which guides the search direction of the particle. Local improvement procedures (LIP), insertion and swap, are embedded in the PSO algorithm in order to further improve the quality of the solution. The proposed methodology is implemented, tested, and compared with existing solutions for some 'real' problem instances.

• 복합신소재구조학회 논문집
• /
• 제5권2호
• /
• pp.1-8
• /
• 2014

Fiber reinforced polymeric plastic (FRP) materials have many advantages over conventional structural materials, i.e., high specific strength and stiffness, high corrosion resistance, right weight, etc. Among the various manufacturing methods, pultrusion process is one of the best choices for the mass production of structural plastic members. Since the major reinforcing fibers are placed along the axial direction of the member, this material is usually considered as an orthotropic material. However, pultruded FRP (PFRP) structural members have low modulus of elasticity and are composed of orthotropic thin plate components the members are prone to buckle. Therefore, stability is an important issue in the design of the pultruded FRP structural members. Many researchers have conducted related studies to publish the design method of FRP structures and recently, referred to the previous researches, pre-standard for LRFD of pultruded FRP structures is presented. In this paper, the accuracy and suitability of design equation for the local buckling strength of pultruded FRP I-shape compression members presented by ASCE are estimated. In the estimation, we compared the results obtained by design equation, closed-form solution, and experiments conducted by previous researches.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제31권2호
• /
• pp.164-172
• /
• 2004

일반적으로 국지적 탐색에서 최적해를 획득할 가능성은 가능한 많은 이웃해를 생성하면서 반복 수를 늘릴수록 높아지나 긴 탐색시간이 소요된다. 따라서 한정된 시간 내에 최적해를 효율적으로 찾기 위해서는. 적절한 수의 이웃해를 생성하되, 탐색의 질을 높일 수 있는 이웃해를 선별해서 생성하는 것이 요구된다. 본 논문에서는 국지적 탐색기법을 적용하여 부하평준화 문제를 해결할 때, 탐색의 효율을 향상시킬 수 있는 이웃해 선정 기법을 제안하고, 실세계 데이타를 대상으로 그 성능을 검증하였다. 본 논문에서 제안하는 이웃해 선정 기법은 확률적 선별에 기반 한 방법으로서, 탐색의 질을 개선시킬 가능성에 대한 추정치를 기준으로 부여된 확률에 따라 이웃해를 선별하여 생성하는 기법이다. 대상 문제에 국지적 탐색기법으로 tabu 탐색과 simulated annealing를 적용한 실험에서, 무작위 또는 그리디 선별에 기반 한 방법보다 우수한 성능을 보임을 확인하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.1297-1301
• /
• 1997

Generally, singularity analysis of 6-DOF parallerl manipulators is very difficult and, as result, velocity relation has many uncertainties. In this paper, an alternative method using the local structurizatioin method(LSM) for the analysis of singular configuraions is presented. With LSM, the velocity relation can be represented in a simple form, and the result is totally equivalent to the conventional velocity relation. The velocity relation suggested in this paper gives a closed-form solution of singularities.

• Journal of applied mathematics & informatics
• /
• 제10권1_2호
• /
• pp.41-50
• /
• 2002

We provide local and semilocal theorems for the convergence of Newton-like methods to a locally unique solution of an equation in a Banach space. The analytic property of the operator involved replaces the usual domain condition for Newton-like methods. In the case of the local results we show that the radius of convergence can be enlarged. A numerical example is given to justify our claim . This observation is important and finds applications in steplength selection in predictor-corrector continuation procedures.

• 대한수학회보
• /
• 제53권4호
• /
• pp.1123-1148
• /
• 2016

The aim of this note is to provide detailed proofs for local estimates near the boundary for weak solutions of second order parabolic equations in divergence form with time-dependent measurable coefficients subject to Neumann boundary condition. The corresponding parabolic equations with Dirichlet boundary condition are also considered.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제12권3호
• /
• pp.169-178
• /
• 2005

In this paper we study the existence and local asymptotic limit of the topological Chern-Simons vortices of the CP(1) model in $\mathbb{R}^2$. After reducing to semilinear elliptic partial differential equations, we show the existence of topological solutions using iteration and variational arguments & prove that there is a sequence of topological solutions which converges locally uniformly to a constant as the Chern­Simons coupling constant goes to zero and the convergence is exponentially fast.