• Title/Summary/Keyword: routing costs

Search Result 108, Processing Time 0.021 seconds

Development of the Algorithm of a Public Transportation Route Search Considering the Resistance Value of Traffic Safety and Environmental Index (교통안전, 환경지표의 저항값을 고려한 대중교통 경로 탐색 알고리즘 개발)

  • Kim, Eun-Ji;Lee, Seon-Ha;Cheon, Choon-Keun;Yu, Byung-Young
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.16 no.1
    • /
    • pp.78-89
    • /
    • 2017
  • This study derived the algorithm of a public transportation route search that adds safety and environmental costs according to user preference. As the means of an algorithm application and evaluation, Macro Simulation, VISUM was conducted for an analysis. The route using the subway, which is relatively low in safety and environment resistance value was preferred, and it was analyzed to select the safe and environmental route even though it detours. This study can be applicable when to verify the algorithm of route search considering safety and environment, and when introducing the algorithm of route search according to user preference in the smart-phone application in the future, it can provide users with very useful information by choosing a route as for safety and environment, and through this, the quality of user-friendly information provision can be promoted.

Reliable Continuous Object Detection Scheme in Wireless Sensor Networks (무선 센서 네트워크에서 신뢰성 있는 연속 개체 탐지 방안)

  • Nam, Ki-Dong;Park, Ho-Sung;Yim, Young-Bin;Oh, Seung-Min;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.12A
    • /
    • pp.1171-1180
    • /
    • 2010
  • In wireless sensor networks, reliable event detection is one of the most important research issues. For the reliable event detection, previous works usually assume the events are only individual objects such as tanks and soldiers. Recently, many researches focus on detection of continuous objects such as wild fire and bio-chemical material, but they merely aim at methods to reduce communication costs. Hence, we propose a reliable continuous object detection scheme. However, it might not be trivial. Unlike individual objects that could be referred as a point, a continuous object is shown in a dynamic two-dimensional diagram since it may cover a wide area and it could dynamically alter its own shape according to physical environments, e.g. geographical conditions, wind, and so on. Hence, the continuous object detection reliability can not be estimated by the indicator for individual objects. This paper newly defines the reliability indicator for continuous object detection and proposes an error recovery mechanism relying on the estimation result from the new indicator.

Intelligent Hierarchical Mobility Support Scheme in F-PMIPv6 Networks (F-PMIPv6 네트워크에서 지능적인 계층적 이동성 지원 기법)

  • Han, Sunghee;Jeong, Jongpil
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.4
    • /
    • pp.337-349
    • /
    • 2013
  • In this paper, we propose a new mobility management scheme, called i-FP(intelligent Fast PMIPv6). Our proposed i-FP scheme is addressed for solving the existing local mobility management problems from legacy frameworks. To move MN(Mobile Node) to other networks in one domain, i-FP employs three network entities which are extended from PMIPv6(Proxy Mobile IPv6), LMA(Local Mobility Anchor), MAG(Mobile Access Gateway) and MN. In i-FP, the three network entities can reduce the handover delay time of MNs. Also, i-FP uses an IP header swapping mechanism to avoid the traffic overhead and improve the throughput of network. To evaluate the performance of i-FP, we analyze our i-FP, HMIPv6(Hierarchical Mobile IPv6) and PMIPv6 which are legacy protocols of local mobility management in terms of various parameters. Finally, our i-FP scheme shows good performance(reduction of routing hops 10.2%, signaling costs 58.5% and handover delay 16.3%) than other network schemes for the total cost.

