• 대한산업공학회지
• /
• 제28권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.

• 산업공학
• /
• 제11권1호
• /
• pp.55-66
• /
• 1998

Fleet sizing and distribution of empty equipments are two of the most critical problems in managing transportation system. This paper develops a cost model for sizing a fleet and establishing decentralized redistribution polices of empty equipments by building from inventory theory of multi-echelon system in hub-and-spoke network. An analytical approach to determine control variables of redistribution policies in each terminal and fleet size of the transportation system is proposed and its results are validated by simulation model. Numerical experiments are conducted with respect to parameters of the model and test results for assumptions of the model are discussed.

• 한국경영과학회지
• /
• 제24권3호
• /
• pp.109-123
• /
• 1999

Fleet sizing and empty equipment redistribution are two of the most critical problems in managing a fleet of equipment over a transportation network. Where the demand pattern followed the compound Poisson process(CPP) which can be generated one or more at a time under homogeneous Poisson process(HPP), this paper presented a mathematical model to determine control parameters of a decentralized distribution policy and fleet size in case of the pure hub-and-spoke system, a popular form of a logistics system. and validated this model by simulation. That is, where the number of demanded equipments followed geometric and binomial distributions, respectively, cost models on the pure hub-and-spoke logistics system with deterministic trans-portation times, which could be solved analytically, were established and analyzed. We also compared the deterministic case with stochastic one that the transportation time follows some probability distributions.

• 산업공학
• /
• 제16권2호
• /
• pp.174-184
• /
• 2003

This paper addresses a fleet operation planning problem for a static freight container transportation system in which all the transportation requirements are predetermined at the beginning of a planning horizon. In the transportation system under consideration, a number of loaded containers are to be moved between container storage yards. An optimal fleet planning model is used to determine the minimum number of vehicles required. Based on the results from the optimal model, a tabu-search based algorithm is presented to perform a given transportation requirements with the least number of vehicles. The performance of the new procedure is evaluated through some experiments in comparison with two existing methods, and the it is found that our procedure produces good-quality solutions.

• 산업공학
• /
• 제20권2호
• /
• pp.204-215
• /
• 2007

This paper addresses vehicle routing planning in freight container transportation systems where a number of loaded containers are to be delivered to their destination places. The system under consideration is static in that all transportation requirements are predetermined at the beginning of a planning horizon. A two-phased procedure is presented for freight container transportation. In the first phase, the optimal model is presented to determine optimal total time to perform given transportation requirements and the minimum of number of vehicles required. Based on the results from the optimal model, in the second phase, ASA(Accelerated Simulated Annealing) algorithm is presented to perform all transportation requirements with the least number of vehicles by improving initial vehicle routing planning constructed by greedy method. It is found that ASA algorithm has an excellent global searching ability through various experiments in comparison with existing methods.