• 제목/요약/키워드: Locating Problem

검색결과 120건 처리시간 0.028초

GIS Oriented Platform For Solving Real World Logistic Vehicle Routing Problem

  • Md. Shahid Uz Zaman;Chen, Yen-Wei;Hayao Miyagi
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 ITC-CSCC -2
    • /
    • pp.1248-1251
    • /
    • 2002
  • Logistics optimization problems related with vehicle routing such as warehouse locating, track scheduling, customer order delivery, wastage pickup etc. are very interesting and important issues to date. Many Vehicle Routing and Scheduling Systems (VRSS) have been developed/proposed to optimize the logistics problems. But majority of them are dedicated to a particular problem and are unable to handle the real world spatial data directly. The system developed for one problem may not be suitable for others due to inter-problem constraint variations. The constraints may include geographical, environmental and road traffic nature of the working region along with other constraints related with the problem. So the developer always needs to modify the original routing algorithm in order to fulfill the purpose. In our study, we propose a general-purpose platform by combining GIS road map and Database Management System (DBMS), so that VRSS can interact with real world spatial data directly to solve different kinds of vehicle routing problems. Using the features of our developed system, the developer can frequently modify the existing algorithm or create a new one to serve the purpose.

  • PDF

패턴인식을 이용한 과학영재 판별 도구에 관한 연구 (A study on the method for distinguishing general from science-inclined learners by using Pattern Recognition)

  • 방승진;최중오;김혁
    • 한국수학교육학회지시리즈E:수학교육논문집
    • /
    • 제20권4호
    • /
    • pp.551-559
    • /
    • 2006
  • Pattern Recognition measures the ability of learners to distinguish between two sets of shapes or figures. Locating similar patterns on either side of the presented problem determines a learner's capacity or aptitude for science over general studies. At Ajou University's Institute for Scientifically Enabled Youth, we conducted research using a sample composed of middle school students with general and scientific backgrounds. The result proved that Pattern Recognition measures a different creative talent other than problem solving. In our opinion, Pattern Recognition would be a method better suited to elementary learners over those in middle or high school.

  • PDF

중간재고점(中間在庫點) 최적위치선정(最適位置選定)에 관(關)한 연구(硏究) (A Study on the Optimal Location of Physical Distribution Centers)

  • 김만식
    • 대한산업공학회지
    • /
    • 제1권2호
    • /
    • pp.39-49
    • /
    • 1975
  • The problem treated is that of locating distribution centers(depot) in a network, so as to minimize the total cost which is the sum of transportation cost, (from factory to centers and from centers to demand points), construction cost, inventory cost and traffic increasing cost. This problem is mathematically an integer program and a non-linear model. This study avoids various inefficient aspects, which many studies have shown, by introducing a matrix notation, node and link function. An algorithm, for determining the optimal location of distribution center which has zone in which demand points are located at some node of a network, is presented. Finally this paper describes a numerical example and discusses its results.

  • PDF

22.9kV 초전도케이블 실계통 도입방안에 대한 세부계통검토 (A study on the application of 22.9kV HTS Cable in Korean Power System)

  • 이승렬;김종율;윤재영
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2004년도 하계학술대회 논문집 A
    • /
    • pp.436-439
    • /
    • 2004
  • As power system is developed, an expansion of power equipments is very necessary to the stability of power system and the problem of locating the facilities on downtown is more serious. At this time introduction of superconducting devices are very good alternative to solve the problem. This study describes cases possible to apply 22.9kV HTS cable to power system and analyzes the power system with HTS cable.

  • PDF

Belief Function Retraction and Tracing Algorithm for Rule Refinement

  • Lee, Gye Sung
    • International journal of advanced smart convergence
    • /
    • 제8권2호
    • /
    • pp.94-101
    • /
    • 2019
  • Building a stable knowledge base is an important issue in the application of knowledge engineering. In this paper, we present an algorithm for detecting and locating discrepancies in the line of the reasoning process especially when discrepancies occur on belief values. This includes backtracking the rule firing from a goal node of the rule network. Retracting a belief function allows the current belief state to move back to another belief state without the rule firing. It also gives an estimate, called contribution measure, of how much the rule has an impact on the current belief state. Examining the measure leads the expert to locate the possible cause of problem in the rule. For non-monotonic reasoning, the belief retraction method moves the belief state back to the previous state. A tracing algorithm is presented to identify and locate the cause of problem. This also gives repair suggestions for rule refinement.

Optimization of 3G Mobile Network Design Using a Hybrid Search Strategy

  • Wu Yufei;Pierre Samuel
    • Journal of Communications and Networks
    • /
    • 제7권4호
    • /
    • pp.471-477
    • /
    • 2005
  • This paper proposes an efficient constraint-based optimization model for the design of 3G mobile networks, such as universal mobile telecommunications system (UMTS). The model concerns about finding a set of sites for locating radio network controllers (RNCs) from a set of pre-defined candidate sites, and at the same time optimally assigning node Bs to the selected RNCs. All these choices must satisfy a set of constraints and optimize an objective function. This problem is NP-hard and consequently cannot be practically solved by exact methods for real size networks. Thus, this paper proposes a hybrid search strategy for tackling this complex and combinatorial optimization problem. The proposed hybrid search strategy is composed of three phases: A constraint satisfaction method with an embedded problem-specific goal which guides the search for a good initial solution, an optimization phase using local search algorithms, such as tabu algorithm, and a post­optimization phase to improve solutions from the second phase by using a constraint optimization procedure. Computational results show that the proposed search strategy and the model are highly efficient. Optimal solutions are always obtained for small or medium sized problems. For large sized problems, the final results are on average within $5.77\%$ to $7.48\%$ of the lower bounds.

