• Title/Summary/Keyword: Logistics IT Solution

Search Result 94, Processing Time 0.025 seconds

A TECHNIQUE WITH DIMINISHING AND NON-SUMMABLE STEP-SIZE FOR MONOTONE INCLUSION PROBLEMS IN BANACH SPACES

  • Abubakar Adamu;Dilber Uzun Ozsahin;Abdulkarim Hassan Ibrahim;Pongsakorn Sunthrayuth
    • Nonlinear Functional Analysis and Applications
    • /
    • v.28 no.4
    • /
    • pp.1051-1067
    • /
    • 2023
  • In this paper, an algorithm for approximating zeros of sum of three monotone operators is introduced and its convergence properties are studied in the setting of 2-uniformly convex and uniformly smooth Banach spaces. Unlike the existing algorithms whose step-sizes usually depend on the knowledge of the operator norm or Lipschitz constant, a nice feature of the proposed algorithm is the fact that it requires only a diminishing and non-summable step-size to obtain strong convergence of the iterates to a solution of the problem. Finally, the proposed algorithm is implemented in the setting of a classical Banach space to support the theory established.

Preparation and Characterization of ClO2 Self-Releasing Smart Sachet (이산화염소 자체 방출 스마트 샤쉐의 제조 및 특성 연구)

  • Junseok Lee;Hojun Shin;Sadeghi Kambiz;Jongchul Seo
    • KOREAN JOURNAL OF PACKAGING SCIENCE & TECHNOLOGY
    • /
    • v.29 no.1
    • /
    • pp.1-7
    • /
    • 2023
  • Chlorine dioxide (ClO2) is widely used for post-harvest sterilization treatment. However, there are limitations in the retail application of ClO2 due to difficulties in handling, expensive facilities, and safety concerns. Therefore, it is necessary to develop a ClO2 technology that can be easily applied and continuously released for a long period. In this study, a series of ClO2 self-releasing sachets were developed. First, poly(ether-block-amide) (PEBAX) and polyethylene-glycol (PEG) composite films containing different ratios of citric acid (CA) were prepared using the solution casting method. The as-prepared PEBAX/PEG-CA composite films were evaluated using FT-IR, DSC, and TGA to confirm chemical structure and thermal properties. Subsequently, PEBAX/PEG-CA composite films were designed in the form of a sachet and NaClO2 powder was transferred into the sachet to achieve a ClO2 self-releasing system. The ClO2-releasing behavior of the sachet was investigated by measuring the release amount of the gas using UV-vis. The release amount of ClO2 increased with increasing CA contents owing to the existence of higher protons (trigger) in the polymer matrix. Further, ClO2 gas was released for a longer time. Therefore, the as-prepared smart sachet can be tuned according to applications and packaging sizes to serve an optimal sterilization effect.

A Study on 4PL Development to Improve Air Cargo Process (항공물류 프로세스 개선을 위한 4PL 도입 연구)

  • Na, Hyeong-Seok;Jho, Yong-Chul;Lee, Chang-Ho
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2008.04a
    • /
    • pp.383-387
    • /
    • 2008
  • Nowadays, the tendency of world air cargo is noteworthy and air traffic in terms of cargo throughput will no doubt grow significantly in the new Region, with India and China's booming economy and the upcoming Olympics 2008. For example, in the first 11 months of 2006 cargo traffic was increased by 6.3%. First of all, the market of air cargo in Korea grows very quickly and diversifies. It is an essential factor in the process of development of Northeast-Asia as a hub for Air Cargo logistics. However the process of air cargo in Korea is complex as compared with other north-east asia nations. At the same time, it has many problems and causes inconvenience to owners of freight. This paper investigated the process of air cargo in Korea now and analyzed problems of the process. We emphasize that 4PL is the excellent solution from among many alternatives. It is also worthy of notice that EPCglobal network strengthen the role of 4PL. In conclusion, the 4PL system based on EPCglobal network will result in a good success, so it will raise a prestige of air cargo in Korea to a higher position.

  • PDF

