• 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 the Korea Society of Computer and Information
• /
• v.21 no.9
• /
• pp.91-100
• /
• 2016

In this research, emergency vehicle dispatching problems faced with in the wake of massive natural disasters are considered. Here, the emergency vehicle dispatching problems can be regarded as a single machine stochastic scheduling problems, where the processing times are independently and identically distributed random variables, are considered. The objective of minimizing the expected number of tardy jobs, with distinct job due dates that are independently and arbitrarily distributed random variables, is dealt with. For these problems, optimal static-list policies can be found by solving corresponding assignment problems. However, for the special cases where due dates are exponentially distributed random variables, using a proposed dynamic programming approach is found to be relatively faster than solving the corresponding assignment problems. This so-called Pivot Dynamic Programming approach exploits necessary optimality conditions derived for ordering the jobs partially.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.3
• /
• pp.67-80
• /
• 2005

This paper deals with a container terminal where containers are discharged by quay cranes from a ship and transported by a fleet of vehicles to the terminal yard. Since container terminals are fully utilized in general, It is important to increase terminal throughput by discharging the containers out of the ship without any delay, At the operational level, it should be decided which vehicle transports which container. The vehicle dispatching decision should be carefully made since the container discharging time increases when the quay cranes wait idle for the vehicles. This paper presents vehicle dispatching heuristics with the objective of minimizing the total container discharging time. The heuristics are based on a network flow model and a look-ahead concept. Through some experiments, the performance of the dispatching methods is evaluated.

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

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2011.06a
• /
• pp.218-219
• /
• 2011

This paper focuses on dispatching strategy for AGVs(Automated Guided Vehicle). The goal of AGV dispatching problem is allocating jobs to AGVs to minimizing QC delay and AGV total travel distance. Due to the highly dynamic nature of container terminal environment, the effect of dispatching is hard to predict thus it leads to frequent modification of dispatching results. Given this situation, single rule-based approach is widely used due to its simplicity and small computational cost. However, single rule-based approach has a limitation that cannot guarantee a satisfactory performance for the various performance measures. In this paper, dispatching strategy based on multicriteria heuristics is proposed. Proposed strategy consists of multiple decision criteria. A muti-objective evolutionary algorithm is applied to optimize weights of those criteria. The result of simulation experiment shows that the proposed approach outperforms single rule-based dispatching approaches.

• Journal of Navigation and Port Research
• /
• v.35 no.6
• /
• pp.501-507
• /
• 2011

This paper focuses on dispatching strategy for AGVs(Automated Guided Vehicle). The goal of AGV dispatching is assigning AGVs to requested job to minimizing the delay of QCs and the travel distance of AGVs. Due to the high dynamic nature of container terminal environment, the effect of dispatching is hard to predict thus it leads to frequent modification of dispatching decisions. In this situation, approaches based on a single rule are widely used due to its simplicity and small computational cost. However, these approaches have a limitation that cannot guarantee a satisfactory performance for the various performance measures. In this paper, dispatching strategy based on multicriteria heuristics is proposed. The Proposed strategy consists of multiple decision criteria. A multi-objective evolutionary algorithm is applied to optimize weights of those criteria. The result of simulation experiment shows that the proposed approach outperforms single rule-based dispatching approaches.

• Journal of Korean Institute of Industrial Engineers
• /
• v.41 no.3
• /
• pp.233-242
• /
• 2015

This paper analyzes a multi-product inbound lot-sizing and outbound dispatching problem with multi-vehicle types in a third-party logistics distribution center. The product must be delivered to the customers within the delivery time window and backlogging is not allowed. Replenishing orders are shipped by several types of vehicles with two types of the freight costs, i.e., uniform and decreasing, are considered. The objective of this study is to determine the lot-size and dispatching schedules to minimize the total cost with the sum of inbound and outbound transportation and inventory costs over the entire time horizon. In this study, we mathematically derive a mixed-integer programming model and propose a genetic algorithm (GA1) based on a local search heuristic algorithm to solve large-scale problems. In addition, we suggest a new genetic algorithm (GA2) with an adjusting algorithm to improve the performance of GA1. The basic mechanism of the GA2 is to provide an unidirectional partial move of products to available containers in the previous period. Finally, we analyze the results of GA1 and GA2 by evaluate the relative performance using the gap between the objective values of CPLEX and the each algorithm.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.64 no.11
• /
• pp.1578-1586
• /
• 2015

Personal rapid transit (PRT) is getting attention as a new form of transportation. It is energy efficient and provides the high level of passenger service. In this study, the dynamic PRT dispatching and routing problem is dealt with. Passengers request transportation service on a complex network, and an operating system monitors passenger arrivals and coordinates vehicles in real time. A new online dispatching and routing algorithm is proposed, which minimizes the total travel distance of vehicles and the waiting time of passengers. The algorithm dispatches vehicles by considering multiple vehicles' state and multiple passengers at the same time. In particular, finding the shortest-time path is attempted by taking into account the future congestion on lanes. Discrete-event simulation is employed to validate the performance of the proposed algorithm. The results show the algorithm in this study outperforms others.

• Journal of the Korea Society for Simulation
• /
• v.23 no.4
• /
• pp.97-109
• /
• 2014

Personal rapid transit (PRT) is a new transportation system, which is energy efficient and brings high quality of customer service. Customers arrive dynamically at stations and request transportation service. In this paper, we propose a new online PRT dispatching algorithm for pickup and delivery of customers. We adopt the nearest neighbor dispatching rule, which is known as performing well in general. We extend the rule with bipartite matching in order to deal with multiple vehicles and customers at the same time. We suggest a systematic way for selecting vehicles that will be considered to be dispatched, since the scope with which vehicles are selected may affect the system performance. We regard the empty travel distance of vehicles and the customer waiting time as the performance measures. By using simulation experiments, it has been examined that the scope of dispatching affects the system performance. The proposed algorithm has been validated by comparing with other dispatching rules for transportation services. We have shown that our algorithm is more suitable for PRT operating environment than other dispatching rules.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.1
• /
• pp.107-117
• /
• 2002

The ever-glowing demands for more responsiveness and more flexibility in manufacturing generate greater expectation for the AGV system. So far. a significant amount of research has been carried out to fulfill those requirements. However, the dynamic characteristics of manufacturing systems make it hard to solve the problem analytically. In this paper, the AGV system is analyzed in the production environments which adopt a cycle time to produce materials. The use of the cycle time could eliminate much of uncertainty Inherent In the manufacturing process so that it is possible to build the deterministic model for the AGV systems, which eventually Produce better results on the important issues such as AGV dispatching, determination of the number of AGVs, and empty vehicle travel time.