• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.36 no.3
• /
• pp.71-78
• /
• 2013

An efficient vehicle routing heuristic for different vehicle moving times for forward and backward between two points is studied in this research. Symmetric distance or moving times are assumed to move back and forth between two points in general, but it is not true in reality. Also, various moving speeds along time zones are considered such as the moving time differences between rush hours or not busy daytimes. To solve this type of extremely complicated combinatorial optimization problems, delivery zones are specified and delivery orders are determined for promising results on the first stage. Then delivery orders in each zone are determined to be connected with other zones for a tentative complete delivery route. Improvement steps are followed to get an effective delivery route for unsymmetric-time-varing vehicle moving speed problems. Performance evaluations are done to show the effectiveness of the suggested heuristic using computer programs specially designed and developed using C++.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.52 no.4
• /
• pp.19-26
• /
• 2010

To provide the basic information for the water quality management of the Sumjin River Basin, delivery ratios for flow duration were studied. Using the day-interval data set of discharge and water quality observed from the Chooryeong-cheon watershed, the flow-duration and discharge-load relation curves for the watershed were established, then the load-duration curve was constructed. Delivery ratios for flow duration were also developed. Delivery ratios showed wide variation according to flow conditions. In general, delivery ratio of high flow condition showed higher value reflecting nonpoint source pollution contribution from the forest dominating watershed. To resolve this problem, a regression model explaining the relation between flow rate and delivery ratio was suggested. The delivery ratios for different flow regime could be used for pollutant load estimation and TMDL (Total maximum daily load) development.

• International Journal of Computer Science & Network Security
• /
• v.21 no.12spc
• /
• pp.443-450
• /
• 2021

The study is devoted to the formation of a economic principles cargo delivery management in global supply chains. Mathematical model of delivering special categories of goods by road is a key element of these principles. The article analyzes the existing studies on solving the problem of cargo delivery in various aspects. It was noted that the greatest attention is paid to legal regulation, last mile delivery, optimization of routes and delivery schemes, information support, technological innovations, cluster routing, etc. In the developed mathematical model a minimum of total costs of forming loading units and freight shipments was defined as the criterion of optimality of organizing delivery by motor transport. The authors propose the creation of logistics clusters allowing the integration of urban transport flows and global supply chains.

• Journal of Industrial Convergence
• /
• v.13 no.1
• /
• pp.25-40
• /
• 2015

The aim of this study is to a study on the effects of fertile women on the low fertility in Korea. It is designed to research a model and established hypothesis with emphasis on major variables based on theoretical discussions. However, the result of the study is as follows. Firstly, this brought in delivery avoid phenomenon thus resulting in lower delivery phenomenon. The government should propose reasonable solutions to persuade female personal value and important elements of delivery rate at the same time. Secondly, Patriarchal stereotypes weighting household labor to female traditionally pressures working female with double burden as dual stance of work and family worsen the delivery will. Such atmosphere within a family generates female with an ability to get pregnancy to avoid marriage and delivery. Lastly, the research has pointed out the delivery support policy as most ineffective policy among government policies. To solve this problem, the government policy to recover delivery rate must be reviewed continuously and to be exercised immediately.

• Journal of Aerospace System Engineering
• /
• v.14 no.6
• /
• pp.1-9
• /
• 2020

Global e-commerce and delivery companies are actively pursuing last-mile delivery service using drones, and various delivery schedule planning studies have been conducted. In this study, separate individual route networks were constructed to reflect drone route constraints such as prohibited airspace and truck route constraints such as rivers, which previous studies did not incorporate. The A* algorithm was used to calculate the shortest path distance matrix between the starting point and destinations. In addition, we proposed an optimal delivery schedule plan using genetic algorithms and applied it to compare the efficiency with that of vehicle-only delivery.

• Management Science and Financial Engineering
• /
• v.18 no.1
• /
• pp.27-37
• /
• 2012

This paper is motivated by a military cargo-plane routing problem which is a pickup-and-delivery problem in which load splits and node revisits are allowed (PDPLS). Although this recent evolution of a VRP-model enhances the efficiency of routing, a solution method is more of a challenge since the node revisits entail closed walks in modeling vehicle routes. For such a case, even a compact IP-formulation is not available and an effective method had been lacking until Nowak et al. (2008b) proposed a heuristic based on a tabu search. Their method provides very reasonable solu-tions as demonstrated by the experiments not only in their paper (Nowak et al., 2008b) but also in ours. However, the computation time seems intensive especially for the class of problems with dynamic transportation requests, including the military cargo-plane routing problem. This paper proposes a more scalable algorithm hybridizing a tabu search for pricing subproblem paused as a single-vehicle routing problem, with a column generation approach based on Dantzig-Wolfe decomposition. As tested on a wide variety of instances, our algorithm produces, in average, a solution of an equiva-lent quality in 10~20% of the computation time of the previous method.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2009.06a
• /
• pp.149-150
• /
• 2009

The problem of vehicle routing problem(VRP) with pair operations of pick up and delivery are well-known in real applications in logistics networks, as in planning the routes for automatic guided vehicles(AGVs) in an automatic container terminal(ACT), warehouses or in some just-in-time services. This paper will present a formulation to modeling the problem mathematically which can be used to generate optimal routes of carried vehicles in the field to reduce the incurred cost of moving goods. This selected model could be used in (semi-)automatic short-term planning systems for vehicle fleet working in ACT, or in modern warehouses which the long list of requests is parted and sorted in preprocessing orders systems.

• The Journal of Industrial Distribution & Business
• /
• v.9 no.5
• /
• pp.25-35
• /
• 2018

Purpose - The purpose of this paper is to partition a last-mile delivery network into zones and to determine locations of last mile delivery centers (LMDCs) in Bangkok, Thailand. Research design, data, and methodology - As online shopping has become popular, parcel companies need to improve their delivery services as fast as possible. A network partition has been applied to evaluate suitable service areas by using METIS algorithm to solve this scenario and a facility location problem is used to address LMDC in a partitioned area. Research design, data, and methodology - Clustering and mixed integer programming algorithms are applied to partition the network and to locate facilities in the network. Results - Network partition improves last mile delivery service. METIS algorithm divided the area into 25 partitions by minimizing the inter-network links. To serve short-haul deliveries, this paper located 96 LMDCs in compact partitioning to satisfy customer demands. Conclusions -The computational results from the case study showed that the proposed two-phase algorithm with network partitioning and facility location can efficiently design a last-mile delivery network. It improves parcel delivery services when sending parcels to customers and reduces the overall delivery time. It is expected that the proposed two-phase approach can help parcel delivery companies minimize investment while providing faster delivery services.

• Journal of Korean Institute of Industrial Engineers
• /
• v.28 no.3
• /
• pp.256-263
• /
• 2002

This paper addresses a planning problem in a pickup-delivery transportation' system under dynamic vehicle dispatching. We present a procedure to determine a fleet size in which stochastic characteristics of vehicle travels are considered. Statistical approach and queueing theory are applied to estimate vehicle travel time and vehicle waiting time, based on which an appropriate fleet size is determined. Simulation experiments are performed to verify the proposed procedure.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.16 no.28
• /
• pp.195-202
• /
• 1993

This paper considers the vehicle routing problem taking account of not only delivery but pick-up at the same time. A mathematical formulation is presented for finding the route which satisfies all the demands of customers and enables picking up most containers without exceeding the capacity of the vehicle. A table comparing traveling distance and the pick-up amount is provided by using heuristic method, which will be of help to the decision makers.