• Title/Summary/Keyword: Routing Plan

Search Result 67, Processing Time 0.029 seconds

Stable Power Plan Technique for Implementing SoC (SoC 구현을 위한 안정적인 Power Plan 기법)

  • Seo, Young-Ho;Kim, Dong-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.12
    • /
    • pp.2731-2740
    • /
    • 2012
  • ASIC(application specific integrated circuit) process is a set of various technologies for fabricating a chip. Generally there have been many researches for RTL design, synthesis, floor plan & routing, low power scheme, clock tree synthesis, and testability which are widely researched in recent. In this paper we propose a new methodology of power strap routing in basis of design experience and experiment. First the power strap for vertical VDD and VSS and horizontal VDD and VSS is routed, and then after the problems which are generated in this process are analyzed, we propose a new process for resolving them. For this, the strap guide is inserted to protect the unnecessary strap routing and dumped for next steps. Next the unnecessary power straps which are generated the first inserting process are removed, and the pre-routing is performed for the macro cells. Finally the resultant power straps are routed using the dumped routing guide. Through the proposed process we identified the efficient and stable route of the power straps.

A Review of Routing Plan for Unmanned Aerial Vehicle : Focused on In-Country Researches (국내 무인항공기의 경로계획 연구)

  • Kim, Jinwoo;Kim, Jinwook;Chae, Junjae
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.38 no.4
    • /
    • pp.212-225
    • /
    • 2015
  • UAV (Unmanned Aerial Vehicle), the pilotless plane or drone, draws researchers' attention at these days for its extended use to various area. The research was initiated for military use of the UAV, but the area of applicable field is extended to surveillance, communication, and even delivery for commercial use. As increasing the interest in UAV, the needs of research for operating the flying object which is not directly visible when it conducts a certain mission to remote place is obviously grown as much as developing high performance pilotless plane is required. One of the project supported by government is related to the use of UAV for logistics fields and controlling UAV to deliver the certain items to isolated or not-easy-to-access place is one of the important issues. At the initial stage of the project, the previous researches for controlling UAV need to be organized to understand current state of art in local researches. Thus, this study is one of the steps to develop the unmanned system for using in military or commercial. Specifically, we focused on reviewing the approaches of controlling UAV from origination to destination in previous in-country researches because the delivery involves the routing planning and the efficient and effective routing plan is critical to success to delivery mission using UAV. This routing plan includes the method to avoid the obstacles and reach the final destination without a crash. This research also present the classification and categorization of the papers and it could guide the researchers, who conduct researches and explore in comparable fields, to catch the current address of the research.

Development of a Planning System for the Routing and Scheduling of Vehicles in Pickup and Delivery Services (수배송 서비스를 위한 운송계획 최적화 시스템 개발)

  • Choi, Ji-Young;Lee, Tae-Han;Lim, Jae-Min
    • IE interfaces
    • /
    • v.19 no.3
    • /
    • pp.202-213
    • /
    • 2006
  • In this paper, we develop a planning system for the routing and scheduling of vehicles in pickup and delivery service such as door-to-door parcel service. Efficient routing and scheduling of vehicles is very important in pickup and delivery service. The routing and scheduling problem is a variation of vehicle routing problem which has various realistic constraints. We develop a heuristic algorithm based on tabu search to solve the routing and scheduling problem. We develop a routing and scheduling system installed the algorithm as a planning engine. The system manage the basic data and uses GIS data to make a realistic route plan.

A Location-based Real-time Re-routing Heuristic to Solve the VRPSPD (VRPSPD 해결을 위한 위치기반의 실시간 재경로 탐색 휴리스틱)

  • Cha, Sang-Jin;Lee, Kee-Sung;Yu, Young-Hoon;Jo, Geun-Sik
    • Spatial Information Research
    • /
    • v.18 no.3
    • /
    • pp.63-72
    • /
    • 2010
  • The vehicle routing problem with simultaneous pick-up and delivery (VRPSPD) is a variant of the vehicle routing problem (VRP) that customers require simultaneously a pick-up and delivery service. The main objective of VRPSPD is to minimize a cost of routes satisfying many constraints. Traditional VRPSPD have been dealt with a static environment. The static environment means that a routing data and plan cannot be changed. For example, it is difficult to change a vehicle's routing plan so that a vehicle serves the pick-up demands of new customers during the delivery service. Therefore, traditional approach is not suitable for dynamic environments. To solve this problem, we propose a novel approach for finding efficient routes using a real-time re-routing heuristics based on the Location Based Service (LBS). Our re-routing heuristics can generate a new route for vehicle that satisfies a new customer's demand considering the current geographic location of a vehicle. Experimental results show that our methodology can reduce the traveling cost of vehicles comparing with other previous methods.