A Study on SCM System Construction Strategy Using a Statistical Method (통계기법을 이용한 SCM 시스템 구축 전략에 관한 연구)

  • 서장훈;김용범;김우열
    • Journal of the military operations research society of Korea
    • /
    • v.28 no.1
    • /
    • pp.17-28
    • /
    • 2002
  • Recently, To define an enterprise's survival strategy is a difficult task, because the competition of a business is a complexity. The reason is the original research uses a statistical survey method. On a conceptual point of SCM, - as an order of development, physical distribution, logistics management, basic supply chain management and advanced supply chain management etc - a supervisor is magnifying gradually as well as confusing with information and analysis techniques which seems possible. On executing this, however, it has many problems since it is hard and wide; therefore, The Manager don't aware a total executable solution even though the enterprise knows necessity of SCM. On this paper focus on a proposal of alternatives with reasonableness of manufacturing and making a profit of sales department like most of enterprises are willing to overcome such as carelessness and unready strategy of investment additionally, the thesis should effort to find an element through an analysis of cases, a statistical method of effective SCM, and actual survey to propose an alternative; moreover, this paper proved the facts that it could be a guiding company, which has an ability of cooperation with entities through the founding of supply chain. As a conclusion, this essay showed the variation that influences the capacity entities and alternative to define an element which basically influence for a cause and effect.

Implementation of MAPF-based Fleet Management System (다중에이전트 경로탐색(MAPF) 기반의 실내배송로봇 군집제어 구현)

  • Shin, Dongcheol;Moon, Hyeongil;Kang, Sungkyu;Lee, Seungwon;Yang, Hyunseok;Park, Chanwook;Nam, Moonsik;Jung, Kilsu;Kim, Youngjae
    • The Journal of Korea Robotics Society
    • /
    • v.17 no.4
    • /
    • pp.407-416
    • /
    • 2022
  • Multiple AMRs have been proved to be effective in improving warehouse productivity by eliminating workers' wasteful walking time. Although Multi-agent Path Finding (MAPF)-based solution is an optimal approach for this task, its deployment in practice is challenging mainly due to its imperfect plan-execution capabilities and insufficient computing resources for high-density environments. In this paper, we present a MAPF-based fleet management system architecture that robustly manages multiple robots by re-computing their paths whenever it is necessary. To achieve this, we defined four events that trigger our MAPF solver framework to generate new paths. These paths are then delivered to each AMR through ROS2 message topic. We also optimized a graph structure that effectively captures spatial information of the warehouse. By using this graph structure we can reduce computational burden while keeping its rescheduling functionality. With proposed MAPF-based fleet management system, we can control AMRs without collision or deadlock. We applied our fleet management system to the real logistics warehouse with 10 AMRs and observed that it works without a problem. We also present the usage statistic of adopting AMRs with proposed fleet management system to the warehouse. We show that it is useful over 25% of daily working time.

An Optimal Intermodal-Transport Algorithm using Dynamic Programming (동적 프로그래밍을 이용한 최적복합운송 알고리즘)

  • Cho Jae-Hyung;Kim Hyun-Soo;Choi Hyung-Rim;Park Nam-Kyu;Kim So-Yeon
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 2006.05a
    • /
    • pp.95-108
    • /
    • 2006
  • Because of rapid expansion of third party logistics, fierce competition in the transportation industry, and the diversification and globalization of transportation channels, an effective transportation planning by means of multimodal transport is badly needed. Accordingly, this study aims to suggest an optimal transport algorithm for the multimodal transport in the international logistics. Cargoes and stopovers can be changed numerously according to the change of transportation modes, thus being a NP-hard problem. As a solution for this problem, first of all, we have applied a pruning algorithm to simplify it, suggesting a heuristic algorithm for constrained shortest path problem to find out a feasible area with an effective time range and effective cost range, which has been applied to the Label Setting Algorithm, consequently leading to multiple Pareto optimal solutions. Also, in order to test the efficiency of the algorithm for constrained shortest path problem, this paper has applied it to the actual transportation path from Busan port of Korea to Rotterdam port of Netherlands.

  • PDF

