• Title/Summary/Keyword: Routing Planning

Search Result 122, Processing Time 0.025 seconds

Study of Supply-Production-Distribution Routing in Supply Chain Network Using Matrix-based Genetic Algorithm (공급사슬네트워크에서 Matrix-based 유전알고리즘을 이용한 공급-생산-분배경로에 대한 연구)

  • Lim, Seok-Jin;Moon, Myung-Kug
    • Journal of the Korea Safety Management & Science
    • /
    • v.22 no.4
    • /
    • pp.45-52
    • /
    • 2020
  • Recently, a multi facility, multi product and multi period industrial problem has been widely investigated in Supply Chain Network(SCN). One of keys issues in the current SCN research area involves minimizing both production and distribution costs. This study deals with finding an optimal solution for minimizing the total cost of production and distribution problems in supply chain network. First, we presented an integrated mathematical model that satisfies the minimum cost in the supply chain. To solve the presented mathematical model, we used a genetic algorithm with an excellent searching ability for complicated solution space. To represent the given model effectively, the matrix based real-number coding schema is used. The difference rate of the objective function value for the termination condition is applied. Computational experimental results show that the real size problems we encountered can be solved within a reasonable time.

Improved Social Force Model based on Navigation Points for Crowd Emergent Evacuation

  • Li, Jun;Zhang, Haoxiang;Ni, Zhongrui
    • Journal of Information Processing Systems
    • /
    • v.16 no.6
    • /
    • pp.1309-1323
    • /
    • 2020
  • Crowd evacuation simulation is an important research issue for designing reasonable building layouts and planning more effective evacuation routes. The social force model (SFM) is an important pedestrian movement model, and is widely used in crowd evacuation simulations. The model can effectively simulate crowd evacuation behaviors in a simple scene, but for a multi-obstacle scene, the model could result in some undesirable problems, such as pedestrian evacuation trajectory oscillation, pedestrian stagnation and poor evacuation routing. This paper analyzes the causes of these problems and proposes an improved SFM for complex multi-obstacle scenes. The new model adds navigation points and walking shortest route principles to the SFM. Based on the proposed model, a crowd evacuation simulation system is developed, and the crowd evacuation simulation was carried out in various scenes, including some with simple obstacles, as well as those with multi-obstacles. Experiments show that the pedestrians in the proposed model can effectively bypass obstacles and plan reasonable evacuation routes.

A reinforcement learning-based network path planning scheme for SDN in multi-access edge computing

  • MinJung Kim;Ducsun Lim
    • International journal of advanced smart convergence
    • /
    • v.13 no.2
    • /
    • pp.16-24
    • /
    • 2024
  • With an increase in the relevance of next-generation integrated networking environments, the need to effectively utilize advanced networking techniques also increases. Specifically, integrating Software-Defined Networking (SDN) with Multi-access Edge Computing (MEC) is critical for enhancing network flexibility and addressing challenges such as security vulnerabilities and complex network management. SDN enhances operational flexibility by separating the control and data planes, introducing management complexities. This paper proposes a reinforcement learning-based network path optimization strategy within SDN environments to maximize performance, minimize latency, and optimize resource usage in MEC settings. The proposed Enhanced Proximal Policy Optimization (PPO)-based scheme effectively selects optimal routing paths in dynamic conditions, reducing average delay times to about 60 ms and lowering energy consumption. As the proposed method outperforms conventional schemes, it poses significant practical applications.

An Efficient Heuristic to Solve Vehicle Routing Problem for Container Shuttle Service (컨테이너 셔틀 서비스를 위한 차량 경로 문제의 근사적 해법)

  • Shin, Jae-Young;Oh, Sung-Inn;Park, Jong-Won
    • Journal of Navigation and Port Research
    • /
    • v.33 no.8
    • /
    • pp.583-588
    • /
    • 2009
  • Generally, the container road transportation can be divided into three types; short distance, long distance and shuttle transportation. Specially, the shuttle service occurs several amounts of container which is same as O/D pairs. Also container vehicle can be divided into three types according to the chassis types of vehicle; only 20-feet container, only 40-feet container and combined chassis trailer. Combined chassis trailers can load two 20-feet containers or one 40-feet container. This paper deals with Vehicle Routing Problem (VRP) for delivering containers considering shuttle service. This problem is similar to the previously studied Shin and Oh (2008), but the characteristics of shuttle service must be considered additionally. We formulate the container shuttle transportation planning problem using combined chassis trailers based on VRP with pick-up and delivery which can visit each node more than one time, and propose an efficient solution procedure.

