• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.11a
• /
• pp.252-255
• /
• 2003

This article concerns the event management of the transportation and delivery system in the real time environment. Until now mainstream researches in the transportation and delivery area have largely focused how to create optimized vehicle routing schedule fast and stably, although the execution and event management area has a lot of opportunities which could make logistics efficient and especially customers satisfied. This paper suggests to-be model processes how to execute vehicle routing schedule correctly and when events are occurred how to cope with them effectively. To embody such ideas GIS, GPS and Mobile technologies are attached on optimizing scheduler engine, TMS, WMS, ATP and Monitoring system.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.26 no.2
• /
• pp.68-74
• /
• 2003

Modem automated manufacturing processes employ automated guided vehicles(AGVs) for material handling, which serve several machining centers(MCs) in a factory. Optimal scheduling of AGVs can significantly help to increase the efficiency of the manufacturing process by minimizing the idle time of MCs waiting for the raw materials. In this paper, we will analyse the requirements for an optimal schedule and then provide a mathematical framework for an efficient schedule of material delivery by an AGV. With this model, the optimal number of MCs to be utilized will also be determined. Finally, the material delivery schedule employing multiple journeys to the MCs by the AGV will be carried out. Through rigorous analysis and simulation experiments, we shall show that such a delivery strategy will optimize the overall performance.

• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.2
• /
• pp.160-170
• /
• 2009

This paper studies a vehicle routing problem variant which considers customers to require simultaneous delivery and pick-up under time windows(VRPSDP-TW). The objective of this paper is to minimize the total travel distance of routes that satisfy both the delivery and pick-up demand. We propose a heuristic algorithm for solving the VRPSDP-TW, based on the ant colony system(ACS). In route construction, an insertion algorithm based ACS is applied and the interim solution is improved by local search. Through iterative processes, the heuristic algorithm drives the best solution. Experiments are implemented to evaluate a performance of the algorithm on some test instances from literature.

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

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.10a
• /
• pp.334-334
• /
• 1994

• Journal of Korean Society of Transportation
• /
• v.23 no.4 s.82
• /
• pp.81-91
• /
• 2005

The Traveling Salesman Problem(TSP) is one of the NP-complete (None-deterministic Polynomial time complete) route optimization problems. Its calculation time increases very rapidly as the number of nodes does. Therefore, the near optimum solution has been searched by heuristic algorithms rather than the real optimum has. This paper reviews the Ant System Algorithm(ANS), an heuristic algorithm of TSP and its applicability in the parcel delivery service in Korea. ASA, which is an heuristic algorithm of NP-complete has been studied by M. Dorigo in the early 1990. ASA finds the optimum route by the probabilistic method based on the cumulated pheromone on the links by ants. ASA has been known as one of the efficient heuristic algorithms in terms of its calculation time and result. Its applications have been expanded to vehicle routing problems, network management and highway alignment planning. The precise criteria for vehicle routing has not been set up in the parcel delivery service of Korea. Vehicle routing has been determined by the vehicle deriver himself or herself. In this paper the applicability of ASA to the parcel delivery service has been reviewed. When the driver s vehicle routing is assumed to follow the Nearest Neighbor Algorithm (NNA) with 20 nodes (pick-up and drop-off places) in $10Km{\times}10Km$ service area, his or her decision was compared with ASA's one. Also, ASA showed better results than NNA as the number of nodes increases from 10 to 200. If ASA is applied, the transport cost savings could be expected in the parcel delivery service in Korea.

• IE interfaces
• /
• v.17 no.spc
• /
• pp.28-36
• /
• 2004

The main purpose of this study is to find out the optimal solution of the vehicle routing problem considering heterogeneous vehicle(s), double-trips, and multi depots. This study suggests a mathematical programming model with new numerical formula which considers the amount of delivery and sub-tour elimination and gives optimal solution by using OPL-STUDIO(ILOG). This study also suggests modified genetic algorithm which considers the improvement of the creation method for initial solution, application of demanding point, individual and last learning method in order to find excellent solution, survival probability of infeasible solution for allowance, and floating mutation rate for escaping from local solution. The suggested modified genetic algorithm is compared with optimal solution of the existing problems. We found the better solution rather than the existing genetic algorithm. The suggested modified genetic algorithm is tested by Eilon and Fisher data(Eilon 22, Eilon 23, Eilon 30, Eilon 33, and Fisher 10), respectively.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.14 no.24
• /
• pp.141-147
• /
• 1991

This paper presents extended model for the vehicle routing problem, which allows multiple visits to a node by multiple vehicles. Multiple visits enables us split delivery. After formulating this multiple visits model mathematically, a two stage heuristic algorithm is developed by decomposition approach. This model consists of two sub-problem. The one is fixed cost transportation problem and the other is transportation problem.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1248-1251
• /
• 2002

Logistics optimization problems related with vehicle routing such as warehouse locating, track scheduling, customer order delivery, wastage pickup etc. are very interesting and important issues to date. Many Vehicle Routing and Scheduling Systems (VRSS) have been developed/proposed to optimize the logistics problems. But majority of them are dedicated to a particular problem and are unable to handle the real world spatial data directly. The system developed for one problem may not be suitable for others due to inter-problem constraint variations. The constraints may include geographical, environmental and road traffic nature of the working region along with other constraints related with the problem. So the developer always needs to modify the original routing algorithm in order to fulfill the purpose. In our study, we propose a general-purpose platform by combining GIS road map and Database Management System (DBMS), so that VRSS can interact with real world spatial data directly to solve different kinds of vehicle routing problems. Using the features of our developed system, the developer can frequently modify the existing algorithm or create a new one to serve the purpose.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.47 no.2
• /
• pp.168-175
• /
• 2024

Due to the complexity of urban area, the city vehicle routing problem has been a difficult problem. The problem has involved factors such as parking availability, road conditions, and traffic congestion, all of which increase transportation costs and delivery times. To resolve this problem, one effective solution can be the use of parcel lockers located near customer sites, where products are stored for customers to pick up. When a vehicle delivers products to a designated parcel locker, customers in the vicinity must pick up their products from that locker. Recently, identifying optimal locations for these parcel lockers has become an important research issue. This paper addresses the parcel locker location problem within the context of urban traffic congestion. By considering dynamic environmental factors, we propose a Markov decision process model to tackle the city vehicle routing problem. To ensure more real situations, we have used optimal paths for distances between two nodes. Numerical results demonstrate the viability of our model and solution strategy.