• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.2
• /
• pp.265-272
• /
• 2007

The purpose of Vehicle Routing Problem (VRP) is to design the least costly (distance, time) routes for a fleet of identically capacitated vehicles to serve geographically scattered customers. There may be some restrictions such as the maximal capacity for each vehicle, maximal distance for each vehicle, time window to visit the specific customers, and so forth. This paper is concerned with VRP to minimize the sum of elapsed time from departure, where the elapsed time is defined as the time taken in a moving vehicle from the depot to each customer. It is important to control the time taken from departure in the delivery of perishable products or foods, whose freshness may deteriorate during the delivery time. An integer linear programming formulation is suggested and a heuristic for practical use is constructed. The heuristic is based on the set partitioning problem whose performances are compared with those of ILOG dispatcher. It is shown that the suggested heuristic gave good solutions within a short computation time by computational experiments.

• Journal of Industrial Convergence
• /
• v.21 no.8
• /
• pp.129-136
• /
• 2023

The purpose of this study was to test the effects of simulation-based delivery nursing practice on proactivity of problem-solving, clinical Performance and team efficacy in nursing college students. This study conducted with a quasi-experimental one group pretest-posttest design. The subjects of the study were those who participated in the pretest-posttest survey among third graders in nursing who took a simulation-based delivery nursing practice class at S university in D city, and finally, data from 78 students who completed the survey were analyzed. Data collection was conducted from August 30, 2022 to October 28, 2022, and data were analyzed using SPSS 27.0 program. The findings suggest that simulation-based delivery nursing practice had a positive effect by significantly increasing on problem-solving proactivity, clinical performance ability, and team efficacy. However, There are limitations in generalizing the study results. therefore based on a sufficient number of samples, the effects should be verified through randomized controlled pre-and post-test and, To determine whether the effects are consistent, it will be necessary to follow up in the long term.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.4
• /
• pp.331-341
• /
• 2011

This paper considers an inbound lot-sizing and outbound dispatching problem for a single product in a thirdparty logistics (3PL) distribution center. Demands are dynamic and finite over the discrete time horizon, and moreover, each demand has a delivery time window which is the time interval with the dates between the earliest and the latest delivery dates All the product amounts must be delivered to the customer in the time window. Ordered products are shipped by multiple vehicle types and the freight cost is proportional to the vehicle-types and the number of vehicles used. First, we formulate a mixed integer programming model. Since it is difficult to solve the model as the size of real problem being very large, we design a conventional genetic algorithm with a local search heuristic (HGA) and an improved genetic algorithm called adaptive genetic algorithm (AGA). AGA spontaneously adjusts crossover and mutation rate depending upon the status of current population. Finally, we conduct some computational experiments to evaluate the performance of AGA with HGA.

• Journal of Korean Institute of Industrial Engineers
• /
• v.40 no.4
• /
• pp.435-441
• /
• 2014

This paper considers a single-product problem for inbound lot-sizing and outbound dispatching at a third-party warehouse, where the demand is dynamic over the discrete time horizon. Each demand must be delivered into the corresponding delivery time window which is the time interval characterized by the earliest and latest delivery dates of the demand. Ordered products are shipped by heterogeneous container types. Each container type has type-dependent carrying capacity and the unit freight cost depends on each container type. Total freight cost is proportional to the number of each container type used. Also it is assumed that related cost functions are concave and backlogging is not allowed. The objective of the paper is to simultaneously determine the optimal inbound lot-sizing and outbound dispatching plans that minimize total costs which include ordering, shipping, and inventory holding costs. The optimal solution properties are characterized for the problem and then a dynamic programming algorithm is presented to find the optimal solution.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.4
• /
• pp.59-67
• /
• 2009

In wireless sensor networks (WSNs), geographic greedy forwarding fails to move a packet further towards its destination if the sender does not have any closer node to the destination in its one hop transmission region. In this paper, we propose a enhanced geographic routing, called CGR(Cost based Geographic Routing) for efficient data delivery against void problem environment. CGR first establishes Shadow Bound Region and then accomplishes Renewing Cost Function Algorithm for effective greedy forwarding data delivery. Our simulation results show significant improvements compared with existing schemes in terms of routing path length, success delivery ratio and energy efficiency.

• Journal of Information Technology Applications and Management
• /
• v.26 no.1
• /
• pp.53-64
• /
• 2019

