• Title/Summary/Keyword: and Route Optimization

Search Result 254, Processing Time 0.024 seconds

How Through-Process Optimization (TPO) Assists to Meet Product Quality

  • Klaus Jax;Yuyou Zhai;Wolfgang Oberaigner
    • Corrosion Science and Technology
    • /
    • v.23 no.2
    • /
    • pp.131-138
    • /
    • 2024
  • This paper introduces Primetals Technologies' Through-Process Optimization (TPO) Services and Through-Process Quality Control (TPQC) System, which integrate domain knowledge, software, and automation expertise to assist steel producers in achieving operational excellence. TPQC collects high-resolution process and product data from the entire production route, providing visualizations and facilitating quality assurance. It also enables the application of artificial intelligence techniques to optimize processes, accelerate steel grade development, and enhance product quality. The main objective of TPO is to grow and digitize operational know-how, increase profitability, and better meet customer needs. The paper describes the contribution of these systems to achieving operational excellence, with a focus on quality assurance. Transparent and traceable production data is used for manual and automatic quality evaluation, resulting in product quality status and guiding the product disposition process. Deviation management is supported by rule-based and AI-based assistants, along with monitoring, alarming, and reporting functions ensuring early recognition of deviations. Embedded root cause proposals and their corrective and compensatory actions facilitate decision support to maintain product quality. Quality indicators and predictive quality models further enhance the efficiency of the quality assurance process. Utilizing the quality assurance software package, TPQC acts as a "one-truth" platform for product quality key players.

