• Title/Summary/Keyword: Distribution and Transportation Problem

Search Result 131, Processing Time 0.023 seconds

On the Needs of Vertical and Horizontal Transportation Machines for Freight Transportation Standard Containers to Derive Design Requirements Optimized for the Urban Railway Platform Environment

  • Lee, Sang Min;Park, Jae Min;Kim, Young Min;Kim, Joo Uk
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.13 no.4
    • /
    • pp.112-120
    • /
    • 2021
  • Recently, the number of consumers using digital online distribution platforms is increasing. This caused the rapid growth of the e-commerce market and increased delivery volume in urban areas. The logistics system, designed ar006Fund the city center to handle the delivery volume, operates a delivery system from the outskirts of the city to the urban area using cargo trucks. This maintains an ecosystem of high-cost and inefficient structures that increase social costs such as road traffic congestion and environmental problems. To solve this problem, research is being conducted worldwide to establish a high-efficiency urban joint logistics system using urban railway facilities and underground space infrastructure existing in existing cities. The joint logistics system begins with linking unmanned delivery automation services that link terminal delivery such as cargo classification and stacking, infrastructure construction that performs cargo transfer function by separating from passengers such as using cargo platform. To this end, it is necessary to apply the device to the vertical and horizontal transportation machine supporting the vertical transfer in the flat space of the joint logistics terminal, which is the base technology for transporting cargo using the transfer robot to the destination designated as a freight-only urban railway vehicle. Therefore, this paper aims to derive holistic viewpoints needs for design requirements for vertical and vertical transportation machines and freight transportation standard containers, which are underground railway logistics transport devices to be constructed by urban logistics ecosystem changes.

Consolidated transportation model for recycling of end-of-life electronic household appliances in South Korea (폐가전제품 재활용을 위한 공동회수모형)

  • Hur, Tae-Young;Won, Joong-Yeon;Kim, Hyun-Soo;Han, Dae-Hee;Han, Woo-Chul
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.7
    • /
    • pp.161-168
    • /
    • 2009
  • In this paper, we studied about an consolidated transportation model to transport EOL (end-of-life) electronic household appliances for recycling in South Korea. The objective is to minimize the total traveling distance of the vehicles transporting EOL electronic household appliances collected by local authorities and major manufacturers' distribution centers to assigned R/C(recycling center) in South Korea. Current reverse logistics for recycling EOL electronic household appliances is operated by local authorities and major manufacturers individually, and it is inefficient for the following reasons: excessive traveling distance, transportation cost, low truck capacity utilization, and so on. The presented model is developed to solve this problem. We apply a integer programming to solve this problem and present computational results using actual field data.

Partially Asynchronous Task Planning for Dual Arm Manipulators (양팔 로봇을 위한 부분적 비동기 작업 계획)

  • Chung, Seong Youb;Hwang, Myun Joong
    • The Journal of Korea Robotics Society
    • /
    • v.15 no.2
    • /
    • pp.100-106
    • /
    • 2020
  • In the agricultural field, interests in research using robots for fruit harvesting are continuously increasing. Dual arm manipulators are promising because of its abilities like task-distribution and role-sharing. To operate it efficiently, the task sequence must be planned adequately. In our previous study, a collision-free path planning method based on a genetic algorithm is proposed for dual arm manipulators doing tasks cooperatively. However, in order to simplify the complicated collision-check problem, the movement between tasks of two robots should be synchronized, and thus there is a problem that the robots must wait and resume their movement. In this paper, we propose a heuristic algorithm that can reduce the total time of the optimal solution obtained by using the previously proposed genetic algorithm. It iteratively desynchronizes the task sequence of two robots and reduces the waiting time. For evaluation, the proposed algorithm is applied to the same work as the previous study. As a result, we can obtain a faster solution having 22.57 s than that of the previous study having 24.081 s. It will be further studied to apply the proposed algorithm to the fruit harvesting.