Safety-Economic Decision Making Model of Tropical Cyclone Avoidance Routing on Oceans

  • Liu, Da-Gang;Wang, De-Qiang;Wu, Zhao-Lin
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2006.10a
    • /
    • pp.144-153
    • /
    • 2006
  • In order to take TC forecasts from different observatories into consideration, and make quantitative assessment and analysis for avoiding TC routes from the view of safety and cost, a new safe-economic decision making method of TC avoidance routing on ocean was put forward. This model is based on combining forecast of TC trace based on neural networks, technical method to determine the future TC wind and wave fields, technical method of fuzzy information optimization, risk analysis theory, and meteorological-economic decision making theory. It has applied to the simulation of MV Tianlihai's shipping on ocean. The result shows that the model can select the optimum plan from 7 plans, the selected plan is in accordance with the one selected by experienced captains.

  • PDF

CABLE AUTO-ROUTING PROGRAM 개발

  • 배순삼;최태우;김중래;이익룡
    • Bulletin of the Society of Naval Architects of Korea
    • /
    • v.30 no.1
    • /
    • pp.19-27
    • /
    • 1993
  • 현재 당사에서 개발한 ROUCAS SYSTEM은 조선 전장 설계 PACKAGE에 있어 혁신적인 SYSTEM으로 부상하고 있고, 앞으로 당사 전장 설계분야에서 많은 M/H감소를 기대하고 있다. ROUCAS SYSTEM은 6개의 MODULE로 구성되어 있고, CABLE AUTO-ROUTING 은 CABLE PLAN MODULE에 속해 있으며 ROUCAS SYSTEM의 핵심이라고 할 수가 있다.

  • PDF

Optimal Routing and Uncertainty Processing using Geographical Information for e-Logistics Chain Execution

  • Kim, Jin Suk;Ryu, Keun Ho
    • Management Science and Financial Engineering
    • /
    • v.10 no.2
    • /
    • pp.1-28
    • /
    • 2004
  • The integrated supply chain of business partners for e-Commerce in cyber space is defined as Logistics Chain if the cooperative activities are logistics-related. Logistics Chain could be managed effectively and efficiently by cooperative technologies of logistics chain execution. In this paper, we propose a routing and scheduling algorithm based on the Tabu search by adding geographical information into existing constraint for pick-up and delivery process to minimize service time and cost in logistics chain. And, we also consider an uncertainty processing for the tracing of moving object to control pick-up and delivery vehicles based on GPS/GIS/ITS. Uncertainty processing is required to minimize amount of telecommunication and database on vehicles tracing. Finally, we describe the Logistics Chain Execution (LCE) system to perform plan and control activities for postal logistics chain. To evaluate practical effects of the routing and scheduling system, we perform a pretest for the performance of the tabu search algorithm. And then we compare our result with the result of the pick-up and delivery routing plan generated manually by postmen.

A Support System for Design and Routing Plan

  • Park, Hwa-Gyoo;Shon, Ju-Chan;Park, Sung-Gin;Baik, Jong-Myung
    • Proceedings of the CALSEC Conference
    • /
    • 1999.07b
    • /
    • pp.607-614
    • /
    • 1999
  • In this paper, we demonstrate the implementation case using component based development tool under development process for application developments. The tool suggested provides the programming environment for the development of distributed manufacturing applications primarily. The development tool is classified into visual component, logic component, data component, knowledge component, neural net component, and service component which is a core component for the support component edit and execution. We applied the tool to the domain of the design and routing plan to retrieve existing similar design models in database, initiate a model, generate a process plan, and store the new model in the database automatically. Utilizing the tool, it integrates a geometric modeler, engineering/manufacturing database, and knowledge sources over the Internet.

  • PDF

Study on Vehicle Routing Problem of Artillery Position Construction for Survivability Support (포병화력 생존성지원을 위한 진지구축경로문제 연구)

  • Moon, Jung-Hyun;Lee, Sang-Heon
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.37 no.3
    • /
    • pp.171-179
    • /
    • 2011
  • In this paper, we deal with the vehicle routing problem that could establish operational plan of military engineer for survivability support of artillery position construction. We propose VRPTW(vehicle routing problem with time-window) model of special form that considered service level to reflect the characteristics of military operations rather than the logic of economic efficiencies in the objective function. Furthermore we suggest modified particle swarm optimization algorithm for service based vehicle routing problem solution that can be possible to search in complicated and uncertain area and control relation softly between global and local search.

An Enumeration Algorithm for the Rolling Stock Requirement Plan (철도차량소요계획을 위한 열거알고리듬)

  • Kim Seongho;Kim Dong-Hee;Choi Tae-Sung
    • Proceedings of the KSR Conference
    • /
    • 2004.06a
    • /
    • pp.514-521
    • /
    • 2004
  • A routing is the path that an actual train set follows as it moves from one train to another train in a timetable. The number of routings is equivalent to the number of trainsets required to cover the timetable. The primary factors of rolling stock requirement plan include evaluating the minimum number of routings. This can be formulated as a set partitioning problem and solved using enumeration method or column generation method. In this paper we presents an enumeration algorithm which is useful to implement the enumeration method for the rolling stock requirement plan.

  • PDF