• Proceedings of the KOR-KST Conference
• /
• 2000.02a
• /
• 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.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.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.

• Journal of KIISE:Software and Applications
• /
• v.30 no.9
• /
• pp.862-866
• /
• 2003

Traveling Salesman Problem(TSP) is a combinational optimization problem, Genetic Algorithm(GA) and Lin-Kernighan(LK) Heuristic［1］that is Local Search Heuristic are one of the most commonly used methods to resolve TSP. In this paper, we introduce ACS(Ant Colony System) Algorithm as another approach to solve TSP and propose a new pheromone updating method. ACS uses pheromone information between cities in the Process where many ants make a tour, and is a method to find a optimal solution through recursive tour creation process. At the stage of Global Updating of ACS method, it updates pheromone of edges belonging to global best tour of created all edge. But we perform once more pheromone update about created all edges before global updating rule of original ACS is applied. At this process, we use the frequency of occurrence of each edges to update pheromone. We could offer stochastic value by pheromone about each edges, giving all edges' occurrence frequency as weight about Pheromone. This finds an optimal solution faster than existing ACS algorithm and prevent a local optima using more edges in next time search.

• Industrial Engineering and Management Systems
• /
• v.7 no.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.

• Journal of the Korean Society for Advanced Composite Structures
• /
• v.5 no.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.

• Journal of KIISE:Software and Applications
• /
• v.31 no.2
• /
• pp.164-172
• /
• 2004

For a local search algorithm to find a bettor quality solution it is required to generate and evaluate a sufficiently large number of candidate solutions as neighbors at each iteration, demanding quite an amount of CPU time. This paper presents a method of selectively generating only good-looking candidate neighbors, so that the number of neighbors can be kept low to improve the efficiency of search. In our method, a newly generated candidate solution is probabilistically selected to become a neighbor based on the quality estimation determined heuristically by a very simple evaluation of the generated candidate. Experimental results on the problem of load balancing for production scheduling have shown that our candidate selection method outperforms other random or greedy selection methods in terms of solution quality given the same amount of CPU time.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• 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
• /
• v.10 no.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.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.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.

• The Pure and Applied Mathematics
• /
• v.12 no.3 s.29
• /
• 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.