• Management Science and Financial Engineering
• /
• v.10 no.2
• /
• pp.1-28
• /
• 2004

The integrated supply chain of business partners for e-Commerce in cyber space is defined as Logistics Chain if the cooperative activities are logistics-related. Logistics Chain could be managed effectively and efficiently by cooperative technologies of logistics chain execution. In this paper, we propose a routing and scheduling algorithm based on the Tabu search by adding geographical information into existing constraint for pick-up and delivery process to minimize service time and cost in logistics chain. And, we also consider an uncertainty processing for the tracing of moving object to control pick-up and delivery vehicles based on GPS/GIS/ITS. Uncertainty processing is required to minimize amount of telecommunication and database on vehicles tracing. Finally, we describe the Logistics Chain Execution (LCE) system to perform plan and control activities for postal logistics chain. To evaluate practical effects of the routing and scheduling system, we perform a pretest for the performance of the tabu search algorithm. And then we compare our result with the result of the pick-up and delivery routing plan generated manually by postmen.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.4
• /
• pp.16-22
• /
• 2019

After Dantzig and Rasmer introduced Vehicle Routing Problem in 1959, this field has been studied with numerous approaches so far. Classical Vehicle Routing Problem can be described as a problem of multiple number of homogeneous vehicles sharing a same starting node and having their own routes to meet the needs of demand nodes. After satisfying all the needs, they go back to the starting node. In order to apply the real world problem, this problem had been developed with additional constraints and pick up & delivery model is one of them. To enhance the effectiveness of pick up & delivery, hub became a popular concept, which often helps reducing the overall cost and improving the quality of service. Lots of studies have suggested heuristic methods to realize this problem because it often becomes a NP-hard problem. However, because of this characteristic, there are not many studies solving this problem optimally. If the problem can be solved in polynomial time, optimal solution is the best option. Therefore, this study proposes a new mathematical model to solve this problem optimally, verified by a real world problem. The main improvements of this study compared to real world case are firstly, make drivers visit every nodes once except hub, secondly, make drivers visit every nodes at the right time, and thirdly, make drivers start and end their journey at their own homes.

• 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 Wetlands Research
• /
• v.6 no.3
• /
• pp.47-54
• /
• 2004

A hydraulically and hydrologically based estimation method of pollutant delivery load for water quality modeling is proposed. The proposed method works on grid basis and routes overland flows from one cell to the next following the maximum downslope directions. The method is able to consider spatially-varied data of source pollutant, topography, land slopes, soil characteristics, land use and aspects, which can be extracted from geographic information systems (GIS) and from digital elevation models (DEMs). Because of this feature, the proposed method can be expected to be used for evaluating the impacts of various practices on watershed management for water quality.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.6
• /
• pp.3023-3031
• /
• 2013

In this paper, we propose a robot control data generation system applying context aware mechanism in order to control the robot manipulator which automatically sorts parcels. The context aware mechanism generates intelligent information to control a robot using context data such as the parcel shape, weight, location and barcodes. The proposed system collects context data of the parcel and generates robot control data to pick up and drop parcels. Then a robot manipulator, which receives control data of picking-up and dropping, processes the automated sorting of parcels according to delivery persons and delivery routes. It will contribute not only to save much time and cost but also to reduce the industrial accidents.

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

• Journal of the Korean Society for Library and Information Science
• /
• v.51 no.2
• /
• pp.237-253
• /
• 2017

There are many systematic approaches to manage Interlibrary loan (ILL) efficiently. In this paper, we propose an operating method reducing user-waiting in ILL. Users are usually informed to wait around two to three days in a regional ILL service. The reason of the waiting is that there is inefficiency in running material-delivery vehicles. A mixed integer programming is employed to resolve this issue. It provides an optimal vehicle-route maximizing material-deliveries subject to time availability. We used an actual data of a regional ILL system to provide optimal vehicle routes under different time settings.

• Journal of Korean Institute of Industrial Engineers
• /
• v.39 no.6
• /
• pp.554-561
• /
• 2013

As a special topic of the vehicle routing problems (VRP), VRPSDP extends the vehicle routing problem as considering simultaneous pickup and delivery for goods. The past studies have mainly dealt with a only weight constraint of a loading capacity for heterogeneous products. However. this study suggests VRPSDP considering separate loading area according to characteristics of loading species. The objective is to design a set of minimum distance routes for the vehicle routing assignment with independent capacity for heterogeneous species. And then we present a another HVRPSDP model which is easy to utilizes in a unique circumstance that is a guarantee of executing a task simultaneously from the various areas under restricted time and raising an application of vehicles that returns at the depot for the next mission like the military group. The optimal results of the suggested mathematical models are solved by the ILOG CPLEX software ver. 12.4 that is provided by IBM company.

• Journal of Navigation and Port Research
• /
• v.28 no.8
• /
• pp.679-685
• /
• 2004

Logistics needs in Asia are surprisingly increasing due to rapid growth of China Therefore, each country is trying to develop ports in order to attract logistics needs. Korea, also, begins to perform active port marketing policy, centering around Busan port and Kwangyang port, in order to become a logistics hub in Northeast Asia Recently, competitiveness of Japan has decreased due to increase in the inland transport costs, so Japanese is deliberating various counter plans. While Japan is stagnant, Korea has an opportunity for activating Busan port and Kwangyang port. This study estimates logistics costs by classifying types of delivery routes of Japanese imports and exports containers; that is, by dividing the case of using main ports in Japan, or Busan port and Kwangyang port. As a result, logistics costs are greatly reduced when the containers go by way of Busan port and Kwangyang port social and logistics costs.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.8 s.350
• /
• pp.47-58
• /
• 2006

Due to the movement of nodes, ad-hoc networks suffer from the problems such as the decrease of data delivery ratio, the increase of end-to-end delay, and the increase of routing overhead. The backup routing schemes try to solve these problems by finding the backup routes during the route discovery phase and using them when a route fails. Generally the backup routing schemes outperform the single-path routing schemes in terms of data delivery ratio, end-to-end delay, and routing overhead when the nodes move rapidly. But when the nodes don't move rapidly, the backup routing schemes generate more routing traffics than the single-path routing schemes because they need to exchange packets to find the backup route. In addition, when the backup route fails earlier than the main route, it can not use the backup route because in many backup route algorithms, the backup route is found only at the initial route discovery phase. RBR(Reactive Backup Routing Algorithm) proposed in this paper is an algorithm that provides more stable data delivery than the previous backup routing schemes through the selective maintenance of backup route and the backup route rediscovery. To do that RBR prioritize the backup routes, and maintain and use them selectively Thus it can also decrease the routing overheads. Also, RBR can increase data delivery ratio and decrease delay because it reestablishes the backup route when the network topology changes. For the performance evaluation, OPNET simulator is used to compare RBR with the single-path routing scheme and some of the well known backup routing schemes.