An Analytical Comparative Study on Information Systems of the Door-To-Door Service Companies (택배 정보시스템 비교분석에 관한 사례연구 -국내 4사(社)를 중심으로-)

  • Lee, Seok-Yong;Jung, Lee-Sang
    • Management & Information Systems Review
    • /
    • v.28 no.1
    • /
    • pp.1-24
    • /
    • 2009
  • Electronic commerce markets have been increasing rapidly, which has resulted in parallel growth in the door-to-door delivery service industry. The door-to-door delivery service industry is projected to be more competitive, due to the large amount of companies that are already established and the fact that several leading multinational logistics companies are rushing into the domestic market. This is a critical period for the companies which are attempting to obtain a competitive advantage. Previous research on door-to-door delivery services has been undertaken, in relation to strategic exploration, political proposals, and user satisfaction. However, there is a lack of practical studies focused on the information systems of door-to-door service companies and its decisive roles have been undertaken. This study aims to investigate, compare, and analyze the information systems of door-to-door delivery service companies. Also, the study proposes developmental direction of how the information systems should be improved. In order to accomplish the purpose of this study, first, we examined previous research on door-to-door delivery services and their information systems. Second, we investigated and analyzed the information systems of four leading domestic companies by conducting interviews. Third, we compared and identified factors of the information systems that could be improved. Finally, we proposed its developmental direction. As a result of the study, the information systems of door-to-door delivery service companies required to provide classified services using diverse tools and develop the optimized routing model to reduce logistics costs.

  • PDF

APPLYING ENTERPRISE GIS TO DISASTER MANAGEMENT AT KANGWON PROVINCE

  • Yoon, Hoon-Joo;Ryu, Joong-Hi;Kim, Jung-Dai;Park, Hong-Gi
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.9 no.2 s.18
    • /
    • pp.29-36
    • /
    • 2001
  • The purpose of this paper is to describe the Disaster Management System Development of Enterprise GIS at the Kangwon Province in Korea. This project is included into 'the Kangwon Enterprise GIS 21 plan'. The Division of Disaster Management is in the middle of the 2-year project of the Disaster Management System development, appropriate for business performed at the Departments of Forestry, Culture, Environment, Tourism, etc. At the 1st phase of CIS implementation, for more than half a year we focused on the necessity of management of disasters. In the planning process, we needed long-term information on the whole area of Kangwon. In the assessment and response processes, we needed real-time data from Korean Meteorological Administration and other agencies. All the above information was carefully studied and referred to. ESRI's new GIS technologies solve the natural hazard/disaster problems. For example, hazardous materials routing often needs to be found the least expensive path through a roadway network. In the circumstances given, we can choose the departure point and destination of the vehicle, which carries the materials. It's also possible to minimize overall risk and costs of disaster problems by making a plan of people and possessions evacuation from the disaster area in short time limits. We can meet all the above goals using the latest ESRI's technologies.

  • PDF

Path-based In-network Join Processing for Event Detection and Filtering in Sensor Networks (센서 네트워크에서 이벤트 검출 및 필터링을 위한 경로기반 네트워크-내 조인 프로세싱 방법)

  • Jeon, Ju-Hyuk;Yoo, Jae-Soo;Kim, Myoung-Ho
    • Journal of KIISE:Databases
    • /
    • v.33 no.6
    • /
    • pp.620-630
    • /
    • 2006
  • Event-detection is an important application of sensor networks. Join operations can facilitate event-detection with a condition table predefined by a user. When join operations are used for event-detection, it is desirable, if possible, to do in-network join processing to reduce communication costs. In this paper, we propose an energy-efficient in-network join algorithm, called PBA. In PBA, each partition of a condition table is stored along the path from each node to the base station, and then in-network joins are performed on the path. Since each node can identify the parts to store in its storage by its level, PBA reduces the cost of disseminating a condition table considerably Moreover, while the existing method does not work well when the ratio of the size of the condition table to the density of the network is a little bit large, our proposed method PBA does not have such a restriction and works efficiently in most cases. The results of experiments show that PBA is efficient usually and especially provides significant cost reduction over existing one when a condition table is relatively large in comparison with the density of the network, or the routing tree of the network is high.