An Empirical Study on the Usage and Performance of Electronic Commerce in Northeast Asian Nations (동북아지역 국가들의 전자상거래 활용과 성과에 관한 실증적 연구)

  • Choi, Seok-Beom;Choi, Hyuk-Jun
    • International Commerce and Information Review
    • /
    • v.10 no.1
    • /
    • pp.3-31
    • /
    • 2008
  • Northeast Asia is expected to be on economic bloc which is competed with other economic blocs such as EU, NAFTA. E-Commerce based on IT and networking results in paradigm shift in Northeast Asian Nations, that is, Korea, China, Japan, Taiwan etc. There are the similarities and differences in e-Commerce situations in these nations. The differences are the gaps in e-Commerce infrastructures such as Internet, e-Commerce solution, e-payment system and e-logistics system etc. A number of interorganizational, intraorganizational and usage level factors influences the performances of all firms using e-Commerce tools. As result of this empirical study, China records low level of e-Commerce in terms of environmental aspects, usage and performance while Korea and Japan record relatively high levels. It is also found that non-economic performance is higher than economic performance in Northeast Asian firms. The purpose of this paper contributes to resolve the digital divide in Northeast Asia and to improve e-Commerce infrastructures in Northeast Asia by estimating current e-Commerce levels of Northeast Asian countries and suggesting future development strategies of those countries through e-Commerce cooperation.

  • PDF

Method for Selecting a Big Data Package (빅데이터 패키지 선정 방법)

  • Byun, Dae-Ho
    • Journal of Digital Convergence
    • /
    • v.11 no.10
    • /
    • pp.47-57
    • /
    • 2013
  • Big data analysis needs a new tool for decision making in view of data volume, speed, and variety. Many global IT enterprises are announcing a variety of Big data products with easy to use, best functionality, and modeling capability. Big data packages are defined as a solution represented by analytic tools, infrastructures, platforms including hardware and software. They can acquire, store, analyze, and visualize Big data. There are many types of products with various and complex functionalities. Because of inherent characteristics of Big data, selecting a best Big data package requires expertise and an appropriate decision making method, comparing the selection problem of other software packages. The objective of this paper is to suggest a decision making method for selecting a Big data package. We compare their characteristics and functionalities through literature reviews and suggest selection criteria. In order to evaluate the feasibility of adopting packages, we develop two Analytic Hierarchy Process(AHP) models where the goal node of a model consists of costs and benefits and the other consists of selection criteria. We show a numerical example how the best package is evaluated by combining the two models.

A study on the O2O Commerce Business Process with Business Model Canvas

  • PARK, Hyun-Sung
    • Journal of Distribution Science
    • /
    • v.18 no.5
    • /
    • pp.89-98
    • /
    • 2020
  • Purpose: The growth of online commerce is now becoming a major threat and a new opportunity for retailers. Existing offline retailers struggle to cope with new online retailers' threats by utilizing offline infrastructure. Besides, online retailers expand their online strengths to offline sales by opening their offline stores. Many retailers are paying close attention to the O2O business and the resulting changes. Thus, this research focuses on the O2O business model and process that retailers can adopt. Research design, data and methodology: Considering the features of products that retailers sell, this paper divides O2O business process with the following criteria: delivery lead-time and delivery area. And This research uses the business model canvas to define the features of O2O commerce business process. This paper also uses nine key elements in the business model canvas for analyzing the structure of O2O commerce business. Results: This paper suggests the delivery model of retailers respond to offline customer orders and summarizes the following results. (1) Considering characteristics such as logistics process, delivery area, and product type, we define the features of O2O business models: wide-area (warehouse) based O2O business model, regional area (store) based O2O business model and time-separated O2O business model. (2) This study checks the availability of the business model through the business cases of O2O business models. (3) This study also analyzes the O2O business model of domestic retail companies by the factors defined in the business model canvas. Conclusions: Retailers can adopt the O2O business process to fit their business requirements and strategy. The online retailers who deal with normal consumer products mainly have the wide-area based O2O business model. The wide-area based O2O business model can be suitable for retailers who manage inventory centrally. The time-separated O2O business model can be a good solution for fresh food retailers to operate the logistics process efficiently. And to shorten the delivery lead-time of fresh foods, the regional area based O2O business model can be fit to the retailer that utilizes its offline logistics or sales infrastructure. It may be much more important for retailers to share the inventory information with other branches and to change the role of offline stores.

