• Title/Summary/Keyword: Point location problem

Search Result 191, Processing Time 0.033 seconds

Fuzzy Random Facility Location Problems

  • Ishii, Hiroaki;Itoh, Takeshi;Katagiri, Hideki
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.663-665
    • /
    • 1998
  • This paper investigates a facility location problem where there are possible demand points with demand occuring probabilites and actual distances between these points and the facility site to be determined are ambiguous, Further we define the fuzzy goal with respect to the maximum value among the actual distances between demand points and the facility. We determine the site of facility maximizing the minimal satisficing degree under the chance constraint. We propose the geometric algorithm to find this optimal site.

  • PDF

A GIS-based Geometric Method for Solving the Competitive Location Problem in Discrete Space (이산적 입지 공간의 경쟁적 입지 문제를 해결하기 위한 GIS 기반 기하학적 방법론 연구)

  • Lee, Gun-Hak
    • Journal of the Korean Geographical Society
    • /
    • v.46 no.3
    • /
    • pp.366-381
    • /
    • 2011
  • A competitive location problem in discrete space is computationally difficult to solve in general because of its combinatorial feature. In this paper, we address an alternative method for solving competitive location problems in discrete space, particularly employing deterministic allocation. The key point of the suggested method is to reducing the number of predefined potential facility sites associated with the size of problem by utilizing geometric concepts. The suggested method was applied to the existing broadband marketplace with increasing competition as an application. Specifically, we compared computational results and spatial configurations of two different sized problems: the problem with the original potential sites over the study area and the problem with the reduced potential sites extracted by a GIS-based geometric algorithm. The results show that the competitive location model with the reduced potential sites can be solved more efficiently, while both problems presented the same optimal locations maximizing customer capture.

Analysis of a force reconstruction problem

  • Jacquelin, E.;Bennani, A.;Massenzio, M.
    • Structural Engineering and Mechanics
    • /
    • v.21 no.3
    • /
    • pp.237-254
    • /
    • 2005
  • This article deals with the reconstruction of an impact force. This requires to take measurements from the impacted structures and then to deconvolve those signals from the impulse response function. More precisely, the purpose of the work described here is to analyse the method of deconvolution and the problems that it implies. Thus, it is highlighted that the associated deconvolution problem depends on the location of the measurement points: it is possible or not to reconstruct the force of impact in function of the location of this point. Then, the role of the antiresonances is linked up with this problem. The singular value decomposition is used to understand these difficulties. Numerical predictions are compared and validated with experiments.

Distribution Center Location and Routing Problem with Demand Dependent on the Customer Service (고객서비스에 따른 수요변화하에서의 분배센터 입지선정과 경로 문제)

  • 오광기;이상용
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.22 no.51
    • /
    • pp.29-40
    • /
    • 1999
  • The distribution center location and routing problem involves interdependent decisions among facility, transportation, and inventory decisions. The design of distribution system affects the customers' purchase decision by sets the level of customer service to be offered. Thus the lower product availability may cause a loss of demand as falls off the customers' purchase intention, and this is related to the firm's profit reduction. This study considers the product availability of the distribution centers as the measure of the demand level change of the demand points, and represents relation between customer service and demand level with linear demand function. And this study represents the distribution center location and routing to demand point in order to maximize the total profit that considers the products' sales revenue by customer service, the production cost and the distribution system related costs.

  • PDF

Object Tracking Algorithm using Feature Map based on Siamese Network (Siamese Network의 특징맵을 이용한 객체 추적 알고리즘)

  • Lim, Su-Chang;Park, Sung-Wook;Kim, Jong-Chan;Ryu, Chang-Su
    • Journal of Korea Multimedia Society
    • /
    • v.24 no.6
    • /
    • pp.796-804
    • /
    • 2021
  • In computer vision, visual tracking method addresses the problem of localizing an specific object in video sequence according to the bounding box. In this paper, we propose a tracking method by introducing the feature correlation comparison into the siamese network to increase its matching identification. We propose a way to compute location of object to improve matching performance by a correlation operation, which locates parts for solving the searching problem. The higher layer in the network can extract a lot of object information. The lower layer has many location information. To reduce error rate of the object center point, we built a siamese network that extracts the distribution and location information of target objects. As a result of the experiment, the average center error rate was less than 25%.

The Study to standardize the ST36 Acupoint Location on Rats (흰쥐에서 족삼리 취혈 위치 표준화를 위한 연구)

  • Kim, Jong-Yeop;Choi, Il-Hwan;Hong, Yo-Han;Lim, Sabina
    • Korean Journal of Acupuncture
    • /
    • v.27 no.3
    • /
    • pp.97-108
    • /
    • 2010
  • Background : The location of acupoints on rat, which may differ from that of human body due to anatomical structure, is defined variously among researchers, which may cause the problem of low repeatability and objectivity. Design : The measurement of hind limb consist of measuring the distance between knee joint and tibia tubercle in order to set the knee joint as common criteria. Based on it, the three mostly referred location of ST36 were represented with the knee joint as a datum point and compared. The electroacupuncture stimulation was administrated after the abdominal pain was induced by acetic acid. And the analgesic activity of each ST36 acupoint was evaluated by measuring the number of writhing reflex, in order to observe the differences of treatment effect in accordance with the location of ST36 acupoints. Results : The result of measurement confirmed the differences in the acupoint location of ST36 among researchers. The writhing reflex test using the acetic acid-induced abdominal pain stimulated with electroacupuncture of 100Hz showed that there were statistically significant differences in the analgesic effect between control group and three ST36 groups (P<0.05). However there were no differences observed among three mostly referred location of ST36 acupoints (P>0.05). Conclusions : We recommend "the point located 6.5 mm below the knee joint at the anterior tibial muscle" as a standard ST36 acupoint location qualified by the WHO Standard Acupuncture Point Locations in 2008.

