• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.9
• /
• pp.836-843
• /
• 2000

A sequence planning method is proposed to reduce the assembly time of gantey-type chip mounters with single head. The overall path of the chip mounter is divided into forward and backward path, and formulate the optimization problem is formulated as an transpoetation problem and an Euler's tour problem. The transportation alforithm is applied to find optimal backward path, and Euler's tour algorithm used to generate an assembly sequence. Simulation results are presented to verify the usefulness of the proposed method.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.4 no.1
• /
• pp.25-31
• /
• 1979

We consider the optimal ordering policy for a single-product two-stage inventory system where the main assumptions are as follows: (i) constant continuous demand only at stage 2, (ii) constant input (production) rate at stage 1, (iii) instantaneous delivery (transportation) from stage 1 to stage 2, (iv) backlogging is allowed only at stage 2, (v) an infinite planning horizon. Costs considered are ordering and linear holding costs at both stages, and linear shortage cost only at stages 2. By solving 9 different case problems, we have observed the general from of the optimal ordering policies for our model which minimizes the total cost per unit time. It is noticeable from this observation that the questionable but more often than not adopted assumption by many authors in determining the optimal potimal policy for multistage inventory systems, that the ordering (lot) sizes at each stage remain constant thruout the planning horizon, is not valid.

• Information Systems Review
• /
• v.10 no.1
• /
• pp.115-133
• /
• 2008

The third-party logistics industry mainly delivers goods from a place to an arrival place on behalf of the freight owner. To handle the work, they need a transportation route including transportation equipment between the starting place and the arrival place, schedule information for departure/arrival and transportation cost. Actually, automatic searching for an optimal transportation route, which considers arrival and departure points for intermodal transportation, is not a simple problem. To search efficiently transportation route, the collection of schedule information for intermodal transportation and transportation route generation have become critical and vital issues for logistics companies. Usually, they manually make a plan for a transportation route by their experience. Because of this, they are limited in their ability if there is too much cargo volume and a great many transactions. Furthermore, their dependence on the conventional way in doing business causes an inefficient selection of transporters or transportation routes. Also, it fails to provide diverse alternatives for transportation routes to the customers, and as a result, increases logistics costs. In an effort to solve these problems, this study aims to develop a route planning system based on agent, which can collect scattered schedule information on the Web. The route planning system also has an algorithm for transportation route generation in intermodal transportation.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.16 no.4
• /
• pp.225-237
• /
• 2016

In conventional transportation problem (TP), all the parameters are always certain. But, many of the real life situations in industry or organization, the parameters (supply, demand and cost) of the TP are not precise which are imprecise in nature in different factors like the market condition, variations in rates of diesel, traffic jams, weather in hilly areas, capacity of men and machine, long power cut, labourer's over time work, unexpected failures in machine, seasonal changes and many more. To counter these problems, depending on the nature of the parameters, the TP is classified into two categories namely type-2 and type-4 fuzzy transportation problems (FTPs) under uncertain environment and formulates the problem and utilizes the trapezoidal fuzzy number (TrFN) to solve the TP. The existing ranking procedure of Liou and Wang (1992) is used to transform the type-2 and type-4 FTPs into a crisp one so that the conventional method may be applied to solve the TP. Moreover, the solution procedure differs from TP to type-2 and type-4 FTPs in allocation step only. Therefore a simple and efficient method denoted by PSK (P. Senthil Kumar) method is proposed to obtain an optimal solution in terms of TrFNs. From this fuzzy solution, the decision maker (DM) can decide the level of acceptance for the transportation cost or profit. Thus, the major applications of fuzzy set theory are widely used in areas such as inventory control, communication network, aggregate planning, employment scheduling, and personnel assignment and so on.

• Journal of Construction Engineering and Project Management
• /
• v.5 no.4
• /
• pp.7-11
• /
• 2015

The luffing-tower crane (T/C) is a key facility used in the vertical and horizontal transportation of materials in a tall building construction. Locating the crane in an optimal position is an essential task in the initial stages of construction planning. This paper proposes a new optimization model to locate the luffing T/C in the optimal position to minimize the transportation time. A newly developed mathematical formula is suggested to calculate the transportation time of luffing T/C correctly. An optimization algorithm, the Harmony Search (HS) algorithm, was used and the results show that HS has high performance characteristics to solve the optimization problem in a short period of time. In a case study, the proposed model offered a better position for T/C than the previous heuristic approach.