Evaluating Reverse Logistics Networks with Centralized Centers : Hybrid Genetic Algorithm Approach (집중형센터를 가진 역물류네트워크 평가 : 혼합형 유전알고리즘 접근법)

  • Yun, YoungSu
    • Journal of Intelligence and Information Systems
    • /
    • v.19 no.4
    • /
    • pp.55-79
    • /
    • 2013
  • In this paper, we propose a hybrid genetic algorithm (HGA) approach to effectively solve the reverse logistics network with centralized centers (RLNCC). For the proposed HGA approach, genetic algorithm (GA) is used as a main algorithm. For implementing GA, a new bit-string representation scheme using 0 and 1 values is suggested, which can easily make initial population of GA. As genetic operators, the elitist strategy in enlarged sampling space developed by Gen and Chang (1997), a new two-point crossover operator, and a new random mutation operator are used for selection, crossover and mutation, respectively. For hybrid concept of GA, an iterative hill climbing method (IHCM) developed by Michalewicz (1994) is inserted into HGA search loop. The IHCM is one of local search techniques and precisely explores the space converged by GA search. The RLNCC is composed of collection centers, remanufacturing centers, redistribution centers, and secondary markets in reverse logistics networks. Of the centers and secondary markets, only one collection center, remanufacturing center, redistribution center, and secondary market should be opened in reverse logistics networks. Some assumptions are considered for effectively implementing the RLNCC The RLNCC is represented by a mixed integer programming (MIP) model using indexes, parameters and decision variables. The objective function of the MIP model is to minimize the total cost which is consisted of transportation cost, fixed cost, and handling cost. The transportation cost is obtained by transporting the returned products between each centers and secondary markets. The fixed cost is calculated by opening or closing decision at each center and secondary markets. That is, if there are three collection centers (the opening costs of collection center 1 2, and 3 are 10.5, 12.1, 8.9, respectively), and the collection center 1 is opened and the remainders are all closed, then the fixed cost is 10.5. The handling cost means the cost of treating the products returned from customers at each center and secondary markets which are opened at each RLNCC stage. The RLNCC is solved by the proposed HGA approach. In numerical experiment, the proposed HGA and a conventional competing approach is compared with each other using various measures of performance. For the conventional competing approach, the GA approach by Yun (2013) is used. The GA approach has not any local search technique such as the IHCM proposed the HGA approach. As measures of performance, CPU time, optimal solution, and optimal setting are used. Two types of the RLNCC with different numbers of customers, collection centers, remanufacturing centers, redistribution centers and secondary markets are presented for comparing the performances of the HGA and GA approaches. The MIP models using the two types of the RLNCC are programmed by Visual Basic Version 6.0, and the computer implementing environment is the IBM compatible PC with 3.06Ghz CPU speed and 1GB RAM on Windows XP. The parameters used in the HGA and GA approaches are that the total number of generations is 10,000, population size 20, crossover rate 0.5, mutation rate 0.1, and the search range for the IHCM is 2.0. Total 20 iterations are made for eliminating the randomness of the searches of the HGA and GA approaches. With performance comparisons, network representations by opening/closing decision, and convergence processes using two types of the RLNCCs, the experimental result shows that the HGA has significantly better performance in terms of the optimal solution than the GA, though the GA is slightly quicker than the HGA in terms of the CPU time. Finally, it has been proved that the proposed HGA approach is more efficient than conventional GA approach in two types of the RLNCC since the former has a GA search process as well as a local search process for additional search scheme, while the latter has a GA search process alone. For a future study, much more large-sized RLNCCs will be tested for robustness of our approach.