A Study on Revitalizing the Introduction of a New Transit System (신교통시스템 도입 활성화에 관한 연구)

  • Kim, Pil-Soo;Chung, Jee-Seung;Choi, Youn-Cheol;Park, Cheol;Shin, Haw-Cheol;Kang, Weon-Dae
    • Proceedings of the KSR Conference
    • /
    • 2010.06a
    • /
    • pp.521-526
    • /
    • 2010
  • The existing city which consists of the downtown in Korea has been built spontaneously, and it is in difficulties for the distribution problem and traffic congestion since undersupply of social facilities cannot afford to handle the increasing traffic demand. So the traffic facilities have been reinforced to increase the competitiveness of the city and solve the related problems. The need of a new transit system considering the transport capacity and environment-friendliness is emerging as revitalization of public transportation is needed for reduce of personal transportation. In case of local governments that the Self-Reliance Ratio of local finance is high, if they promote the business by tram transit low which period could be shorten, it can correspond the traffic policy and invigorate the introduction of the new traffic system.

  • PDF

Aircraft application with artificial fuzzy heuristic theory via drone

  • C.C. Hung;T. Nguyen;C.Y. Hsieh
    • Advances in aircraft and spacecraft science
    • /
    • v.10 no.6
    • /
    • pp.495-519
    • /
    • 2023
  • The drone serves the customers not served by vans. At the same time, considering the safety, policy and terrain as well as the need to replace the battery, the drone needs to be transported by truck to the identified station along with the parcel. From each such station, the drone serves a subset of customers according to a direct assignment pattern, i.e., every time the drone is launched, it serves one demand node and returns to the station to collect another parcel. Similarly, the truck is used to transport the drone and cargo between stations. This is somewhat different from the research of other scholars. In terms of the joint distribution of the drone and road vehicle, most scholars will choose the combination of two transportation tools, while we use three. The drone and vans are responsible for distribution services, and the trucks are responsible for transporting the goods and drone to the station. The goal is to optimize the total delivery cost which includes the transportation costs for the vans and the delivery cost for the drone. A fixed cost is also considered for each drone parking site corresponding to the cost of positioning the drone and using the drone station. A discrete optimization model is presented for the problem in addition to a two-phase heuristic algorithm. The results of a series of computational tests performed to assess the applicability of the model and the efficiency of the heuristic are reported. The results obtained show that nearly 10% of the cost can be saved by combining the traditional delivery mode with the use of a drone and drone stations.

A Study on the Optimization of Fleet Operation for Industrial Carriers (인더스트리얼 캐리어를 위한 선대운영의 최적화에 관한 연구)

  • 김시화;곽민석
    • Journal of the Korean Institute of Navigation
    • /
    • v.22 no.4
    • /
    • pp.1-14
    • /
    • 1998
  • There are three basic modes of operation of ships: liner, tramp and industrial operations. Industrial operations, where the owner of the cargo, i.e. the industrial carrier controls the ships, abound in the shipment of bulk commodities, such as oil, chemicals and ores. Industrial carriers strive to minimize the shipping cost of their cargoes. This paper is concerned with the operational optimization problem of a fleet owned by major international oil company. The major oil company is a holding corporation for a group of oil producing, transporting, refining, and marketing companies located in various countries throughout the world. The operational optimization problem of the fleet is divided into two-phases. The front end corresponds to the optimization of transporting crude oil, product mix, and the distribution of product oil to meet market demand. The back end tackles the operational optimization problem of the fleet to meet the transportation demand derived from the front end. A case study is carried out with the H major oil company problem composed by reflecting the practices of an international major oil company. The results are summarized and examined in the point of optimization for the total operation of the H major oil company and the operational optimization problem of the fleet. The paper concludes with the remark that the results of the study might be useful and applicable in practices of these related decision problems.

  • PDF

