• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.5
• /
• pp.181-188
• /
• 2021

In preparing a aggregate production plan(APP), the transportation method generally uses a linear planning(LP) software package for TSM(transportation simplex method), which seeks initial solutions with either NCM, LCM, or VAM specialized in transportation issues and optimizes them with either SSM or MODI. On the other hand, this paper proposes a transportation method that easily, quickly, and accurately prepares a APP without software package assistance. This algorithm proposed simply assigned to least cost-first, and minimized the inventory periods. Applying the proposed algorithm to 6-benchmarking data, this algorithm can be obtained better optimal solution than VAM or LP for 4 data, and we obtain the same results for the remained 2 data.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.26 no.2
• /
• pp.96-105
• /
• 2021

Large-scale power converters consist of series or parallel module combinations. In these modular converter systems, the interleaving technique can be applied to improve capacitor reliability by reducing the ripple of the I/O current in which each module operates as a phase difference. However, when applying the interleaving technique for conventional three-level boost converters, the short-circuit period of the converter can be an obstacle. Such problem is caused by the absence of a low-level inductor of the conventional three-level boost converter. To solve this problem, a three-level boost converter with a low-level inductor is proposed and analyzed to enable interleaved operation. In the proposed circuit, the current ripple of the output capacitor depends on the neutral point connections between the modules. In this study, the ripple current is analyzed by the neutral point connections of the three-level boost converter that has a low-level inductor, and the effectiveness of the proposed circuit is proven by simulation and experiment.

• Journal of Korean Port Research
• /
• v.11 no.1
• /
• pp.13-28
• /
• 1997

Today the congestion problem is a problem for the most of the cities to solve. Especially, traffic congestion in the big cities is occurring regardless of the rush-hours. Because the transportation facilities secured in the big cities are very low, and the financial resources and sites for the expansion of new transportation facilities are also limited. Therefore the appropriate Transportation system Management(TSM) techniques which could improve the transportation system are absolutely required to solve the transportation problems instead of the expansion of the transportation facilities in the big cities. The purpose in this study was to review the travel characteristics on the Pretimed Signalized - Intersections under the study in Pusan area, construct the travel systems during the different time-periods based upon the travel characteristics reviewed, and finally suggest the optimal travel systems which could reduce the traffic delay and fuel consumption of the Pretimed Signalized - Intersections based upon the travel system constructed. Based upon the results, it could be concluded that the pretimed signal system based upon the on-peak periods should not be applied to all the different time-periods on the Pretimed Signalized - Intersections(PSI) to reduce traffic delay and fuel consumption, and increase the travel capacity on the intersections in Pusan area.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.4
• /
• pp.23-32
• /
• 2004

This paper addresses a model for the transportation planning that determines the transportation cycle time and the vehicle size to minimize the cost in a distribution system. The vehicle routing to minimize the transportation distance of the vehicles is also determined. A distribution system is consisted of a distribution center and many retailers. Products are transported from distribution center to retailers according to transportation planning. A model is assumed that the time horizon is continuous and infinite, and the demand of retailers is constant and deterministic. Cost factors are the transportation cost and the inventory cost, which the transportation cost is proportional to the transportation distance of vehicle when products are transported from distribution center to retailers, and the inventory cost is proportional to inventory amounts of retailers. A transportation cycle time and a vehicle size are selected among respective finite alternatives. The problem is analyzed, and a illustrative example is shown.

• Proceedings of the KSR Conference
• /
• 2010.06a
• /
• pp.1951-1957
• /
• 2010

Study of Lunar exploration is progressed and manned lunar exploration is planned. In order to explore in Lunar, we need habitat to stay for a long time and system that mine, classify and transport materials. Lunar has dust that is very light-tiny. That is on the air for a long time so there are problems to adject transportation system such as vehicle. However, it can solve the problem to use pipe transportation system. This transportation system help materials move continually and is more effective than other transportation system such as train or vehicle. For those positive points, some experts studied about tube transportation systems. I introduce these system and find out factors that can be used in Lunar regolith transportation system. I suggest Lunar regolith transportation system, using the factors.

• Journal of Navigation and Port Research
• /
• v.29 no.9
• /
• pp.795-800
• /
• 2005

Nowadays, road transportation which has played a key role in the market of both passenger and freight transportation is facing with a serious problem, the traffic congestion causing a delay of transportation. Therefore, railroad transportation is considered as an attractive alternative mode of inland transportation due to its inherent merits in mass transportation such as relatively low cost compared with road transportations, less air pollution and noise than other mode ets. In this paper, therefore, we examine the current situation of railroad transportation markets including TKR(Trans- Korean Railway}, TSR(Trans-Siberian Railway} and prospects for the connection of TKR-TSR. And then we examine the structure of the container transportation market by railroad in Korea with a brief analysis of the traffic volume of TKR-TSR.

• Journal of applied mathematics & informatics
• /
• v.33 no.1_2
• /
• pp.157-172
• /
• 2015

We introduce a non-Euclidean metric for transportation systems with a defined minimum transportation cost (initial fare) and investigate the continuous single-facility Weber location problem based on this metric. The proposed algorithm uses the results for solving the Weber problem with Euclidean metric by Weiszfeld procedure as the initial point for a special local search procedure. The results of local search are then checked for optimality by calculating directional derivative of modified objective functions in finite number of directions. If the local search result is not optimal then algorithm solves constrained Weber problems with Euclidean metric to obtain the final result. An illustrative example is presented.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.3
• /
• pp.62-69
• /
• 2006

Vehicle routing problem with time windows is determined each vehicle route in order to minimize the transportation costs. All delivery points in geography have various time restriction in camparision with the basic vehicle routing problem. Vechicle routing problem with time windows is known to be NP-hard, and it needs a lot of computing time to get the optimal solution, so that heuristics are more frequently developed than optimal algorithms. This study aims to develop a heuristic method which combines guided local search with a tabu search in order to minimize the transportation costs for the vehicle routing assignment and uses ILOG programming library to solve. The computational tests were performed using the benchmark problems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.7
• /
• pp.3566-3582
• /
• 2019

In intelligent warehouse picking system, the allocation of tasks has an important influence on the efficiency of the whole system because of the large number of robots and orders. The paper proposes a method to solve the task allocation problem that multi-robot task allocation problem is transformed into transportation problem to find a collision-free task allocation scheme and then improve the capability of task processing. The task time window and the power consumption of multi-robot (driving distance) are regarded as the utility function and the maximized utility function is the objective function. Then an integer programming formulation is constructed considering the number of task assignment on an agent according to their battery consumption restriction. The problem of task allocation is solved by table working method. Finally, simulation modeling of the methods based on table working method is carried out. Results show that the method has good performance and can improve the efficiency of the task execution.

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.3
• /
• pp.20-33
• /
• 2006

Because of rapid expansion of third party logistics, fierce competition in the transportation industry, and the diversification and globalization of transportation channels, an effective transportation planning by means of multimodal transport is badly needed. Accordingly, this study aims to suggest an optimal transport algorithm for the multimodal transport in the international logistics. As a solution for this problem, first of all, we have applied a pruning algorithm to simplify it, suggesting a heuristic algorithm for constrained shortest path problem to find out a feasible area with an effective time range, which has been applied to the Label Setting Algorithm, consequently leading to multiple Pareto optimal solutions. Also, in order to test the efficiency of the algorithm for constrained shortest path problem, this paper has applied it to the actual transportation path from Busan port of Korea to Rotterdam port of Netherlands.