PCRM: Increasing POI Recommendation Accuracy in Location-Based Social Networks

  • Liu, Lianggui;Li, Wei;Wang, Lingmin;Jia, Huiling
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.11
    • /
    • pp.5344-5356
    • /
    • 2018
  • Nowadays with the help of Location-Based Social Networks (LBSNs), users of Point-of-Interest (POI) recommendation service in LBSNs are able to publish their geo-tagged information and physical locations in the form of sign-ups and share their experiences with friends on POI, which can help users to explore new areas and discover new points-of-interest, and promote advertisers to push mobile ads to target users. POI recommendation service in LBSNs is attracting more and more attention from all over the world. Due to the sparsity of users' activity history data set and the aggregation characteristics of sign-in area, conventional recommendation algorithms usually suffer from low accuracy. To address this problem, this paper proposes a new recommendation algorithm based on a novel Preference-Content-Region Model (PCRM). In this new algorithm, three kinds of information, that is, user's preferences, content of the Point-of-Interest and region of the user's activity are considered, helping users obtain ideal recommendation service everywhere. We demonstrate that our algorithm is more effective than existing algorithms through extensive experiments based on an open Eventbrite data set.

A Model of Location Decisions of Natural Gas Filling Station Considering Spatial Coverage and Travel Cost (공간적 접근성 및 통행비용을 고려한 천연가스 충전소 최적 입지선정 모형)

  • Yu, Jeong-Whon;Lee, Mu-Young;Oh, Sei-Chang
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.3
    • /
    • pp.145-153
    • /
    • 2008
  • This study proposes a facility location model in consideration of spatial coverage and travel cost as an effort to make objective and effective decisions of natural gas filling stations. The proposed model is developed for fixed stations and consists of two stages. The first stage employs a heuristic algorithm to find a set of locations which satisfy the spatial coverage constraints determined by the maximum travel distance between the filling stations and bus depots. In the second stage, the optimal location of filling stations is determined based on the minimum travel cost estimated by using a modified transportation problem as well as the construction and maintenance costs of the filling stations. The applicability of the model is analyzed through finding the optimal location of filling stations for the city of Anyang, a typical medium-sized city in metropolitan Seoul, based on the demand of natural gas buses. This study is expected to help promote the spread of natural gas buses by providing a starting point of a objective and reasonable methodological perspective to address the filling station location problem.

Application of Herding Problem to a Mobile Robot (이동로봇의 Herding 문제 적용)

  • Kang Min Koo;Lee Jin Soo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.11 no.4
    • /
    • pp.322-329
    • /
    • 2005
  • This paper considers the application of mobile robot to the herding problem. The herding problem involves a ‘pursuer’ trying to herd a moving ‘evader’ to a predefined location. In this paper, two mobile robots act as pursuer and evader in the fenced area, where the pursuer robot uses a fuzzy cooperative decision strategy (FCDS) in the herding algorithm. To herd evader robot to a predefined position, the pursuer robot calculates strategic herding point and then navigates to that point using FCDS. FCDS consists of a two-level hierarchy: low level motion descriptors and a high level coordinator. In order to optimize the FCDS, we use the multi­thread evolutionary programming algorithm. The proposed algorithm is implemented in the real mobile robot system and its performance is demonstrated using experimental results.

Crack Identification Using Optimization Technique (수학적 최적화기법을 이용한 결함인식 연구)

  • Seo, Myeong-Won;Yu, Jun-Mo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.24 no.1 s.173
    • /
    • pp.190-195
    • /
    • 2000
  • It has been established that a crack has an important effect on the dynamic behavior of a structure. This effect depends mainly on the location and depth of the crack. To identify the location and depth of a crack in a structure. Nikolakopoulos et. al. used the intersection point of the superposed contours that correspond to the eigenfrequency caused by the crack presence. However the intersecting point of the superposed contours is not only difficult to find but also incorrect to calculate. A method is presented in this paper which uses optimization technique for the location and depth of the crack. The basic idea is to find parameters which use the structural eigenfrequencies on crack depth and location and optimization algorithm. With finite element model of the structure to calculate eigenfrequencies, it is possible to formulate the inverse problem in optimization format. Method of optimization is augmented lagrange multiplier method and search direction method is BFGS variable metric method and one dimensional search method is polynomial interpolation.