Design of a High-Speed Data Packet Allocation Circuit for Network-on-Chip (NoC 용 고속 데이터 패킷 할당 회로 설계)

  • Kim, Jeonghyun;Lee, Jaesung
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2022.10a
    • /
    • pp.459-461
    • /
    • 2022
  • One of the big differences between Network-on-Chip (NoC) and the existing parallel processing system based on an off-chip network is that data packet routing is performed using a centralized control scheme. In such an environment, the best-effort packet routing problem becomes a real-time assignment problem in which data packet arriving time and processing time is the cost. In this paper, the Hungarian algorithm, a representative computational complexity reduction algorithm for the linear algebraic equation of the allocation problem, is implemented in the form of a hardware accelerator. As a result of logic synthesis using the TSMC 0.18um standard cell library, the area of the circuit designed through case analysis for the cost distribution is reduced by about 16% and the propagation delay of it is reduced by about 52%, compared to the circuit implementing the original operation sequence of the Hungarian algorithm.

  • PDF

Adaptive Mean Value Cross Decomposition Algorithms for Capacitated Facility Location Problems (제한용량이 있는 설비입지결정 문제에 대한 적응형 평균치교차분할 알고리즘)

  • Kim, Chul-Yeon;Choi, Gyung-Hyun
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.37 no.2
    • /
    • pp.124-131
    • /
    • 2011
  • In this research report, we propose a heuristic algorithm with some primal recovery strategies for capacitated facility location problems (CFLP), which is a well-known combinatorial optimization problem with applications in distribution, transportation and production planning. Many algorithms employ the branch-and-bound technique in order to solve the CFLP. There are also some different approaches which can recover primal solutions while exploiting the primal and dual structure simultaneously. One of them is a MVCD (Mean Value Cross Decomposition) ensuring convergence without solving a master problem. The MVCD was designed to handle LP-problems, but it was applied in mixed integer problems. However the MVCD has been applied to only uncapacitated facility location problems (UFLP), because it was very difficult to obtain "Integrality" property of Lagrangian dual subproblems sustaining the feasibility to primal problems. We present some heuristic strategies to recover primal feasible integer solutions, handling the accumulated primal solutions of the dual subproblem, which are used as input to the primal subproblem in the mean value cross decomposition technique, without requiring solutions to a master problem. Computational results for a set of various problem instances are reported.

Topology optimization of reinforced concrete structure using composite truss-like model

  • Yang, Zhiyi;Zhou, Kemin;Qiao, Shengfang
    • Structural Engineering and Mechanics
    • /
    • v.67 no.1
    • /
    • pp.79-85
    • /
    • 2018
  • Topology optimization of steel and concrete composite based on truss-like material model is studied in this paper. First, the initial design domain is filled with concrete, and the steel is distributed in it. The problem of topology optimization is to minimize the volume of steel material and solved by full stress method. Then the optimized steel and concrete composite truss-like continuum is obtained. Finally, the distribution of steel material is determined based on the optimized truss-like continuum. Several numerical results indicate the numerical instability and rough boundary are settled. And more details of manufacture and construction can be presented based on the truss-like material model. Hence, the truss-like material model of steel and concrete is efficient to establish the distribution of steel material in concrete.

A Genetic Algorithm for Vehicle Routing Problems with Mixed Delivery and Pick-up (배달과 수거가 혼합된 차량경로 결정문제를 위한 유전 알고리듬의 개발)

  • Chung, Eun-Yong;Park, Yang-Byung
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.30 no.4
    • /
    • pp.346-354
    • /
    • 2004
  • Most industrial logistic systems have focused on carrying products from manufacturers or distribution centers to customers. In recent years, they are faced with the problem of integrating reverse flows into their transportation systems. In this paper, we address the vehicle routing problems with mixed delivery and pick-up(VRPMDP). Mixed operation of delivery and pick-up during a vehicle tour requires rearrangement of the goods on board. The VRPMDP considers the reshuffling time of goods at customers, hard time windows, and split operation of delivery and pick-up. We construct a mixed integer mathematical model and propose a new genetic algorithm named GAMP for VRPMDP. Computational experiments on various types of test problems are performed to evaluate GAMP against the modified Dethloff's algorithm. The results show that GAMP reduces the total vehicle operation time by 5.9% on average, but takes about six times longer computation time.