Development of the Shortest Path Algorithm for Multiple Waypoints Based on Clustering for Automatic Book Management in Libraries (도서관의 자동 도서 관리를 위한 군집화 기반 다중경유지의 최단 경로 알고리즘 개발)

  • Kang, Hyo Jung;Jeon, Eun Joo;Park, Chan Jung
    • The Journal of the Korea Contents Association
    • /
    • v.21 no.1
    • /
    • pp.541-551
    • /
    • 2021
  • Among the numerous duties of a librarian in a library, the work of arranging books is a job that the librarian has to do one by one. Thus, the cost of labor and time is large. In order to solve this problem, the interest in book-arranging robots based on artificial intelligence has recently increased. In this paper, we propose the K-ACO algorithm, which is the shortest path algorithm for multi-stops that can be applied to the library book arrangement robots. The proposed K-ACO algorithm assumes multiple robots rather than one robot. In addition, the K-ACO improves the ANT algorithm to create K clusters and provides the shortest path for each cluster. In this paper, the performance analysis of the proposed algorithm was carried out from the perspective of book arrangement time. The proposed algorithm, the K-ACO algorithm, was applied to a university library and compared with the current book arrangement algorithm. Through the simulation, we found that the proposed algorithm can allocate fairly, without biasing the work of arranging books, and ultimately significantly reduce the time to complete the entire work. Through the results of this study, we expect to improve quality services in the library by reducing the labor and time costs required for arranging books.

Development of Intelligent ATP System Using Genetic Algorithm (유전 알고리듬을 적용한 지능형 ATP 시스템 개발)

  • Kim, Tai-Young
    • Journal of Intelligence and Information Systems
    • /
    • v.16 no.4
    • /
    • pp.131-145
    • /
    • 2010
  • The framework for making a coordinated decision for large-scale facilities has become an important issue in supply chain(SC) management research. The competitive business environment requires companies to continuously search for the ways to achieve high efficiency and lower operational costs. In the areas of production/distribution planning, many researchers and practitioners have developedand evaluated the deterministic models to coordinate important and interrelated logistic decisions such as capacity management, inventory allocation, and vehicle routing. They initially have investigated the various process of SC separately and later become more interested in such problems encompassing the whole SC system. The accurate quotation of ATP(Available-To-Promise) plays a very important role in enhancing customer satisfaction and fill rate maximization. The complexity for intelligent manufacturing system, which includes all the linkages among procurement, production, and distribution, makes the accurate quotation of ATP be a quite difficult job. In addition to, many researchers assumed ATP model with integer time. However, in industry practices, integer times are very rare and the model developed using integer times is therefore approximating the real system. Various alternative models for an ATP system with time lags have been developed and evaluated. In most cases, these models have assumed that the time lags are integer multiples of a unit time grid. However, integer time lags are very rare in practices, and therefore models developed using integer time lags only approximate real systems. The differences occurring by this approximation frequently result in significant accuracy degradations. To introduce the ATP model with time lags, we first introduce the dynamic production function. Hackman and Leachman's dynamic production function in initiated research directly related to the topic of this paper. They propose a modeling framework for a system with non-integer time lags and show how to apply the framework to a variety of systems including continues time series, manufacturing resource planning and critical path method. Their formulation requires no additional variables or constraints and is capable of representing real world systems more accurately. Previously, to cope with non-integer time lags, they usually model a concerned system either by rounding lags to the nearest integers or by subdividing the time grid to make the lags become integer multiples of the grid. But each approach has a critical weakness: the first approach underestimates, potentially leading to infeasibilities or overestimates lead times, potentially resulting in excessive work-inprocesses. The second approach drastically inflates the problem size. We consider an optimized ATP system with non-integer time lag in supply chain management. We focus on a worldwide headquarter, distribution centers, and manufacturing facilities are globally networked. We develop a mixed integer programming(MIP) model for ATP process, which has the definition of required data flow. The illustrative ATP module shows the proposed system is largely affected inSCM. The system we are concerned is composed of a multiple production facility with multiple products, multiple distribution centers and multiple customers. For the system, we consider an ATP scheduling and capacity allocationproblem. In this study, we proposed the model for the ATP system in SCM using the dynamic production function considering the non-integer time lags. The model is developed under the framework suitable for the non-integer lags and, therefore, is more accurate than the models we usually encounter. We developed intelligent ATP System for this model using genetic algorithm. We focus on a capacitated production planning and capacity allocation problem, develop a mixed integer programming model, and propose an efficient heuristic procedure using an evolutionary system to solve it efficiently. This method makes it possible for the population to reach the approximate solution easily. Moreover, we designed and utilized a representation scheme that allows the proposed models to represent real variables. The proposed regeneration procedures, which evaluate each infeasible chromosome, makes the solutions converge to the optimum quickly.