• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.5
• /
• pp.70-77
• /
• 2012

Dial-a-ride is the most widely available transit service for disabled persons or seniors in the United States and Europe. This paper studies a static dial-a-ride problem considering multiple depots, heterogeneous vehicles, and soft time windows. In this paper, we apply a heuristic based on clustering first-routing second(HCR) to a real-world large dial-a-ride problem from Maryland Transit Administration(MTA). MTA's real operation is compared with the results of developed heuristic for 24 cases. The objective function of the proposed model is to minimize the total cost composed of the service provider's cost and the customers' inconvenience cost. For the comparison, the objective function values of HCR do not include waiting cost, delay cost, and excess ride cost. The objective function values from HCR are better than those from MTA's operation for all cases. This result shows that our heuristic method can make the real operation better and more efficient.

• Journal of Korean Society of Transportation
• /
• v.17 no.4
• /
• pp.47-58
• /
• 1999

The Purpose of this Paper is to develop a multi-period bus scheduling model, in which a decomposition technique is applied. In general a bus scheduling requires a vast amount of calculation. Thus, a bus scheduling is a very complicated problem even with a single depot and is almost unable to obtain the optimal solution theoretically with many depots. In this paper in order to simplify the problem, the whole operating hours of a day are partitioned into several time periods. In one period, the same headways are maintained. For one period, the bus scheduling is simple and the solution applying the FIFO(First-In, First-Out) Principle is the optimal. However, connection between Periods remains as another scheduling Problem with a reduced problem size. This paper suggests how to connect bus schedules of consecutive periods efficiently, minimizing the operating cost. Through case studies for multiple routes with a single depot, this decomposition technique is proved to be effective practically.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.36 no.4
• /
• pp.138-145
• /
• 2013

A sweep-based heuristic using common area is developed for multi-vehicle VRPs under time various and unsymmetric forward and backward vehicle moving speed. One depot and 2 delivery vehicle are assumed in this research to make the problem solving strategy simple. A common area is held to make adjustment of possible unbalance of between two vehicle delivery completion times. The 4 time zone heuristic is used to solve for efficient delivery route for each vehicle. The current size of common area needs to be studied for better results, but the suggested problem solving procedures can be expanded for any number of vehicles.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.595-598
• /
• 2002

This paper proposes neighborhood reduction techniques in local search of the customer decomposition subproblem in the Multi Depots Vehicle Routing Problem with Time Windows (MDVRPTW) by using geospatial relation among depots and customers. The neighborhood of the customer decomposition subproblem can be simply and well defined but it should include excessively bad solution candidates. Our techniques find such candidates by using information of the problem domain, geographical relation. We use our techniques in Tabu Search and evaluate the effectiveness in computer experiment.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.3
• /
• pp.63-79
• /
• 1994

Many vehicle fleet planning systems have been suggested to minimize the routing distances of vehicles or reduce the transportation cost. But the more considerations the method takes, the higher complexites are involved in a large number of practical situations. The purpose of this paper is to vehicle fleet planning system. This paper is considered multi-objective optimization. The vehicle fleet planning system developed by this study involves such complicated and restricted conditions as one depot, multiple nodes (demand points), multiple vehicle types, multipel order items, and other many restrictions for operating vehicles. The proposed algorithm is compared with the nearest neighbor heuristic (NNH) and the savings heuristic (SAH) algorithm in terms of total logistics cost and driving time. This method constructs a route with a minimum number of vehicles for a given demand. This method can be used to any companys which vehicle fleet planning system under circumstances considered in this paper.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.37 no.1
• /
• pp.133-140
• /
• 2014

An efficient heuristic for two-vehicle-one-depot problems is developed in this research. Vehicle moving speeds are various along hour based time intervals due to traffic jams of rush hours. Two different heuristics are examined. One is that the delivery area assignment is made using Sweep algorithm for two vehicles by splitting the whole area in half to equally divide all delivery points. The other is using common area by leaving unassigned area between the assigned for two vehicles. The common area is reassigned by two stages to balance the completion time of two vehicle's delivery. The heuristic with common area performed better than the other due to various vehicle moving speeds and traffic jams.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.60
• /
• pp.11-22
• /
• 2000

The main objective of this research is to analyze an order point and an order quantity of a distribution center and each branch to attain a target service level in multi-level inventory distribution system. In case of product item, we use the item with low volume of average monthly demand. Under the continuous review method, the distribution center places a particular order quantity to an outside supplier whenever the level of inventory reaches an order point, and receives the order quantity after elapsing a certain lead time. Also, each branch places an order quantity to the distribution center whenever the level of inventory reaches an order point, and receives the quantity after elapsing a particular lead time. When an out of stock condition occurs, we assume that the item is backordered. For considering more realistic situations, we use generic type of probability distribution of lead times. In the variable lead time model, the actually achieved service level is estimated as the expected service level. Therefore, this study focuses on the analysis of deciding the optimal order point and order quantity to achieve a target service level at each depot as a expected service level, while the system-wide inventory level is minimized. In addition, we analyze the order level as a maximum level of inventory to suggest more efficient way to develop the low demand item model.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.1
• /
• pp.8-20
• /
• 2019

The vehicle routing problem is one of the vibrant research problems for half a century. Many studies have extensively studied the vehicle routing problem in order to deal with practical decision-making issues in logistics. However, developments of new logistics strategies have inevitably required investigations on solution methods for solving the problem because of computational complexity and inherent constraints in the problem. For this reason, this paper suggests a simulated annealing (SA) algorithm for a variant of vehicle routing problem introduced by a previous study. The vehicle routing problem is a multi-depot and multi-trip vehicle routing problem with multiple heterogeneous vehicles restricted by the maximum permitted weight and the number of compartments. The SA algorithm generates an initial solution through a greedy-type algorithm and improves it using an enhanced SA procedure with three local search methods. A series of computational experiments are performed to evaluate the performance of the heuristic and several managerial findings are further discussed through scenario analyses. Experiment results show that the proposed SA algorithm can obtain good solutions within a reasonable computation time and scenario analyses show that a transportation system visiting non-dedicated factories shows better performance in truck management in terms of the numbers of vehicles used and trips for serving customer orders than another system visiting only dedicated factories.

• Journal of Korean Institute of Industrial Engineers
• /
• v.39 no.5
• /
• pp.393-402
• /
• 2013

The Mahalanobis-Taguchi System (MTS) is a diagnostic and predictive method for multivariate data. In the MTS, the Mahalanobis space (MS) of reference group is obtained using the standardized variables of normal data. The Mahalanobis space can be used for multi-class classification. Once this MS is established, the useful set of variables is identified to assist in the model analysis or diagnosis using orthogonal arrays and signal-to-noise ratios. And other several techniques have already been used for classification, such as linear discriminant analysis and logistic regression, decision trees, neural networks, etc. The goal of this case study is to compare the ability of the Mahalanobis-Taguchi System and logistic regression using a data set.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.48
• /
• pp.15-23
• /
• 1998

This paper concerns the problem of determining the spare inventory level for multi-echelon repairable-item inventory system with finite number of operating items. We consider the system which has several bases and a central depot. When an item fails, it is dispatched to a repair facility and, a spare, if available, is plugged in immediately. When the failed item is repaired, it is sent to the base and either is used to fill a backorder or is stored at a spare inventory point. Using queueing network, we develop an algorithm to find the spare inventory level which minimizes the total expected cost and, simultaneously, satisfies a specified minimum fill rate. The results of the algorithm clearly indicate that the algorithm successfully generate output with optimal solution.