• Journal of the Korea Society of Computer and Information
• /
• v.27 no.8
• /
• pp.151-160
• /
• 2022

In this paper, we propose an algorithm that enables near-field delivery at a faster and lowest cost to meet the growing demand for delivery services. The algorithm proposed in this study involves subway passengers (shipper) in logistics movement as delivery sources. At this time, the passenger may select a delivery logistics matching subway route. And from the perspective of the service user, it is possible to select a delivery man whose route matches. At this time, the delivery source recommendation is carried out in a text similarity measurement method that combines TF-IDF&N-gram and BERT. Therefore, unlike the existing delivery system, two-way selection is supported in a man-to-man method between consumers and delivery man. Both cost minimization and delivery period reduction can be guaranteed in that passengers on board are involved in logistics movement. In addition, since special skills are not required in terms of transportation, it is also meaningful in that it can provide opportunities for economic participation to workers whose job positions have been reduced.

• Korean System Dynamics Review
• /
• v.12 no.1
• /
• pp.89-114
• /
• 2011

With steady increase in the demand for door-to-door delivery services, courier service providers are facing a constant pressure to reduce delivery price in order to secure quantity order and to improve the efficiency and reliability for customer service. The objective of this research is to explain the structure of the door-to-door delivery including door-to-door delivery service demand, sorting capacity in the hub-terminal, and the system performance measures such as service reliability networks using causal loop diagram(CLD). Based on causal relation, this research describes a comprehensive approach to examine how capacity reliability contributes to the renewal of the firm's competences through its reciprocal relationship with travel time reliability and connectivity reliability. Also, this research suggests the policy alternatives to improve effectiveness and efficiency of door-to-door delivery network in response to increase customer satisfaction and profit maximization of the courier service providers: operational, tactical, and strategic levels.

• 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.

• THE INTERNATIONAL COMMERCE & LAW REVIEW
• /
• v.67
• /
• pp.97-118
• /
• 2015

This study reviews the judgements by the Korean Supreme Court on the time of delivery of goods, as it depends on which bonded place the goods are kept for the purpose of the customs clearance. Thereafter, this study analyzes the Ocean Carrier's liability, when the cargoes are mis-delivered without the presentation of bill of lading in relation to the specific bonded place such as an independent bonded warehouse or a self-use bonded warehouse. Furthermore, considering that voyage charter is a kind of marine transport, this study also reviews whether or not the Court's judgements, which has been developed in respect of the carriage of affreightment, could be applied to voyage charter in respect of the time of delivery goods and the Ocean Carrier's liability for mis-delivery. Lastly, in the case that the substantial importer takes the goods from the independent bonded warehouse without the presentation of bill of lading after the customs clearance, it is noted that the Court has made the Ocean Carrier liable for the mis-delivery through the application of theory of double deposit contract. The position of the Court would be understandable in terms of the protection for the bona-fide holder of bill of lading, but this study reviews the limitation of liability as the device for the protection of the Ocean Carrier, considering the situation where the Ocean Carrier is somewhat unreasonably sacrificed under the bonded system provided for the convenience of substantial importer.

• Journal of Korea Society of Industrial Information Systems
• /
• v.12 no.4
• /
• pp.89-96
• /
• 2007

The amount of home deliveries are increasing day by day owing to the increment of the on-line market. This environment brings along generating many delivery companies and keen competition with each other in its customer hold Therefore, this study aims at the development of a shortest delivery route search demonstration system using Ant Algorithm. The developed system reduces the time consumption significantly in search of delivery path and time of the products for the novice delivery driver as well as experienced driver. Ultimately, the developed system will give the customer reliability and satisfaction, knowing a delivery route in advance.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.44 no.3
• /
• pp.106-116
• /
• 2021

This paper considers a joint problem for blood inventory planning at hospitals and blood delivery planning from blood centers to hospitals, in order to alleviate the blood service imbalance between big and small hospitals being occurred in practice. The joint problem is to determine delivery timing, delivery quantity, delivery means such as medical drones and legacy blood vehicles, and inventory level to minimize inventory and delivery costs while satisfying hospitals' blood demand over a planning horizon. This problem is formulated as a mixed integer programming model by considering practical constraints such as blood lifespan and drone specification. To solve the problem, this paper employs a Lagrangian relaxation technique and suggests a time efficient Lagrangian heuristic algorithm. The performance of the suggested heuristic is evaluated by conducting computational experiments on randomly-generated problem instances, which are generated by mimicking the real data of Korean Red Cross in Seoul and other reliable sources. The results of computational experiments show that the suggested heuristic obtains near-optimal solutions in a shorter amount of time. In addition, we discuss the effect of changes in the length of blood lifespan, the number of planning periods, the number of hospitals, and drone specifications on the performance of the suggested Lagrangian heuristic.

• Journal of the korean academy of Pediatric Dentistry
• /
• v.24 no.3
• /
• pp.704-709
• /
• 1997

Space maintainers needs following extraction of primary molars, due to severe dental caries under general anesthesia. Delivery of conventional space maintainers has three of the disadvantages of the method, there being a impression taking and time consuming due to laboratory procedure, and delivery problem due to relaxed tongue. For this problem improved, modified space maintainer is prefabricated before procedure, and adjust, delivery in operation room, favorable results were obtained. The following results were obtained. 1. Delivery time is very reduced than conventional space maintainers. 2. After space maintainer delivery, follow check-up, without impingement of soft tissue, distortion of wire. After space maintainer delivery, continuous research is required so that space maintainer delivery is applied to usual dental treatment, and it is necessary of long term research.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.53
• /
• pp.23-35
• /
• 1999

Since on-time delivery is becoming increasingly important in today's competitive markets, the development of effective scheduling methodologies to meet customer needs through on time delivery is of vital importance for the well-being of companies. The objective of this study is to develope a general heuristic algorithm for scheduling both the static and dynamic problems under certain on-time delivery criteria. For the problems with due-date related, we present insights for minimizing the number of tardy jobs and propose a heuristic scheduling algorithm. Experimental results show that the proposed algorithm performs significantly better than other dispatching rules within reasonable computation time, specially in the environment of strong competition for resources.

• 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.

• Korean System Dynamics Review
• /
• v.9 no.1
• /
• pp.199-218
• /
• 2008

Empirical studies have shown that government and human service nonprofit organizations have maintained active partnerships to deliver human services for the past several decades. However, the previous researches on resource dependent government-nonprofit service delivery have revealed serious methodological limitations to adequately demonstrate the dynamic relationship between both sectors over time. Since the dynamics underlying the government-nonprofit service delivery is a complex process, in which multiple factors dynamically interact over time, the assumptions of system dynamics can help improve these methodological drawbacks. This study aims to explore methodological issues and weaknesses observed in empirical studies on resource dependent government-nonprofit service delivery in the United States, and further attempts to provide insights on future research toward a dynamic approach, bringing the assumptions of system dynamics to the challenges of the previous researches.