A Study on the Method of Assigning Ipv6 address for M-BcN (M-BcN을 위한 IPv6 주소 할당 방안 연구)

  • Kim, Gweon-Il;Lee, Sang-Hoon
    • Journal of the military operations research society of Korea
    • /
    • v.33 no.2
    • /
    • pp.87-100
    • /
    • 2007
  • The aspect of future warfare is NCW(Network Centric Warfare) in accordance with the IT development, so MND have the planning of M-BcN(Military Broadband convergence Network) establishment as the basic system of NCW by the end of 2008. IPv6 address must be managed systematically as a essential element of NCW. In the previous study, it is designed on the basis of the present military information communication network topology. However, it makes some problems. First, it is difficult for present topology to adapt the future M-BcN which is different from the present military network topology. Second, it has defects of inefficiency of route aggregation and enlargement of routing table size. In this paper, we improved the route aggregation and routing table size by assigning the hierarchical address on the basis of M-BcN topology and adjusting the position of field identifying service network. Furthermore, it is proved by the network simulation program(OPNET 12.0).

Efficient heuristic of vehicle routing problem for container shuttle service (컨테이너 셔틀 서비스를 위한 차랑 경로 문제의 근사적 해법)

  • Shin, Jae-Young;Oh, Sung-Inn;Park, Jong-Won
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2009.06a
    • /
    • pp.171-172
    • /
    • 2009
  • Generally, the container road transportal ion am be divided into three types; short distance, long distance and shuttle transportation. Also container vehicle am be divided into three types according to the chassis types of vehicle; only 20-feet container, only 40-feet container, combined chassis trailer. This paper deals with Vehicle Routing Problem(VRP) for delivering containers considering shuttle transportation. The shuttle service occurs several amounts of container which is same as O/D pairs. This problem is similar to the previously studied VRP for delivering containers using combined chassis trailers, but the characteristics of shuttle service must be considered additionally. We formulate the container shuttle transportation planning problem using combined chassis trailers based on VRP with pick-up and delivery which can visit each node more than one time, and propose an efficient solution procedure.

  • PDF

A Study on the Excavation of Tunnel Portal Zone Located at High Steep Slope (급경사 지형에 위치하고 있는 갱구부의 굴착 방안 연구)

  • Kim, Woo-Sung;Lee, Sang-Eun
    • Explosives and Blasting
    • /
    • v.26 no.2
    • /
    • pp.38-44
    • /
    • 2008
  • Recently, planning road construction in South Korea is focused on upgrading of the existing road by rerouting or restructuring. For this, roads under current construction in Korea go for more straight in its alignments and routing. Straight routing makes it all the more required to construct many mountain tunnels and bridges in Korea where mountains are so widely spread. Some portal of mountain tunnel is not rarely planed at high steep slope of mountain valley where it is not easy to secure working space for tunnel excavation. Reverse excavation is an alternative measure for excavation of tunnel portal at high steep slope. Construction in reverse excavation method has three important points requiring careful consideration: 1)planning of pilot tunnel in proper width, height, and length etc., 2)measure against the effect of one-side earth pressure to the direction of tunnel portal, 3)securing tunnel safety against shallow ground condition at portal zone. This paper intends to suggest applicable range of pilot tunnel for reverse excavation at the portal zone located at high steep slope, and shows result of study on the appropriateness of a reverse excavation by means of 3D numerical analysis. Result of 3D numerical analysis for reverse excavation at high steep slope shows that pilot tunneling will be applicable to start from the point $20{\sim}25m$ before the portal from inside the tunnel.

