• Journal of Korean Society of Transportation
• /
• v.14 no.1
• /
• pp.69-80
• /
• 1996

In most cities, travel demand is distributed along long corridors and its destinations tend to concentrate in a central business district. For this kind of many-to-one or one-to-many travel demand pattern, a zonal operation of buses can be an efficient bus operation technique in which a long bus-demand corridor is divided into service zones and each service zone is provided with its own bus route connecting the service zone and single destination separately. This paper develops models of the total transportation costs for a single-zone operation and 2-zonal operation of buses for a long demand corridor with single destination in terms of various cost parameters, demand density, bus operation speeds, and location of the boundary between two service zones. In this study the total transportation cost is assumed to consist of the bus operation cost, passenger waiting cost and passenger travel time cost. It was proved that a zonal operation of buses can be more efficient than a single-zone operation for certain circumstances of the system and an boundary condition between two operation techniques was obtained. Also, several case studies were performed for various values of the cost parameters.

• Journal of the military operations research society of Korea
• /
• v.11 no.1
• /
• pp.8-32
• /
• 1985

The objective of this study is to develop the Transportation Model of Linear Programming in which optimal transportation pattern by regions (origins and destinations) to minimize the total transportation costs can be obtained for handling government-held grains. As a result of computing the Transportation Model, the total transportation costs of transporting 1,058,507 metric tons from origins to destinations are 7,234 million won. So, the transporation cost is 6,834 won per ton in this model. But actual transportation cost in 1983 is 11,498 won per ton. Therefore when we distribute and transport the government-held grains from production factories to consumption warehouses, using this Transportation Model of Linear Programming is benefitable. Especially excluding the cost of computer, we could save more than two billion won of Government budget per year.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2001.10a
• /
• pp.63-67
• /
• 2001

Since the transportation cost takes about two thirds of the logistics cost of Korean firms, significant reduction of business logistics cost can hardly be achieved without effectively reducing the transportation cost. Although consolidated transportation has been regarded as the most promising strategy for reducing the transportation cost, it has not been successful in practice. In this paper we consider a consolidated transportation for the factories located in a limited area such as industrial complexes, where loads of various volume and weight are consolidated. We want to group the loads to assign to a truck of various size such that the total transportation cost is minimized, while the maximum volume constraint and weight constraint of each truck are satisfied. We suggest four heuristic algorithms to efficiently determine the groups of loads; and conduct a computer simulation to evaluate the performances of the algorithms.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• 2008.11a
• /
• pp.922-925
• /
• 2008

Many highway projects are under way in Korea. However, owners frequently find that the project cost exceeds the budget and they are unable to identify the underlining reasons. The main purpose of this research is to develop cost models for transportation projects in Korea using the multiple linear regression (MLR). The data consist of 27 completed transportation projects, built from 1991 to 2001, The technique of multiple regression analysis is used to develop the parametric cost estimating model for total budget cost per highway square meter (TBC/$m^2$). Findings of the study indicated that MLR car be applied to highway projects in Korea. There are twf) major contributions of this research. (1) the identification of transportation parameters as a significant cost driver for transportation costs and (2) the successful development of the parametric cost estimating models for transportation projects in Korea.

• Korean Management Science Review
• /
• v.34 no.1
• /
• pp.1-13
• /
• 2017

The percentage of 3PL (Third-party Logistics), which uses third party businesses to outsource elements of the company's distribution and fulfillment services, is increasing steadily. To provide 3PL service to the customers, it is needed to estimate the total transportation cost and propose the unit cost to the customers. In this paper, we develop a decision support system for estimation of transportation cost of 3PL provider considering various transportation services, such as direct transportation, multi point visiting transportation, and cross docking. The system supports route planning of vehicles by using algorithms based on tabu search and dynamic programming.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.2
• /
• pp.331-336
• /
• 2018

In this paper, the life cycle cost of the auxiliary power unit in the conventional 8200 series electric locomotive is evaluated and an effective life cycle cost reduction method is sought. For this, a life cycle cost evaluation model was proposed using IEC 60300-3-3 standard. As a result of analysis, material cost which accounted for a large percentage of preventive maintenance cost, accounted for 64% of total cost, and breakdown maintenance cost was as high as 27%. Except for the cost of preventive maintenance, the breakdown maintenance cost ratio was the highest. In order to reduce the LCC of the auxiliary power unit(APU) of the 8200 series in the future, it is necessary to reduce the material cost in case of development and to secure the high reliability according to the parts manufacturing so as to minimize the maintenance cost.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.1
• /
• pp.157-165
• /
• 1998

This paper considers the single-product production and transportation problem with discrete time, dynamic demand and finite time horizon, an extension of classical dynamic lot-sizing model. In the model, multiple freight container types are allowed as the transportation mode and each order (product) placed in a period is shipped immediately by containers in the period. Moreover, each container has type-dependent carrying capacity restriction and at most one container type is allowed in each shipping period. The unit freight cost for each container type depends on the size of its carrying capacity. The total freight cost is proportional to the number of each container type employed. Such a freight cost is considered as another set-up cost. Also, it is assumed in the model that production and inventory cost functions are dynamically concave and backlogging is not allowed. The objective of this study is to determine the optimal production policy and the optimal transportation policy simultaneously that minimizes the total system cost (including production cost, inventory holding cost, and freight cost) to satisfy dynamic demands over a finite time horizon. In the analysis, the optimal solution properties are characterized, based on which a dynamic programming algorithm is derived. The solution algorithm is then illustrated with a numerical example.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.5
• /
• pp.29-38
• /
• 2018

This study aims to propose a method for the estimation of operational delay cost using transportation card data in bus accidents. Average operational delay time from bus accidents was surveyed among 12 bus companies through an interview method. Then, the operational delay cost was estimated using actual traffic accident data and transportation card data. Results showed that average loss time per bus accident was found to be 45 minutes. In addition, total occupancy of 659 was estimated for the accidents investigated using transportation card data, resulting a total loss time of 494.25 hours. An estimated operational delay cost was 186.9 thousand won per accident, which was 6.37% of social agency cost. The magnitude of this number implied that operational delay cost may have a significant impact on traffic accident cost if included.

• Journal of the Korean Society of Safety
• /
• v.24 no.5
• /
• pp.48-56
• /
• 2009

This paper presents the procedure for the optimal design of a PSC-I girder bridge considering life cycle cost (LCC). The load carrying capacity curves for the concrete deck, PSC-I girder and $\pi$-type pier were derived and used for the estimate of service lives. Total life cycle cost for the service life was calculated as sum of initial cost, damage cost, maintenance cost, repair and rehabilitation cost, user cost, and disposal cost. The advanced First Order Second Moment method was used to estimate the damage cost. The optimization method was applied to the design of PSC-I girder bridge. The objective function was set to the annual cost, which is defined by dividing the total life cycle cost by the service life, and constraints were formulated on the basis of Korean Standards. The optimal design was performed for various service lives and the effects of design factors were investigated.

• Journal of the Korean Society for Railway
• /
• v.15 no.2
• /
• pp.185-192
• /
• 2012

Line planning is to determine the frequency of trains on each line to satisfy origin-destination demand while minimizing total operation cost. However, different from the line planning in passenger transportation, it is more important at which intermediate stations each train should be stopped and shunted because the freight car handling works like drop-off or(and) pick-up can incur much time and high cost so that the delay deteriorates the quality of rail freight transportation service. We present an optimization model for constructing line plan in rail freight transportation to simultaneously minimize the train operation cost and total transportation time of freights. And we suggest a column generation approach for our problem, which can solve the real network instances in reasonable computation times.