The purpose of this study is to find out the fast delivery route that several drones return a truck again after departing from it for delivery locations at each cluster while the truck goes through the cluster composed of several delivery locations. The main issue is to reduce the total delivery time composed of the delivery time by relatively slow trucks via clusters and the sum of maximum delivery times by relatively fast drones in each cluster. To solve this problem, we use a three-step heuristic approach. First, we cluster the nearby delivery locations with minimal number of clusters satisfying a constraint of drone flight distance to set delivery paths for drones in each cluster. Second, we set an optimal delivery route for a truck through centers of the clusters using the TSP model. Finally, we find out the moved centers of clusters while maintaining the delivery paths for the truck and drones and satisfying the constraint of drone flight. distance in the two-dimensional region to reduce the total delivery time. In order to analyze the effect of this study model according to the change of the number of delivery locations, we developed a R-based simulation prototype and compared the relative efficiency, and performed paired t-test between TSP model and the cluster-based models. This study showed its excellence through this experimentation.

• International conference on construction engineering and project management
• /
• 2015.10a
• /
• pp.704-705
• /
• 2015

Recent research has been ongoing for modular buildings in the country, and interest increases. However, in accordance with legal restrictions in the country with regard to Project Delivery system of Modular Building, the activation of modular buildings industry is obstructed. In Korea, in accordance with national contract law, the construction contract is apply to the project delivery system of modular buildings, and in accordance with Framework Act on the Construction Industry, The project delivery system of modular buildings has to be a separate order. The definition of separate order in contract as defined in the law is that the electric work and Communication work and digestion facility work has to be separate each contract in order to be ensured professionalism. In accordance with law, the project delivery system of modular buildings is that the contract for construction is concluded with the Owner and the Construction Contractor and the contract for goods is concluded with the construction Contractor and modular manufacturer. Due to these project delivery system, the domestic factory production rate when making a modular unit is significantly reduced compared to the rate of factory production abroad and the domestic factory production rate is estimated to 10-20%. Due to the factory production rate is also low, despite what can be done at the factory the workload in construction field increases. According to the workload in field increases, the effect of the schedule reduction can be reduced. It resolved to form a consortium with a modular manufacturer and construction companies or the contract is concluded with Owner, modular manufacturer and construction companies in each. In this paper, we propose a specific project delivery system for modular building to solve the problem of the low factory production rate and the problem of schedule reduction. Through this paper, due to the variety of project delivery system on modular buildings is expected to contribute to the activation of modular buildings.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.2
• /
• pp.275-288
• /
• 1997

The container transportation problem is a kind of generalized pickup and delivery problem(GPDP), and a typical NP-hard problem of which polynomial algorithm has not yet been developed. In this problem, trucks have to transport containers from origins to destinations, while have to satisfy several restrictions such as request time, cargo closing time, driver's break time. In this paper, we present a straightforward heuristic and a user-interactive truck dispatching system which supports decision makers.

• The KIPS Transactions:PartC
• /
• v.8C no.5
• /
• pp.621-628
• /
• 2001

SET is one of the useful protocol for credit payment in the Electronic market. Since, the delivery problem is conformed to delivery cooperation not payment problem, the classic SET protocol didn\`t consider about the certification of delivery. But the environment of electronic market be changed to manage the sold, delivery and payment etc.. In this paper, based on this consider, we propose a new SET protocol which has an function to verify the delivery based on SKP and verify it after analyzed by Petri nets. Specially, we consider SKP between Customer, Merchant, and Acquirer for improve the verify function.

• Journal of Communications and Networks
• /
• v.16 no.6
• /
• pp.656-666
• /
• 2014

In delay tolerant networks (DTNs), delay is inevitable; thus, making better use of buffer space to maximize the packet delivery rate is more important than delay reduction. In DTNs, epidemic routing is a well-known routing protocol. However, epidemic routing is very sensitive to buffer size. Once the buffer size in nodes is insufficient, the performance of epidemic routing will be drastically reduced. In this paper, we propose a buffer scheme to optimize the performance of epidemic routing on the basis of the Lagrangian and dual problem models. By using the proposed optimal buffer scheme, the packet delivery rate in epidemic routing is considerably improved. Our simulation results show that epidemic routing with the proposed optimal buffer scheme outperforms the original epidemic routing in terms of packet delivery rate and average end-to-end delay. It is worth noting that the improved epidemic routing needs much less buffer size compared to that of the original epidemic routing for ensuring the same packet delivery rate. In particular, even though the buffer size is very small (e.g., 50), the packet delivery rate in epidemic routing with the proposed optimal buffer scheme is still 95.8%, which can satisfy general communication demand.