A Study on Deterministic Utilization of Facilities for Allocation in the Semiconductor Manufacturing (반도체 설비의 효율성 제고를 위한 설비 할당 스케줄링 규칙에 관한 연구)

  • Kim, Jeong Woo
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.39 no.1
    • /
    • pp.153-161
    • /
    • 2016
  • Semiconductor manufacturing has suffered from the complex process behavior of the technology oriented control in the production line. While the technological processes are in charge of the quality and the yield of the product, the operational management is also critical for the productivity of the manufacturing line. The fabrication line in the semiconductor manufacturing is considered as the most complex part because of various kinds of the equipment, re-entrant process routing and various product devices. The efficiency and the productivity of the fabrication line may give a significant impact on the subsequent processes such as the probe line, the assembly line and final test line. In the management of the re-entrant process such as semiconductor fabrication, it is important to keep balanced fabrication line. The Performance measures in the fabrication line are throughput, cycle time, inventory, shortage, etc. In the fabrication, throughput and cycle time are the conflicting performance measures. It is very difficult to achieve two conflicting goal simultaneously in the manufacturing line. The capacity of equipment is important factor in the production planning and scheduling. The production planning consideration of capacity can make the scheduling more realistic. In this paper, an input and scheduling rule are to achieve the balanced operation in semiconductor fabrication line through equipment capacity and workload are proposed and evaluated. New backward projection and scheduling rule consideration of facility capacity are suggested. Scheduling wafers on the appropriate facilities are controlled by available capacity, which are determined by the workload in terms of the meet the production target.

Characteristic Analysis on Urban Road Networks Using Various Path Models (다양한 경로 모형을 이용한 도시 도로망의 특성 분석)

  • Bee Geum;Hwan-Gue Cho
    • The Transactions of the Korea Information Processing Society
    • /
    • v.13 no.6
    • /
    • pp.269-277
    • /
    • 2024
  • With the advancement of modern IT technologies, the operation of autonomous vehicles is becoming a reality, and route planning is essential for this. Generally, route planning involves proposing the shortest path to minimize travel distance and the quickest path to minimize travel time. However, the quality of these routes depends on the topological characteristics of the road network graph. If the connectivity structure of the road network is not rational, there are limits to the performance improvement that routing algorithms can achieve. Real drivers consider psychological factors such as the number of turns, surrounding environment, traffic congestion, and road quality when choosing routes, and they particularly prefer routes with fewer turns. This paper introduces a simple path algorithm that seeks routes with the fewest turns, in addition to the traditional shortest distance and quickest time routes, to evaluate the characteristics of road networks. Using this simple path algorithm, we compare and evaluate the connectivity characteristics of road networks in 20 major cities worldwide. By analyzing these road network characteristics, we can identify the strengths and weaknesses of urban road networks and develop more efficient and safer route planning algorithms. This paper comprehensively examines the quality of road networks and the efficiency of route planning by analyzing and comparing the road network characteristics of each city using the proposed simple path algorithm.

Integrated Storage Function Model with Fuzzy Control for Flood Forecasting (I) - Theory and Proposal of Model - (홍수예보를 위한 통합저류함수모형의 퍼지제어 (I) - 이론 및 모형의 수립 -)

  • Lee, Jeong-Gyu;Kim, Han-Seop
    • Journal of Korea Water Resources Association
    • /
    • v.33 no.6
    • /
    • pp.689-699
    • /
    • 2000
  • This paper presents the integrated storage function model (ISFM) to improve the accuracy of the storage function model (SFM) which is widely employed for flood runoff analysis and its forecasting in Korea. In order to achieve this objective, the optimization method is applied for estimation of parameters of the model which dominate the accuracy of the analysis, which is usually taken by empirical formulae, and they are treated as time dependent variables. The fuzzy control technique is used to detennine the time variant parameters. In addition, the ISFM can be applied to the combined routing of the watershed and the channel with a residual watershed.ershed.

  • PDF