• ETRI Journal
• /
• v.44 no.4
• /
• pp.641-653
• /
• 2022

In the process of autonomous vehicle motion planning and to create comfort for vehicle occupants, factors that must be considered are the vehicle's safety features and the road's slipperiness and smoothness. In this paper, we build a mathematical model based on the combination of a genetic algorithm and a neural network to offer lane-change solutions of autonomous vehicles, focusing on human vehicle control skills. Traditional moving planning methods often use vehicle kinematic and dynamic constraints when creating lane-change trajectories for autonomous vehicles. When comparing this generated trajectory with a man-generated moving trajectory, however, there is in fact a significant difference. Therefore, to draw the optimal factors from the actual driver's lane-change operations, the solution in this paper builds the training data set for the moving planning process with lane change operation by humans with optimal elements. The simulation results are performed in a MATLAB simulation environment to demonstrate that the proposed solution operates effectively with optimal points such as operator maneuvers and improved comfort for passengers as well as creating a smooth and slippery lane-change trajectory.

• Journal of Industrial Technology
• /
• v.37 no.1
• /
• pp.5-11
• /
• 2017

The purpose of this research is to propose an efficient loop line operation plan for customer transportation in a new theme park. Based on the expected customer arrivals, customer loading/unloading methods, and scheduled/non-scheduled departure schemes, movement time between stations etc., we have performed indepth analyses and derived the best optimal policy. Our results show that, over all, the operation with separate loading/unloading doors and scheduled departure is preferred to the other options. We then derived the optimal number of trains and cars meeting minimal customer unsatisfaction with low cost for each season.

• Proceedings of the KSR Conference
• /
• 2004.06a
• /
• pp.1001-1006
• /
• 2004

Selection of optimal railway line is taken into consideration include of the purpose of railway, geographical features and facility of management. This study performed opinions of specialists, checking of industrial environment, analysis of bid guideline to select the optimal line and executed AHP method to make quality model and choose weight factors. Therefore, this study executed about six categories which are the efficiency of transportation, facility of planning and construction, economical efficiency, coincidency of planning, the civil appeal and environmental standards, connection with system, and indicated the differences of other method by analyze into specific factors of each categories.

• Journal of Korean Society of Transportation
• /
• v.33 no.6
• /
• pp.520-530
• /
• 2015

This paper formulates the methodologies to estimate optimal congestion tolls from long-run and short-run perspectives and applies them to the highways of Seoul. An optimal long-run congestion toll is estimated with an optimal volume-capacity-ratio to minimize the total costs which consist of two components: road construction and maintenance costs and traveler costs. By contrast, an optimal short-run congestion toll is estimated with a supply-demand equilibrium which is determined by using a speed-flow function and a disaggregate modal choice model. The results of a long-run analysis for the Seobu urban expressway suggest the optimal volume-capacity-ratio of 1.35 and the optimal congestion toll of 503 Won per automobile kilometer. By contrast, those of a short-run analysis for the Mia-ro urban arterial suggest 1.31 and 420 Won, respectively. Although our results are to some degree dependent on the interest rate and time value assumed, one basic conclusion holds up: the congestions toll tested could generate substantial gains in social welfare if applied to Seoul.

• Journal of the Society of Naval Architects of Korea
• /
• v.53 no.2
• /
• pp.115-126
• /
• 2016

In the process of ship building, it is known that the maintenance of working period and saving cost are one of the important part during the logistics of blocks transportation. Precise operational planning inside the shipyard plays a big role for a smooth transportation of blocks. But many problems arise in the process of block transportation such as the inevitable road damage during the transportation of the blocks, unpredictable stockyard utilization of the road associated with a particular lot number, addition of unplanned blocks. Therefore, operational plan needs to be re-established frequently in real time for an efficient block management. In order to find the shortest path between lot numbers, there are several representative methods such as Floyd algorithm that has the characteristics of many-to-many mapping, Dijkstra algorithm that has the characteristic of one-to-many mapping, and the A* algorithm which has the one-to-one mapping, but many authors have published without the mutual comparisons of these algorithms. In this study, some appropriate comparison have been reviewed about the advantages and disadvantages of these algorithms in terms of precision and cost analysis of calculating the paths and planning system to operate the transporters. The flexible operating plan is proposed to handle a situation such as damaged path, changing process during block transportation. In addition, an operational algorithm of a vacant transporter is proposed to cover the shortest path in a minimum time considering the situation of transporter rotation for practical use.