Optimization Algorithm for KP and XTE Implementation on the Submarine Cable Work (해저케이블 작업에서의 KP와 XTE 구현을 위한 최적화 알고리즘)

  • 이태오;임재홍
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.3
    • /
    • pp.423-436
    • /
    • 2003
  • Submarine optical fiber cable construction consists of marine survey, PLGR(Pre Lay Grapnel Run), shore-end-work, laying order. PLGR is the work process which removes the oceanic contaminations(ropes, wires, nets etc.) in the route before laying the submarine optical cable. This PLGR is work to ease the cable lay safely in seabed, improve the performance of Plough and ROV((Remotely-Operated Vehicle) laying work, and protect laying equipment. This paper presents the optimization algorithm implementation of KP(Kilometer Post) and XTE(Cross Track Error) to manage marine survey and PLGR work efficiently. In this paper, we composes overall PLGR work, and proposed optimization algorithm of KP and XTE. For the validity evaluation of this paper, KP and XTE decision algorithm are implemented and tested.

Heterogeneous Fleet Vehicle Routing Problem with Customer Restriction using Hybrid Particle Swarm Optimization (Hybrid-PSO 해법을 이용한 수요지 제한이 있는 다용량 차량경로문제)

  • Lee, Sang-Heon;Hwang, Sun-Ho
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.35 no.2
    • /
    • pp.150-159
    • /
    • 2009
  • The heterogeneous fleet vehicle routing problem(HVRP) is a variant of the classical vehicle routing problem in which customers are served by a heterogeneous fleet of vehicles with various capacities, fixed costs and variable costs. We propose a new conceptual HVRPCR(HVRP with customer restriction) model including additional customer restrictions in HVRP. In this paper, we develop hybrid particle swarm optimization(HPSO) algorithm with 2-opt and node exchange technique for HVRP. The solution representation is a n-dimensional particle for HVRP with N customers. The decoding method for this representation starts with the transformation of particle into a priority list of customer to enter route and limit of vehicle to serve each customer. The vehicle routes are then constructed based on the customer priority list and limit of vehicle to serve. The proposed algorithm is tested using 8 benchmark problems and it consistently produces high-quality solutions, including new best solutions. The numerical results show that the proposed algorithm is robust and efficient.

An Ant-based Routing Method using Enhanced Path Maintenance for MANETs (MANET에서 향상된 경로 관리를 사용한 개미 기반 라우팅 방안)

  • Woo, Mi-Ae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.9B
    • /
    • pp.1281-1286
    • /
    • 2010
  • Ant-based routing methods belong to a class of ant colony optimization algorithms which apply the behavior of ants in nature to routing mechanism. Since the topology of mobile ad-hoc network(MANET) changes dynamically, it is needed to establish paths based on the local information. Subsequently, it is known that routing in MANET is one of applications of ant colony optimization. In this paper, we propose a routing method, namely EPMAR, which enhances SIR in terms of route selection method and the process upon link failure. The performance of the proposed method is compared with those of AntHocNet and SIR. Based on he analysis, it is proved that the proposed method provided higher packet delivery ratio and less critical link failure than AntHocNet and SIR.

Mutual Authentication and Route Optimization between MN and CN using AAA in Mobile IPv6 (Mobile IPv6에서 AAA를 이용한 MN과 CN간의 상호 인증 및 경로 최적화)

  • 김미영;문영성
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.5
    • /
    • pp.429-437
    • /
    • 2004
  • The mobileip working group is equipped with the RR(Return Routabilit) taking the simple procedures and small amount of cryptographic operations by considering the processing capability of the mobile node however it dose not provide security features enough. To replace with enhanced methods, mobileip WG is making an effort to find the approved solutions include CGA(Craptographically Generated Address), IPsec(Internet Protocol Security) as well as the existing infrastructure such as AAA(Authentication, Authorization and Account) and PKI(Public Key Infrastructure). In this paper, we propose the authentication and route optimization based on AAA suitable for the requested security service for its successful story in wireless network such as 802.11 and 3GPP(3rd Generation Partnership Project) as well as wired one. We analyze the effectiveness of our scheme according to the traffic and mobility properties. The result shows the cost reduction up to 20 percent comparing with RR.

An Improved Route Optimization Algorithm for RMTP Support in the NEMO Environment (NEMO 환경에서 RMTP를 지원하기 위한 개선된 경로 최적화 알고리즘)

  • Joe, In-Whee;Kim, Jae-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.1A
    • /
    • pp.67-72
    • /
    • 2011
  • There are lots of researches for mobility of MS(mobile station) in All IP based network. Specially, NEMO(NEwork MObility) is not supporting mobility of each MS but supporting mobility of network that include group of MS. Some research try to overcome limitation of wireless with the protocol in wired state and it maintains the performance such as wire environment. There are no researches about multicast with reliability in NEMO. Therefore, this paper suggests efficient algorithm to solve problems when RMTP(Reliable Multicast Transport Protocol) apply to NEMO environment to support high reliability with multicast. And this paper shows the better performance of proposed algorithm for delay and transmission rate between AR and TLMR comparing with RMTP in NEMO.

Mobility Management and Smooth handoffs for Mobile-IP (Mobile-IP에서의 이동성 관리와 Smooth handoffs)

  • 노경택
    • Journal of the Korea Society of Computer and Information
    • /
    • v.4 no.4
    • /
    • pp.163-169
    • /
    • 1999
  • Mobile-IP has been designed to have mobile computer users move from place to place without changing their IP addresses. Mobile-IP introduces the following entities to support mobility: Home Agent. Foreign Agent, etc., and it uses the techniques such as Agent Discovery, Registration. and Tunnelling. Mobile-IP route optimization provides a mechanism by which correspondent nodes are enable to know the mobile host's care-of address to alleviate the triangle routing problem. As a further performance improvement, to alleviate the overhead resulted from the frequent local mobility within a site hierarchical foreign agents are presented, and as a foreign agent which is willing to participate in communication maintain a buffering mechanism not to loss packets for mobile host, smooth handoffs is presented. In this paper, the problems to be thought to support host's mobility and the existing method to support it is discussed.

  • PDF

HPR: Hierarchical Prefix Routing for Nested Mobile Networks (HPR: 중첩된 이동 망에 대한 계층적 프리픽스 라우팅)

  • Rho, Kyung-Taeg
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.5 s.43
    • /
    • pp.165-173
    • /
    • 2006
  • Network Mobility Basic Support protocol enables mobile network to change their point of attachment to the Internet, but causes some problems such as suboptimal muting and multiple encapsulations. The proposed scheme, combining Prefix Delegation protocol with HMIPv6 concept can provide more effective route optimization and reduce the amount of packet losses and the burden of location registration for handoff. It also uses hierarchical mobile network prefix (HMNP) assignment and provides tree-based routing mechanism to allocate the location address of mobile network nodes (MNNs) and support micro-mobility. In this scheme, Mobility Management Router (MMR) not only maintains the binding informations for all MNNs in nested mobile networks, but also supports binding procedures to reduce the volume of handoff signals oyer the mobile network. The performance is evaluated using NS-2.

  • PDF

A Formal Security Analysis on the Enhanced Route Optimization Protocol for Mobile IPv6 (이동 IPv6의 확장된 경로 최적화프로토콜에 대한 형식화된 보안 분석)

  • You, Il-Sun;Kim, Heung-Jun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.4
    • /
    • pp.691-699
    • /
    • 2009
  • Recently, the ERO protocol has been adopted as a standard to protect the routing optimization mode introduced by MIPv6. This protocol uses the public key cryptography and the early binding update method to improve the Return Routeability protocol while optimizing both security and performance. On the other hand, though various security approaches including the ERO protocol have been proposed for MIPv6, they lack formal verification. Especially, to our best knowledge, there is no formal analysis on the ERO protocol. In order to provide a good example for formal analysis on MIPv6 security protocols, this paper verifies the correctness of the ERO protocol through BAN-logic. For this goal, BAN-logic is extended to consider the address tests on the mobile nodes's CoA and HoA. It is expected that the analysis presented in this paper will be useful for the formal verifications on the security protocols related to MIPv6.

Route Optimization Using a Limited Prefix Delegation Method in Multi-level Nested Mobile Network Environments (다단 중첩된 이동네트워크 환경에서 제한된 프리픽스 위임 방법을 이용한 경로최적화)

  • Song, Jung-Wook;Han, Sun-Young
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.4
    • /
    • pp.309-321
    • /
    • 2009
  • Nowadays, requests of connecting to the Internet while moving are increasing more and more, and various technologies have been developed for satisfying those requests. The IETF nemo WG standardized "Network Mobility Basic Support Protocol" for supporting mobile network through extending existing MIPv6 protocol for supporting host mobility. But, mobile networks can be nested while they are changing their location. And if they are multi -level nested, that causes some problems because of protocol characteristic. In this paper, we try to solve the problem that is complicated routing path caused by multi-level nesting of mobile networks with our limited prefix delegation method. We give a little modification to the standard protocol and add some functions to mobile router. With results from analysis, we could say that our method has better performance than other proposed methods.