저고도 방공 레이더 최적 배치에 관한 연구 (Study on the Optimal Location of Low Altitude Air Defense Radar)

  • 백경혁;이영우;장훈
    • 한국군사과학기술학회지
    • /
    • 제17권2호
    • /
    • pp.248-257
    • /
    • 2014
  • As observed in the recent war, suppression of enemy air defense operation is one of the major tactics, simultaneously conducted with high payoff target. Specifically, our air defense operation should be properly constructed, since the operating environment of our forces mostly consists with mountainous terrain, which makes detections of the enemy difficult. The effective arrangements of low altitude air defense radars can be suggested as a way of improving the detection capability of our forces. In this paper, we consider the location problem of low altitude air defense radar, and formulate it as an Integer Programming. Specifically, we surveyed the previous researches on facility location problems and applied two particularly relevant models(MCLP, MEXCLP) to our problem. The terrain factor was represented as demand points in the models. We verified the optimal radar locations for operational situations through simulation model which depicts simple battle field. In the simulation model, the performance of optimal radar locations are measured by the enemy detection rate. With a series of experiments, we may conclude that when locating low altitude air defense radars, it is important to consider the detection probability of radar. We expect that this finding may be helpful to make a more effective air defense plan.

PS-LTE 환경에서 최적기지국 위치 선정 (Optimal Positioning of the Base Stations in PS-LTE Systems)

  • 김현우;이상훈;윤현구;최용훈
    • 한국통신학회논문지
    • /
    • 제41권4호
    • /
    • pp.467-478
    • /
    • 2016
  • 본 논문에서는 PS-LTE(Public Safety-Long Term Evolution) 환경에서 단독기지국의 설치에 있어서 전체 사용자의 데이터 처리량을 최대화하는 PSO(Particle Swarm Optimization)기반의 최적기지국 위치 선정 방법을 제안한다. 또한 전체 재난 지역을 탐색하여 최적의 위치를 찾는 완전탐색(Exhaustive Search) 방법, 임의보행(Random Walk) 이동모형을 적용하여 위치를 선정하는 방법, 기지국 균일 배치방법과의 성능을 비교하였다. 제안하는 방법의 경우 모든 지역을 탐색하여 최적위치를 찾는 완전탐색 방법과 유사한 최적위치 및 전체 사용자의 데이터 처리량(Throughput)을 갖지만, 최적해 수렴시간에 있어서 완전탐색의 경우 재난지역의 크기가 커질수록 증가하지만, 제안하는 방법 경우 빠른 수렴 시간 및 거의 일정한 수렴시간을 갖는 것을 알 수 있다.

지능형국토정보기술 테스트베드 입지선정에 관한 연구 (Research on the Location Decision of Korea Land Spatialization Program's Test-bed)

  • 송기성;박지만;이정훈;김병국
    • 한국공간정보시스템학회 논문지
    • /
    • 제11권4호
    • /
    • pp.1-8
    • /
    • 2009
  • 정부는 급격히 성장하고 있는 공간정보시장의 중요성을 인식하고 상용화가 가능한 기술개발을 위해 2006년부터 2012년까지 대형 국가R&D사업인 지능형국토정보기술혁신사업을 추진하고 있다. 이에 따라, 본 사업은 실제 현장에 바로 적용될 수 있는 검증된 연구 성과물을 도출하기 위해 성과물의 현장적용, 통합, 전시를 위한 테스트베드 구축이 계획되어 있다. 이 중 가장 먼저 해결해야 하는 것이 바로 합리적인 입지 선정이다. 본 논문에서는 지능형국토정보기술 테스트베드와 같이 공간정보기술 실험을 위한 테스트베드 구축과정에서 최적의 입지선정 방안을 도출하는데 목적을 두었다. 연구결과는 국내외 테스트베드 구축사례를 알아보고, 테스트베드에 적용되는 성과물의 특성 분석을 통해 입지선정을 위한 방안을 도출하였다.

  • PDF

모바일산업클러스터구축 입지선정에 관한 연구 (A Study on Location of Mobile Field Testbed)

  • 문준서;장원규
    • 한국통신학회논문지
    • /
    • 제33권3B호
    • /
    • pp.159-164
    • /
    • 2008
  • 정부와 지자체는 IT산업의 생산성을 증대시키기 위해 모바일 산업 클러스터의 구축하여 테스트베드의 제공뿐만 아니라 해외 R&D센터의 유치 및 선진기업과의 공동연구도 실시 할 예정이다. 그 중 가장 먼저 해결되어야 할 과제중 하나가 바로 합리적인 입지 선정이다. 과거 국내의 각 시 도 지방자치단체들은 산업클러스터를 해당 지역내에 유치하기 위해 과열된 경쟁을 보여주었으며 이에 적절한 입지선정평가기준이 절실했다. 본 논문에서는 모바일 필드테스트베드와 같은 모바일산업 지원을 위한 시설투자에 있어서 최적의 입지선정기준이 무엇인지 알아보고자 한다. 먼저 지역특구 중심으로 해외사례를 알아보고 이를 토대로 입지선정요인을 위한 평가항목을 설정해 보고 이러한 평가모델을 계층분석적 의사결정방법(AHP)을 통해 분석해보았다.